Abstract
An improved railway crew scheduling model was presented, and the objective was to schedule crews in such a way that the deadheading was minimized while the operational constrains were satisfied. Ant colony algorithm (ACA) was devised to solve railway crew scheduling problem (RCSP) based on principle of ACA used to solve vehicle routing problem (VRP). Improvement on route construction rule and Pheromone updating rule was adopted on the basis of former algorithm. An example was analyzed to demonstrate the correctness of the application of this algorithm. It is proved that ACA is efficient and robust in solving RCSP.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
