A Multiobjective Memetic Algorithm for Solving the Carsharing Problem (original) (raw)
In this article, we present a method combining a genetic approach with a local search for multiobjective problems. It is an extension of algorithms for the single objective case, with specific mechanisms used to build the Pareto set. The performance of the proposed algorithm is illustrated by experimental results based on a real problem with three objectives. The problem is issued from electric carsharing service with a car manufacturer partner. Compared to the Multiobjective Pareto Local Search well known in the scientific literature, the proposed model aims to improve: the solutions quality and the set diversity.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.