Laurent Moalic
ABSTRACT
In this article, we present a method combining a genetic approach with a local search for multiobjective problems. 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 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 set diversity.
- C. Coello and G. Lamont, Applications of multi-objective evolutionary algorithms, vol. 1. World Scientific Publishing Company Incorporated, 2004.Google Scholar
Cross Ref
- K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: Nsga-2," Evolutionary Computation, IEEE Transactions on, vol. 6, pp. 182 --197, apr 2002. Google ScholarDigital Library
- G. H. de Almeida Correia and A. P. Antunes, "Optimization approach to depot location and trip selection in one-way carsharing systems," Transportation Research, vol. 48, no. 1, pp. 233 -- 247, 2012.Google ScholarCross Ref
- L. Paquete, M. Chiarandini, and T. Stützle, "Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study," in Metaheuristics for Multiobjective Optimisation, vol. 535 of Lecture Notes in Economics and Mathematical Systems, pp. 177--199, Springer Berlin Heidelberg, 2004.Google Scholar
- E. Zitzler, L. Thiele, M. Laumanns, C. Fonseca, and V. da Fonseca, "Performance assessment of multiobjective optimizers: an analysis and review," Evolutionary Computation, IEEE Transactions on, vol. 7, pp. 117 -- 132, april 2003. Google ScholarDigital Library
- H. Meunier, E.-G. Talbi, and P. Reininger, "A multiobjective genetic algorithm for radio network optimization," in In Proceedings of the 2000 Congress on Evolutionary Computation, pp. 317--324, IEEE Press, 2000.Google Scholar
Index Terms
- A memetic algorithm for multiobjective problems
Recommendations
A Fast Local Search Approach for Multiobjective Problems
LION 7: Revised Selected Papers of the 7th International Conference on Learning and Intelligent Optimization - Volume 7997In 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 ...
A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems
We present a new multiobjective evolutionary algorithm (MOEA), called fast Pareto genetic algorithm (FastPGA), for the simultaneous optimization of multiple objectives where each solution evaluation is computationally- and/or financially-expensive. This ...
A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm
When solving multiobjective optimization problems, preference-based evolutionary multiobjective optimization (EMO) algorithms introduce preference information into an evolutionary algorithm in order to focus the search for objective vectors towards the ...
Comments