A Fast Greedy Algorithm for the Relocation Problem

Rabih Zakaria (), Laurent Moalic (), Mohammad Dib () and Alexandre Caminada ()
Additional contact information
Rabih Zakaria: OPERA, UTBM
Laurent Moalic: OPERA, UTBM
Mohammad Dib: GDF SUEZ - CEEME
Alexandre Caminada: OPERA, UTBM

A chapter in Operations Research Proceedings 2014, 2016, pp 643-648 from Springer

Abstract: Abstract In this paper, we presentZakaria, Rabih three relocationMoalic, Laurent policies forDib, Mohammad the relocation problemCaminada, Alexandre in one carsharing system. We implement these policies in a greedy algorithm to evaluate their performance. Compared with CPLEX, greedy algorithm proved that it is able to solve the most difficult system configurations in at most one second while providing good quality solutions. On the other side, greedy algorithm results show that relocation policies that do not rely on historical data, will not be very efficient in reducing rejected user demands, on the contrary they can contribute in increasing their number while increasing the total number of relocation operations.

Keywords: Greedy Algorithm; Parking Space; Perfect Knowledge; Client Satisfaction; Integer Linear Program Model (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:oprchp:978-3-319-28697-6_89

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

DOI: 10.1007/978-3-319-28697-6_89

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 ().