A Fast Local Search Approach for Multiobjective Problems
Résumé
In this article, we present a new local method for multiobjective problems. It is an extension of local search algorithms for the single objective case, with specific mechanisms used to build the Pareto set. The performance of the local search algorithm is illustrated by experimental results based on a real problem with three objectives. The problem is issued from electric car-sharing service with a car manufacturer partner. Compared to the Multiobjective Pareto Local Search (PLS) well known in the scientific literature, the proposed model aims to improve: the solutions quality and the time computing.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...