|
|||||
|
|
Combined empty and loaded train scheduling for dedicated freight railway corridors |
|
| Affiliation: | 1. Department of Transport and Planning, Delft University of Technology, The Netherlands;2. Network Optimisation Team, Command Control & Signalling, Network Rail Ltd., United Kingdom;3. Department of Transport, Technical University of Denmark, Denmark;1. Transport and Mobility Laboratory (TRANSP-OR), School of Architecture, Civil and Environmental Engineering (ENAC), École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, CH-1015, Switzerland;2. Sino-US Global Logistics Institute, Shanghai Jiaotong University, 1954 Huashan Rd., Shanghai, 200030, PR China;1. Department of Industrial Engineering, Izmir Bakircay University, Gazi Mustafa Kemal Mahallesi, Kaynaklar Caddesi Seyrek, Menemen, Izmir, Turkey;2. Department of Mechanical and Manufacturing Engineering, Aalborg University, A.C. Meyers Vænge 15 København SV, Denmark |
| Abstract: | The efficient utilization of expensive rolling-stock has become imperative for all railroads. In this paper, we study the combined empty and loaded train-scheduling problem for the upcoming dedicated freight corridors in India. Existing optimization models either do not consider the simultaneous optimization of the loaded and empty flows or are not solvable for large railroads. Our model is the first of its kind to incorporate link capacity constraints in an IP formulation for this operational level problem. A simulated annealing algorithm hybridized with a constructive heuristic is proposed as the solution method. The computational experiments show that the proposed heuristic performs well both in terms of runtime and solution quality. |
| Keywords: | Railroad transportation Empty rail car distribution Dynamic vehicle allocation Train scheduling |
| 本文献已被 ScienceDirect 等数据库收录！ | |