A hybrid computer simulation–genetic algorithm for scheduling optimisation of cargo trains with time and queue limitations Online publication date: Sat, 31-Jan-2015
by Ali Azadeh, Hamid Reza Izadbakhsh, Malihe Mohammadhosseinzad, Mohammad Reza Raissifard
International Journal of Industrial and Systems Engineering (IJISE), Vol. 8, No. 2, 2011
Abstract: This paper presents the scheduling optimisation of cargo trains by hybrid computer simulation (CS) and genetic algorithm. Scheduling cargo trains is based on the timetable of passenger trains that have priority in relation to cargo trains. System modelling is accomplished by Visual SLAM by considering time limitations, queue priority and limited station lines. Time limitations define that a cargo train is permitted to travel from station i to j if scheduled passenger trains have completed the travel from station i to j. Queue priority means that passenger trains have priority over cargo trains. In addition, each station has a limited storage track. In addition, all repair, maintenance, loading and unloading activities are included in the simulation model. The GA is then applied to find a near-optimal schedule based on minimum queue time. The superiority and applicability of the proposed approach is shown based on a specific train route in Iran.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook