交通运输系统工程与信息

交通运输系统工程与信息 ›› 2007, Vol. 7 ›› Issue (2): 88-92 .

• 系统工程理论与方法 • 上一篇    下一篇

基于变异进化的不固定牵引方式双肩回交路机车最优配置算法

何奉道1 , 何冬昀2   

  1. 1.西南交通大学信息科学与技术学院，四川成都 610031；2.四川大学工商管理学院，四川成都 610064
  • 收稿日期:2006-09-25 修回日期:1900-01-01 出版日期:2007-04-20 发布日期:2007-04-20

A Mutating Evolution Algorithm for Locomotive Diagram with Double Shoulders-Circuit Locomotive Routing by the Mode that Unfixed Traction

He Feng-dao1 , He Dong-yun2   

  1. 1.School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031 China；2.Business School, Sichuan University, Chengdu 610064 China
  • Received:2006-09-25 Revised:1900-01-01 Online:2007-04-20 Published:2007-04-20

PDF

被引次数

5

摘要： 建立了不固定牵引方式双肩回交路机车周转图的数学模型，以机车在两折返段和基本段总停留时间最少为目标，设计了求解该机车运转制机车最优配置的一种变异进化算法。该算法根据个体适应度的优劣而对个体进行不同程度的变异，并采用启发式变异和随机变异两种变异策略，既使优秀个体的染色体中优良模式能够最大程度地遗传给子代，又保持了子代的多样性，有助于提高算法的优化性能和收敛速度。以某列车运行图为例仿真计算，所求得的机车段内总停留时间和需要的机车数比该运行图分别减少约23.8%和9.8%，并与遗传算法进行了比较。

关键词: 机车周转图, 双肩回交路, 变异进化算法, 优化, 铁路

Abstract: A mathematical model for double shoulders-circuit locomotive routing by the mode that unfixed traction was presented, the objective is to minimize the total time for locomotives staying in districts, and the optimized schedule was obtained with a mutating evolution algorithm. The algorithm carries on the varying degree mutate according to the fitness of the individual, and uses the heuristic mutation and the stochastic mutation can make the eminent schemas heredity to the filial generation which from the chromosome of the excellent individuals, maintains the filial generation’s multiplicity. Thereby the algorithm can enhance the optimized capability and the convergence rate. The proposed method was tested over an actual problem of train diagram. The results show that the total time of locomotives staying in districts and the required number of locomotives are reduced by about 23.8% and 9.8%， respectively, and compared with the genetic algorithm.

Key words: locomotive diagram, double shoulders-circuit locomotive routing, mutating evolution algorithm, optimization, railway