Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.tre.2012.11.004
Title: A column generation based approach for the Train Network Design Optimization problem
Authors: Jin, J.G.
Zhao, J.
Lee, D.-H. 
Keywords: Block-to-train assignment
Column generation
Crew-to-train assignment
Train routing
Issue Date: Feb-2013
Citation: Jin, J.G., Zhao, J., Lee, D.-H. (2013-02). A column generation based approach for the Train Network Design Optimization problem. Transportation Research Part E: Logistics and Transportation Review 50 (1) : 1-17. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2012.11.004
Abstract: This paper investigates the Train Network Design Optimization problem arising from railroad industry which involves the integration of three inter-related decision sub-problems: train routing which is to identify origin, destination and itinerary for individual trains; block-to-train assignment detailing the block movements with trains and swaps between trains; and crew-to-train assignment specifying the crew services for train routes. A column generation based hierarchical approach with two stages is designed: the first stage generates a pool of promising train routes iteratively based on the crew segments by the column generation technique; and the second stage develops an integer linear programming model for the subsequent decisions including train route selection and block-to-train assignment. Numerical experiments with realistic test instances are conducted and the outcome demonstrates the capability of the proposed approach in solving the Train Network Design Optimization problem competently. © 2012 Elsevier Ltd.
Source Title: Transportation Research Part E: Logistics and Transportation Review
URI: http://scholarbank.nus.edu.sg/handle/10635/53951
ISSN: 13665545
DOI: 10.1016/j.tre.2012.11.004
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.