In practice, vehicle scheduling is planned on a variable timetable so that the departure times of trips can be shifted in tolerable ranges, rather than on a fixed timetable, to decrease the required fleet size. This paper investigates the vehicle scheduling problem on a variable timetable with the constraint that each vehicle can perform limited trips. Since the connection-based model is difficult to solve by optimization software for a medium-scale or large-scale instance, a designed path-based model is developed. A Benders-and-Price algorithm by combining the Benders decomposition and column generation is proposed to solve the LP-relaxation of the path-based model, and a bespoke Branch-and-Price is used to obtain the integer solution. Numerical experiments indicate that a variable timetable approach can reduce the required fleet size with a tolerable timetable deviation in comparison with a fixed timetable approach. Moreover, the proposed algorithm is greatly superior to GUROBI in terms of computational efficiency and guarantees the quality of the solution.
Optimizing Vehicle Scheduling Based on Variable Timetable by Benders-and-Price Approach
2019
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
Vehicle and Crew Scheduling with Flexible Timetable
British Library Conference Proceedings | 2007
|Integrated public transport timetable synchronization with vehicle scheduling
Taylor & Francis Verlag | 2017
|Tram Network Modeling for Optimizing Timetable
ASCE | 2019
|Optimizing Timetable Synchronization for Rail Mass Transit
Online Contents | 2008
|Optimizing Timetable Synchronization for Rail Mass Transit
British Library Online Contents | 2008
|