Self-Adaptive Genetic Algorithm for Locomotive Diagram
-
摘要: 建立了成对与不成对列车运行图的机车周转图的数学模型和相应的机车最优配置的遗传算法.用单段映射交叉和基于知识的变异方法以及交叉概率,变异概率随个体优劣程度自适应调整策略,提高了局部搜索能力以及收敛和优化性能.以某区段实际运行图为例,用本文方法使机车总消耗时间和需要的机车数分别减少约5.7%和7.7%;用文献中的实例数据计算,与原方法相比,减少了机车总消耗时间.Abstract: A mathematical model for a locomotive diagram of a train diagram with paired and non-paired trains was presented,and the optimized schedule was obtained with a genetic algorithm.The abilities of local search,convergence and optimization were raised with a two-point crossover operator and a knowledge-based mutation operator.The proposed method was tested over an actual problem of train diagram for a district on a railway line.The results show that the total time of locomotive operation and the required number of locomotives are reduced by about 5.7% and 7.7%,respectively.Another result shows that the proposed method reduces total time of locomotive operation compared with the method presented and for the same data taken in the same paper.
-
Key words:
- locomotive diagram /
- genetic algorithm /
- self-adaptive /
- optimization /
- railway
-
杨希流.优化机车周转图的简便方法[J]. 铁道运输与经济,1990(5):31-34.[2] 谢金宝,永秀.利用网络技术求解机车交路方案[J]. 铁道学报,1996,5(18):9-13.XIE Jinbao,YONG Xiu.Algorithm of optimizing locomotive working diagram by using operational network technology[J]. Journal of the China Railway Society,1996,5(18):9-13.[3] 易光宇,沈路.计算机编制机车周转图的实现方法[J]. 长沙铁道学院学报:社会科学版,2002,2(3):92-94.[4] 高小平,张兴国.计算机编制机车周转图研究[J]. 铁路计算机应用,2003,9(12):15-17.GAO Xiaoping,ZHANG Xingguo.Research on establishment of locomotive working diagram by computer[J]. Railway Computer Application,2003,9(12):15-17.[5] 何奉道,梁向阳.基于遗传算法的机车周转图优化编制方法[C]//1999年中国神经网络与信号处理学术会议论文集.北京:电子工业出版社,1999,12:267-272.HE Fengdao,LIANG Xiangyang.An algorithm of locomotive diagram optimized based on GA[C] //Proceedings of 1999 Chinese Conference on Neural Networks and Signal Processing.Beijing:Publishing House of Electronics Industry,1999,12:267-272.[6] 郑松富,梁春采.电气化铁路行车组织[M]. 北京:中国铁道出版社,1999:142-165.
点击查看大图
计量
- 文章访问数: 1643
- HTML全文浏览量: 60
- PDF下载量: 417
- 被引次数: 0