Model and Algorithm for Making Locomotive Working Diagram Based on Multiple Traveling Salesmen Problem

TAO Ran; L&#220; Hongxia; CHEN Guangxiu

Volume 19 Issue 5

Oct. 2006

Turn off MathJax

Article Contents

Abstract

References

Journal of Southwest Jiaotong University > 2006 > 19(5): 653-657.

TAO Ran, LÜ, Hongxia, CHEN Guangxiu. Model and Algorithm for Making Locomotive Working Diagram Based on Multiple Traveling Salesmen Problem[J]. Journal of Southwest Jiaotong University, 2006, 19(5): 653-657.

Citation:

TAO Ran, LÜ, Hongxia, CHEN Guangxiu. Model and Algorithm for Making Locomotive Working Diagram Based on Multiple Traveling Salesmen Problem[J]. Journal of Southwest Jiaotong University, 2006, 19(5): 653-657.

Citation:

PDF( 0 KB)

Model and Algorithm for Making Locomotive Working Diagram Based on Multiple Traveling Salesmen Problem

TAO Ran¹,
LÜ,
Hongxia^{2
,
,},
CHEN Guangxiu²

Received Date: 05 Apr 2006
Publish Date: 25 Oct 2006

Abstract

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.
- locomotive working diagram,
- multiple traveling salesmen problem,
- train diagram

FullText(HTML)

References(5)

References

肖龙文.最优机车周转图的自动化铺划[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.

Relative Articles

Supplements(0)

Cited By

Proportional views