Abstract
Public transport driver scheduling is a process of selecting a set of duties for the drivers of vehicles to form a number of legal driver shifts. The problem usually has two objectives which are minimising both the total number of shifts and the total shift cost, while taking into account some constraints related to labour and company rules. A commonly used approach is firstly to generate a large set of feasible shifts by domain-specific heuristics, and then to select a subset to form the final schedule by an integer programming method. This paper presents an estimation of distribution algorithm (EDA) to deal with the subset selection problem which is NP-hard. To obtain a candidate schedules, the EDA applies a number of rules, with each rule corresponding to a particular way of selecting a shift. Computational results from some real-world instances of drive scheduling demonstrate the availability of this approach.
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.
