Christensen, Tue R.L.

Govinda Raja Perumal, Shyam Sundar

Larsen, Jesper

Lusby, Richard Martin

Riis, Morten

Given a set of timetabled bus trips, transport companies are faced with the challenge of finding a feasible driver schedule that covers all trips and abides by various labor union regulations. The regulations are primarily concerned with providing sufficient breaks for the drivers during the day. Practical limitations in the city network enforce drivers to travel by cars between bus stops to have breaks. Transport companies have a limited number of cars, known as staff cars,which have to be returned to their respective depots at the end of the day. The simultaneous scheduling of drivers and staff cars for the drivers is known as the driver scheduling problem with staff cars (DSPSC). It is estimated that the DSPSC accounts for 60% of a bus company’s operational expense, and this paper proposes a column generation approach that attempts to minimize operational expense. The column generation framework iterates between a master problem, a subproblem for generating driver variables and a subproblem for generating staff car variables. The subproblem related to the drivers is formulated as a resource constrained shortest path problem, which is solved by a dynamic programming approach. Several heuristic branching strategies are explored to find integer solutions. The proposed methodology is tested on eight real-life instances from seven Northern European bus companies. A comparison with a state-of-the-art mixed integer programming (MIP) solver and an adaptive large neighborhood search (ALNS) heuristic indicate that the column generation approach provides improved solutions for six instances and the average improvement is 1.45%

Online Research Database In Technology

  General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.   Users may download and print one copy of any publication from the public portal for the purpose of private study or research.  You may not further distribute the material or use it for any profit-making activity or commercial gain  You may freely distribute the URL identifying the publication in the public portal  If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.         Downloaded from orbit.dtu.dk on: Sep 17, 2019A column generation approach for the driver scheduling problem with staff carsGovinda Raja Perumal, Shyam Sundar; Larsen, Jesper; Lusby, Richard Martin ; Riis, Morten;Christensen, Tue R.L.Publication date:2019Document VersionPeer reviewed versionLink back to DTU OrbitCitation (APA):Govinda Raja Perumal, S. S., Larsen, J., Lusby, R. M., Riis, M., & Christensen, T. R. L. (2019). A columngeneration approach for the driver scheduling problem with staff cars. Abstract from 30th EUROPEANCONFERENCE ON OPERATIONAL RESEARCH, Dublin, Ireland.A column generation approach for the driver schedulingproblem with staff carsShyam S. G. Perumal1,2, Jesper Larsen1, Richard M. Lusby1, Morten Riis2, and Tue R.L. Christensen21Department of Management Engineering, Technical University of Denmark, Kgs. Lyngby, Denmark2QAMPO ApS, Aarhus, DenmarkThis work was presented at the 30th European Conference on Operational Research (EURO)held in Dublin, Ireland between June 23-26 2019.AbstractGiven a set of timetabled bus trips, transport companies are faced with the challenge of findinga feasible driver schedule that covers all trips and abides by various labor union regulations.The regulations are primarily concerned with providing sufficient breaks for the drivers duringthe day. Practical limitations in the city network enforce drivers to travel by cars between busstops to have breaks. Transport companies have a limited number of cars, known as staff cars,which have to be returned to their respective depots at the end of the day. The simultaneousscheduling of drivers and staff cars for the drivers is known as the driver scheduling problemwith staff cars (DSPSC). It is estimated that the DSPSC accounts for 60% of a bus company’soperational expense, and this paper proposes a column generation approach that attempts tominimize operational expense. The column generation framework iterates between a masterproblem, a subproblem for generating driver variables and a subproblem for generating staffcar variables. The subproblem related to the drivers is formulated as a resource constrainedshortest path problem, which is solved by a dynamic programming approach. Several heuristicbranching strategies are explored to find integer solutions. The proposed methodology is testedon eight real-life instances from seven Northern European bus companies. A comparison with astate-of-the-art mixed integer programming (MIP) solver and an adaptive large neighborhoodsearch (ALNS) heuristic indicate that the column generation approach provides improvedsolutions for six instances and the average improvement is 1.45%.1

A column generation approach for the driver scheduling problem with staff cars

https://orbit.dtu.dk/ws/files/191232163/Abstract_EURO2019.pdf

A column generation approach for the driver scheduling problem with staff cars

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology