Annealing-tabu PAES: a multi-objective hybrid meta-heuristic

Most real-life optimization problems require taking into account not one, but multiple objectives simultaneously. In most cases these objectives are in conflict, i.e. the improvement of some objectives implies the deterioration of others. In single-objective optimization there exists a global optimum, while in the multi-objective case no optimal solution is clearly defined, but rather a set of solutions. In the last decade most papers dealing with multi-objective optimization use the concept of Pareto-optimality. The goal of Pareto-based multi-objective strategies is to generate a front (set) of non-dominated solutions as an approximation to the true Pareto-optimal front. However, this front is unknown for problems with large and highly complex search spaces, which is why meta-heuristic methods have become important tools for solving this kind of problem. Hybridization in the multi-objective context is nowadays an open research area. This article presents a novel extension of the well-known Pareto archived evolution strategy (PAES) which combines simulated annealing and tabu search. Experiments on several mathematical problems show that this hybridization allows an improvement in the quality of the non-dominated solutions in comparison with PAES, and also with its extension M-PAES.

[1]  Xiaolin Hu,et al.  Hybridization of the multi-objective evolutionary algorithms and the gradient-based algorithms , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[2]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[3]  Martin J. Oates,et al.  On the Assessment of Multiobjective Approaches to the Adaptive Distributed Database Management Problem , 2000, PPSN.

[4]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[5]  Seyyed M. T. Fatemi Ghomi,et al.  Development of a PSO-SA hybrid metaheuristic for a new comprehensive regression model to time-series forecasting , 2010, Expert Syst. Appl..

[6]  Ben Paechter,et al.  A Hybrid Meta-Heuristic for Multi-Objective Optimization: MOSATS , 2007, J. Math. Model. Algorithms.

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  P. Hajela,et al.  Genetic search strategies in multicriterion optimal design , 1991 .

[9]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[10]  Piotr Czyzżak,et al.  Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization , 1998 .

[11]  Julio Ortega Lopera,et al.  A Parallel Multilevel Metaheuristic for Graph Partitioning , 2004, J. Heuristics.

[12]  Kalyanmoy Deb,et al.  Constrained Test Problems for Multi-objective Evolutionary Optimization , 2001, EMO.

[13]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Jin-Kao Hao,et al.  Genetic tabu search for the Multi-Objective knapsack problem , 2012 .

[16]  Jacques Teghem,et al.  MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization , 2008, RAIRO Oper. Res..

[17]  Jason R. Schott.  Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. , 1995 .

[18]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[19]  Arnaud Fréville,et al.  Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case , 2000, J. Heuristics.

[20]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[21]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[22]  Gary B. Lamont,et al.  Considerations in engineering parallel multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[23]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

[24]  R. Lyndon While,et al.  A faster algorithm for calculating hypervolume , 2006, IEEE Transactions on Evolutionary Computation.

[25]  Andrzej Jaszkiewicz,et al.  Genetic local search for multi-objective combinatorial optimization , 2022 .

[26]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[27]  Maoguo Gong,et al.  Multiobjective Immune Algorithm with Nondominated Neighbor-Based Selection , 2008, Evolutionary Computation.

[28]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[29]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[30]  Michael Pilegaard Hansen,et al.  Tabu Search for Multiobjective Optimization: MOTS , 1997 .

[31]  Paolo Serafini,et al.  Simulated Annealing for Multi Objective Optimization Problems , 1994 .

[32]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[33]  Jeffrey Horn,et al.  The Niched Pareto Genetic Algorithm 2 Applied to the Design of Groundwater Remediation Systems , 2001, EMO.

[34]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[35]  Joshua D. Knowles.  Local-search and hybrid evolutionary algorithms for Pareto optimization , 2002 .

[36]  Joshua D. Knowles,et al.  M-PAES: a memetic algorithm for multiobjective optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[37]  Gao Shang.  A New Hybrid Ant Colony Algorithm for Clustering Problem , 2008, 2008 International Symposium on Intelligent Information Technology Application Workshops.

[38]  Prabhat Hajela,et al.  Genetic search strategies in multicriterion optimal design , 1991 .

[39]  Martin J. Oates,et al.  The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

[40]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[41]  E. L. Ulungu,et al.  MOSA method: a tool for solving multiobjective combinatorial optimization problems , 1999 .

[42]  Maria Dolores Gil Montoya,et al.  A hybrid method for solving multi-objective global optimization problems , 2007, J. Glob. Optim..

[43]  Martin J. Oates,et al.  PESA-II: region-based selection in evolutionary multiobjective optimization , 2001 .

[44]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..