We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price.
- Authors
Horváth, Markó; Kis, Tamás
- Abstract
In the problem of the title, vehicle and crew schedules are to be determined simultaneously in order to satisfy a given set of trips over time. The vehicles and the crew are assigned to depots, and a number of rules have to be observed in the course of constructing feasible schedules. The main contribution of the paper is a novel mathematical programming formulation which combines ideas from known models, and an exact solution procedure based on branch-and-price. The method is tested on benchmark instances from the literature and it provides suboptimal schedules using limited computational resources.
- Subjects
MATHEMATICAL programming; SCHEDULING; PUBLIC transportation vehicle industry; COMPUTATIONAL complexity
- Publication
Central European Journal of Operations Research, 2019, Vol 27, Issue 1, p39
- ISSN
1435-246X
- Publication type
Article
- DOI
10.1007/s10100-017-0489-4