Model and Algorithm for Making Locomotive Working Diagram Based on Multiple Traveling Salesmen Problem
-
摘要: 为了提高机车的工作效率,探讨了机车周转图编制模型与算法.对于给定的列车运行图,综合考虑机车使用台数最少和图形均衡性,提出了一种编制机车周转图的新算法.将机车周转图编制问题转化为多旅行商问题(MTSP)并建立数学模型,从而求得问题的最优解.最后,用列车运行图实际数据进行了验证,证明了该算法的有效性.
-
关键词:
- 机车周转图 /
- 多旅行商问题(MTSP) /
- 列车运行图
Abstract: To improve the working efficiency of locomotives,model and algorithm for making locomotive working diagrams were investigated.To a given train diagram,a new algorithm for making a locomotive working diagram with the minimum number of locomotives used and the equilibrium of time was proposed.A locomotive working diagram was transformed to a multiple traveling salesmen problem,and its mathematical model was set up to gain the optimum solution.Actual train diagram data have proven that this algorithm is useful to obtain the optimal equilibrium of a locomotive working diagram with a minimum locomotive number. -
肖龙文.最优机车周转图的自动化铺划[J].长沙铁道学院学报,1999,17(1):54-59.XIAO Longwen.Computerized planning of the optimal locomotive working diagram[J].Journal of Changsha Railway University,1999,17(1):54-59. 史峰,胡安洲.机车周转图的线性配置算法[J].铁道学报,1996,8(4):18-24.SHI Feng,HU Anzhou.A linear algorithm to deploy a locomotive circulating diagram[J].Journal of the China Railway Society,1996,8(4):18-24. 吕红霞,杨明伦,毛节铭.计算机编制不成对机车周转图的研究[J].西南交通大学学报,1998,33(4):20-24.LU Hongxia,YANG Minglun,MAO Jieming.A study on working non-pairs locomotive turn-around diagram with computer[J].Journal of Southwest Jiaotong University,1998,33(4):20-24. 柏明国,李书金,韩梅.CVRP问题的一种启发式算法[J].山东科技大学学报,2003,22(4):56-58.BAI Mingguo,LI Shujin,HAN Mei.A heuristic algorithm for CVRP[J].Journal of Shandong Institute of Mining & Technology,2003,22(4):56-58. 卢厚清,王辉东,黄杰,等.任务均分的多旅行商问题[J].系统工程,2005,23(2):22-24.LU Houqing,WANG Huidong,HUANG Jie,et al.Dividing into equal task of MTSP[J].Systems Engineering,2005,23(2):22-24. -
点击查看大图
计量
- 文章访问数: 1604
- HTML全文浏览量: 73
- PDF下载量: 497
- 被引次数: 0
下载: