Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Ejection chains, reference structures and alternating path methods for traveling salesman problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
Transportation Science
Multiple-Depot Integrated Vehicle and Crew Scheduling
Transportation Science
Simultaneous vehicle and driver scheduling: A case study in a limousine rental company
Computers and Industrial Engineering
Transit network timetabling and vehicle assignment for regulating authorities
Computers and Industrial Engineering
| Hi-index | 0.00 |
We present a simultaneousapproach to solve the integrated vehicle and crew scheduling problem in an extra urban context. We consider the single depot case with a heterogeneousfleet of vehicles. We propose a constraint based model which is subsequently solved by a Greedy Randomized Adaptive Search Procedure. The construction phase of each initial solution relies on constraint programming techniques, while the local search phase exploits a powerful neighborhood exploration mechanism. The computational experiments conducted on real-world instances show the effectiveness and the flexibility of the approach compared with the classical sequential vehicle and crew scheduling.