A GRASP Algorithm for the Vehicle-Reservation Assignment Problem

Beatriz Brito Oliveira (), Maria Antónia Carravilla () and José Fernando Oliveira ()
Additional contact information
Beatriz Brito Oliveira: University of Porto
Maria Antónia Carravilla: University of Porto
José Fernando Oliveira: University of Porto

A chapter in Computational Management Science, 2016, pp 63-71 from Springer

Abstract: Abstract Car rental companies face a critical problem related to the empty repositions (or “deadheading trips”) of their vehicles, which comprise a significant and unnecessary financial and environmental impact. Especially when dealing with special types of vehicles whose number of units is small, the company is forced to empty reposition them between rental stations in order to meet reservations requirements concerning available time and location. This paper proposes a GRASP algorithm to generate a global vehicle schedule that maximizes the company’s profit whilst reducing the costs of empty transfers. Using real instances, the value of this approach is established.

Keywords: Local Search; Incumbent Solution; Tactical Planning; Vehicle Schedule; Vehicle Occupation (search for similar items in EconPapers)
Date: 2016
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:lnechp:978-3-319-20430-7_9

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

DOI: 10.1007/978-3-319-20430-7_9

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().