Abstract
The railway crew scheduling problem is to determine the assignment of crews to each traveling task to minimize the number of crews satisfying set covering constraints. Column generation method is often applied to solve railway crew scheduling problems. In this paper, we propose dual inequalities for railway crew scheduling problems to reduce the number of iterations in the column generation method. Three types of dual inequalities are generated from railway timetable data and they are added to the restricted master problem. Computational results show the effectiveness of the proposed method compared with the conventional column generation method.
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 callMore From: IEEJ Transactions on Electronics, Information and Systems
Disclaimer: 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.
