A GRASP Algorithm for the Vehicle-Reservation Assignment Problem
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.
KeywordsLocal Search Incumbent Solution Tactical Planning Vehicle Schedule Vehicle Occupation
The authors would like to thank the anonymous reviewers for their valuable comments that helped to improve the paper.
This work was partially funded under project “Smart Manufacturing and Logistics—NORTE-07-0124-FEDER-000057” by the North Portugal Regional Operational Programme (ON.2—O Novo Norte), under the National Strategic Reference Framework (NSRF), through the European Regional Development Fund (ERDF), and by national funds, through the Portuguese funding agency, Fundação para a Ciência e a Tecnologia (FCT).
- 6.Sbihi, A., Eglese, R.W.: Combinatorial optimization and green logistics. 4OR 5(2), 99–116 (2007)Google Scholar