In this talk, we deal with a generalization of the well-known Vehicle Scheduling Problem(VSP) that we call Simultaneous Vehicle Scheduling and Passenger Service Problem with Flexible Dwell Times (SVSPSP-FDT). The SVSPSP-FDT generalizes the VSP because the original timetables of the trips can be changed (i.e., shifted and stretched) in order to minimize a new objective function that aims at minimizing the operational costs plus the waiting times of the passengers at transfer points. Contrary to most generalizations of the VSP, the SVSPSP-FDT establishes the possibility of changing trips' dwell times at important transfer points based on expected passenger ows. We introduce a compact mixed integer linear formulation of the SVSPSP-FDT able to address small instances. We also present a meta-heuristic approach to solve medium/large instances of the problem. The e ectiveness of the proposed solution methods is shown on a set of real-life instances provided by the main bus operator on the greater Copenhagen area. The e ects of considering exible dwell times on the objective function and on the provided solutions are also analysed.
|Publication status||Published - 2016|
|Event||28th European Conference on Operational Research - Poznan, Poland|
Duration: 3 Jul 2016 → 7 Jul 2016
Conference number: 28
|Conference||28th European Conference on Operational Research|
|Period||03/07/2016 → 07/07/2016|