A Heuristic Solution for a Driver-Vehicle Scheduling Problem

Benoît Laurent (), Valérie Guihaire () and Jin-Kao Hao ()
Additional contact information
Benoît Laurent: Perez Informatique
Valérie Guihaire: Perez Informatique
Jin-Kao Hao: Université d’Angers

A chapter in Operations Research Proceedings 2005, 2006, pp 703-708 from Springer

Abstract: Summary A driver-vehicle scheduling problem in a limousines rental company is studied. Given a set of trip demands to be covered, the goal is to find a driver-vehicle schedule that covers as many as possible of the required demands while satisfying a set of imperative constraints and optimizing several cost objectives. A formulation of the problem is given and a solution approach using local search is developed.

Keywords: Schedule Problem; Local Search; Heuristic Solution; Hill Climbing; Crew Schedule (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-32539-0_110

Ordering information: This item can be ordered from
http://www.springer.com/9783540325390

DOI: 10.1007/3-540-32539-5_110

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().