Abstract

The integer linear programming (ILP) approach plays an important role in scheduling public transport drivers, which needs heuristics to reduce the size of problems. Optimality is therefore compromised. This paper presents a column generation technique and the revised simplex approach, which can enhance the ILP solver to solve larger problem instances. Two different column generation strategies for driver scheduling were analyzed based on the well-known driver scheduling approaches: TRACS II and HASTUS, whilst the definition of the reduced cost for non-basic variables was depicted. The limitations of the two successful approaches were finally summarized, from which some further research could be found.

Full Text
Paper version not known

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 call

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.