INFORMATION CHANGE THE WORLD

International Journal of Intelligent Systems and Applications(IJISA)

ISSN: 2074-904X (Print), ISSN: 2074-9058 (Online)

Published By: MECS Press

IJISA Vol.9, No.10, Oct. 2017

Scheduling Freight Trains in Rail-rail Transshipment Yards with Train Arrangements

Full Text (PDF, 623KB), PP.12-19


Views:122   Downloads:10

Author(s)

Igor Grebennik, Rémy Dupas, Oleksandr Lytvynenko, Inna Urniaieva

Index Terms

Scheduling;Freight Transportation;Transportation Logistics;Transshipment Yard;Combinatorial Set;Generation;Beam Search

Abstract

A problem of scheduling freight trains in rail-rail transshipment yards is considered. It is solved at a deeper level compared to original papers dedicated to this problem: besides scheduling service slots for trains, this article additionally solves a problem of assigning every train to a railway track. A mathematical model and a solving method for this problem are given. A key feature of the given mathematical model is that it doesn’t use Boolean variables but rather operates with combinatorial objects (tuples of permutations). The solution method is also based on generation of combinatorial sets, which is quite an unusual approach for solving such problems.

Cite This Paper

Igor Grebennik, Rémy Dupas, Oleksandr Lytvynenko, Inna Urniaieva, "Scheduling Freight Trains in Rail-rail Transshipment Yards with Train Arrangements", International Journal of Intelligent Systems and Applications(IJISA), Vol.9, No.10, pp.12-19, 2017. DOI: 10.5815/ijisa.2017.10.02

Reference

[1]T. Crainic and K. Kim, "Intermodal transportation", Handbooks Oper. Res. Manag. Sci., Vol.14, pp.467–537, 2007. 

[2]J.-F. Cordeau, P. Toth, and D. Vigo, "A Survey of Optimization Models for Train Routing and Scheduling", Transp. Sci., Vol.32, pp.380–404, 1998. 

[3]N. Boysen, M. Fliedner, F. Jaehn, et al., "A Survey on Container Processing in Railway Yards", Transp. Sci., Vol.47, pp.312–329, 2013.

[4]N. Boysen, F. Jaehn, and E. Pesch, "Scheduling Freight Trains in Rail-Rail Transshipment Yards", Transp. Sci., Vol.45, pp.199–211, 2011.

[5]N. Boysen, F. Jaehn, and E. Pesch, "New bounds and algorithms for the transshipment yard scheduling problem", J. Sched., Vol.15, pp.499–511, 2012. 

[6]M. Barketau, H. Kopfer, and E. Pesch, "A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and-bound algorithm", J. Oper. Res. Soc., Vol.64, pp.1614–1621, 2013.

[7]P.K. Agrawal, M. Pandit, H.M. Dubey,"Improved Krill Herd Algorithm with Neighborhood Distance Concept for Optimization", International Journal of Intelligent Systems and Applications(IJISA), Vol.8, No.11, pp.34-50, 2016.

[8]H.A.R. Akkar and F.R. Mahdi,"Grass Fibrous Root Optimization Algorithm", International Journal of Intelligent Systems and Applications(IJISA), Vol.9, No.6, pp.15-23, 2017.

[9]S.P. Singh and S.C. Sharma,"A Particle Swarm Optimization Approach for Energy Efficient Clustering in Wireless Sensor Networks", International Journal of Intelligent Systems and Applications(IJISA), Vol.9, No.6, pp.66-74, 2017.