Solving the train formation plan network problem of the single-block train and two-block train using a hybrid algorithm of genetic algorithm and tabu search

被引:24
作者
Xiao, Jie [1 ]
Lin, Boliang [1 ]
Wang, Jiaxi [1 ]
机构
[1] Beijing Jiaotong Univ, Sch Traff & Transportat, Beijing 100044, Peoples R China
关键词
Two-block train; Train formation plan; Single-block train; Car-hour consumption; Genetic algorithm; Tabu search; RAILROAD OPERATING PLANS; ANT COLONY OPTIMIZATION; LAGRANGIAN-RELAXATION; SERVICE NETWORK; TRANSPORTATION; MODEL; DESIGN;
D O I
10.1016/j.trc.2017.10.006
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
This paper presents a formulation and solution of the railway freight Train Formation Plan (TFP) network problem in China using both the single-block trains and the two-block trains. Firstly, the single-block TEP model is established under given shipment demands, classification capacity and track quantity at the yards. Then the benefits which can be achieved by replacing single-block trains with two-block trains are systematically analyzed and summarized. The comprehensive optimization model of the train formulation plan using both the single-block trains and two-block trains is established aiming at the minimization of the total car-hour consumption at all yards. A hybrid algorithm of genetic algorithm and tabu search is developed to solve the single-block TEP model and then a greedy algorithm is proposed to replace single-block trains with two-block trains. Finally, the model and the solution approach are tested in an actual 19-yard railway sub-network in China.
引用
收藏
页码:124 / 146
页数:23
相关论文
共 24 条