Simultaneous vehicle and crew scheduling for extra urban transports

16Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a simultaneous approach to solve the integrated vehicle and crew scheduling problem in an extra urban context. We consider the single depot case with a heterogeneous fleet 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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Laurent, B., & Hao, J. K. (2008). Simultaneous vehicle and crew scheduling for extra urban transports. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5027 LNAI, pp. 466–475). https://doi.org/10.1007/978-3-540-69052-8_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free