Laboratory of Mathematics & Operational Research, Faculté Polytechnique de Mons. 9, rue de Houdain. B-7000 Mons, Be
MEMOTS : a Memetic Algorithm Integrating Tabu Search for Multiobjective Optimization Thibaut Lust and Jacques Teghem Laboratory of Mathematics & Operational Research, Facult´e Polytechnique de Mons 9, rue de Houdain B-7000 Mons, Belgium
[email protected]
Abstract In multiobjective optimization problems, several criteria are defined correspondent to various functions to be minimized or maximized. Compared to single optimization, an additional difficulty appears, since the criteria considered are generally contradictory what leads to situations where to improve a criterion can be done only to the detriment of the others. Consequently, the aim is not to find the optimal solution of the problem, but a sufficiently broad set of solutions known as efficient or Pareto. An efficient solution, is a non-dominated solution, i.e. there is not a solution at least also good on all the criteria and better on at least a criterion. The decision maker will then select one of the efficient solutions that adequately reflects his preferences. To generate the set of efficient solutions of difficult optimization problems, exacts methods are inefficient, and this is why the metaheuristics were quite recently adapted to multiobjective problems [1]. We present a new metaheuristic, called MEMOTS, to find a good approximation of the set of efficient solutions of multiobjective problems. The MEMOTS method is based on a memetic algorithm, also called genetic local search [5]. At each offspring generated by MEMOTS, we apply a local search method, which is an original multiobjective Tabu Search. The role of the Tabu Search in MEMOTS is to intensify the research, while diversification is ensured by a population of solutions among which the individuals of low density are selected. MEMOTS, contrary to a great number of other methods [2, 3, 4, 6], has the advantage of not using an aggregation function employing weight sets, which clear up the problem of their determination and the normalization of the values taken by the criteria. We experiment the MEMOTS method on the multidimensional multiobjective knapsack 1
problem, and show that the performances of MEMOTS are greater than MOGLS [4], a famous multiobjective method.
References [1] M. Ehrgott and X. Gandibleux. Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys. Kluwer Academic Publishers, Boston, 2002. [2] H. Ishibuchi and T. Murata. Multi-Objective Genetic Local Search Algorithm. In Toshio Fukuda and Takeshi Furuhashi, editors, Proceedings of the 1996 International Conference on Evolutionary Computation, pages 119–124, Nagoya, Japan, 1996. IEEE. [3] A. Jaszkiewicz. A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm. Technical Report RA-003/01, Institute of Computing Science, Poznan University of Technology, Poznan, Poland, 2001. [4] A. Jaszkiewicz. Genetic local search for multiple objective combinatorial optimization. European Journal of Operational Research, 137(1):50–71, 2002. [5] P. Moscato. On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical Report C3P Report 826, Caltech Concurrent Computation Program, 1989. [6] E.L. Ulungu, J. Teghem, Ph. Fortemps, and D. Tuyttens. MOSA Method: A Tool for Solving Multiobjective Combinatorial Optimization Problems. Journal of Multi-Criteria Decision Analysis, 8(4):221–236, 1999.
2
