Multiobjective car relocation problem in one-way carsharing system

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.

  • Record URL:
  • Availability:
  • Supplemental Notes:
    • © 2018 Rabih Zakaria et al. The contents of this paper reflect the views of the author[s] and do not necessarily reflect the official views or policies of the Transportation Research Board or the National Academy of Sciences.
  • Authors:
  • Publication Date: 2018-12


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01689653
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Dec 1 2018 3:06PM