铁道标准设计Issue(1)：131-135,5.DOI:10.13238/j.issn.1004-2954.2016.01.029
基于捕食搜索策略的粒子群算法求解高铁闭塞分区划分问题
Particle Swarm Algorithm Based on Predatory Search Strategy for Partitioning of High-speed Railway Block Section
摘要
Abstract
The rational division of the high-speed railway block section serves to ensure safe traffic, improve transport efficiency and reduce investment. In this regard, the new optimization model of block section in the quasi-moving block is solved with particle swarm optimization algorithm based on predatory search strategy. The predatory search strategy balances local search and global search of the particles, so as to avoid local optimum and improve algorithm accuracy. By numerical example and comparing the optimization results of the particle swarm algorithm, the effectiveness of the particle swarm algorithm is validated based on the predatory search strategy for solving the model with more precise solutions are and faster operation speed.关键词
高速铁路/捕食搜索策略/粒子群算法/闭塞分区/准移动闭塞Key words
High-speed railway/Predatory search strategy/Particle swarm algorithm/Block section/Quasi-moving block分类
交通工程引用本文复制引用
王瑞,陈永刚..基于捕食搜索策略的粒子群算法求解高铁闭塞分区划分问题[J].铁道标准设计,2016,(1):131-135,5.基金项目
国家自然科学基金地区项目(61164101) （61164101）
