中国机械工程 ›› 2013, Vol. 24 ›› Issue (14): 1916-1922.

• 信息技术 • 上一篇    下一篇

列车调度问题模型与基于混合粒子群优化的求解算法

张其亮1,2;陈永生1   

  1. 1.同济大学,上海,200331
    2.江苏科技大学,镇江,212003
  • 出版日期:2013-07-25 发布日期:2013-07-29
  • 基金资助:
    “十一五”国家科技支撑计划资助项目(115-04-YK-048)
    The National Key Technology R&D Program(No. 115-04-YK-048)

Train Scheduling Problem Model and Its Solution Based on Hybrid Particle Swarm Optimization Algorithm

Zhang Qiliang1,2;Chen Yongsheng1   

  1. 1.Tongji University,Shanghai,200331
    2.Jiangsu University of Science and Technology,Zhenjiang,Jiangsu,212003
  • Online:2013-07-25 Published:2013-07-29
  • Supported by:
    The National Key Technology R&D Program(No. 115-04-YK-048)

摘要:

针对复线列车调度问题,建立了描述问题解空间的阻塞限制混合流水车间模型,并提出一种混合粒子群优化算法进行求解。该算法以最小化最长完工时间为目标,设计了释放-回推算法来安排列车运行顺序并计算最小化最长完工时间,利用改进的粒子群优化算法解决轨道分配问题并进行全局优化。此外,通过基于迭代邻域的搜索算法来提高种群的局部搜索能力。实验结果表明,所提出的方法能够有效地求解复线列车调度问题。

关键词: 混合流水车间调度, 粒子群优化算法, 阻塞限制, 列车调度

Abstract:

A model of hybrid flow shop problem with blocking for describing the solution space was built for the train scheduling problem on double-track line, and a hybrid particle swarm optimization (HPSO) algorithm was proposed to solve it. With the objective of minimizing makespan, release-backstepping (RB) algorithm was put forward to sequence the running trains and calculate the minimizing makespan, while an improved particle swarm optimization algorithm was employed to solve track assignment problem and implement global optimization. Besides, an iterative neighborhood search algorithm was introduced to improve the local search ability of the particle swarm optimization algorithm.The experimental results show that the train scheduling problem on double-track lines can be solved effectively with the proposed method.

Key words: hybrid flow shop scheduling, particle swarm optimization algorithm, blocking, train scheduling

中图分类号: