Solving Train Formation Plan Problem in Freight Transportation Corridors

DOI

10.2991/esm-16.2016.24How to use a DOI?

Keywords

Freight transportation, train formation plan, mixed integer programming model, CPLEX

Abstract

The train formation plan develops the train services and assigns the transportation demands whose optimal solutions are normally difficult to find. In this paper, a new linear programming model for the train formation plan problem is proposed by the use of mixed integer programming methods. In addition, considering the long computing time by the mixed integer programming solver, an effective heuristic algorithm is designed to explore the solution space, where a neighborhood based search method evaluates, selects, and implements the moves. To verify the proposed mixed integer programming model and the solution method, numerical problems have been solved, and results are compared with those obtained by the ILOG CPLEX 12.6 version.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xinhong Zhang
AU  - Liujiang Kang
AU  - Wei Liu
AU  - Yu Yao
PY  - 2016/08
DA  - 2016/08
TI  - Solving Train Formation Plan Problem in Freight Transportation Corridors
BT  - Proceedings of the 2016 International Conference on Engineering Science and Management
PB  - Atlantis Press
SP  - 102
EP  - 104
SN  - 2352-5401
UR  - https://doi.org/10.2991/esm-16.2016.24
DO  - 10.2991/esm-16.2016.24
ID  - Zhang2016/08
ER  -