Affordable Access

Access to the full text

Multiobjective car relocation problem in one-way carsharing system

Authors
  • Zakaria, Rabih1
  • Dib, Mohammad2
  • Moalic, Laurent3
  • 1 Université de Technologie et de Sciences Appliquées Libano-Française, Tripoli, Lebanon , Tripoli (Lebanon)
  • 2 ENGIE, Paris, 92930, France , Paris (France)
  • 3 UHA, Mulhouse, France , Mulhouse (France)
Type
Published Article
Journal
Journal of Modern Transportation
Publisher
Springer Berlin Heidelberg
Publication Date
Nov 27, 2018
Volume
26
Issue
4
Pages
297–314
Identifiers
DOI: 10.1007/s40534-018-0175-9
Source
Springer Nature
Keywords
License
Green

Abstract

In this paper, we present a multiobjective approach for solving the one-way car relocation problem. We fix three objectives that include the number of remaining rejected demands, the number of jockeys used for the relocation operations, and the total time used by these jockeys. For this sake, we propose to apply two algorithms namely NSGA-II and an adapted memetic algorithm (MA) that we call MARPOCS which stands for memetic algorithm for the one-way carsharing system. The NSGA-II is used as a reference to compare the performance of MARPOCS. The comparison of the approximation sets obtained by both algorithms shows that the hybrid algorithm outperforms the classical NSGA-II and so solutions generated by the MARPOCS are much better than the solutions generated by NSGA-II. This observation is proved by the comparison of different quality indicators’ values that are used to compare the performance of each algorithm. Results show that the MARPOCS is promising to generate very good solutions for the multiobjective car relocation problem in one-way carsharing system. It shows a good performance in exploring the search space and in finding solution with very good fitness values.

Report this publication

Statistics

Seen <100 times