The Importance of Proper Diversity Management in Evolutionary Algorithms for Combinatorial Optimization

Premature convergence is one of the most important recurrent drawbacks of Evolutionary Algorithms and other metaheuristics. As a result, several methods to alleviate this problem have been devised. One alternative is to explicitly control the diversity of the population. In this chapter, a recently proposed survivor selection strategy is incorporated into a memetic algorithm and analyzed using three different combinatorial optimization problems. This strategy is based on adopting multi-objective concepts for solving single-objective problems by considering the contribution to diversity as an explicit objective. Additionally, it incorporates the principle of adapting the balance between exploration and exploitation to the different stages of the optimization by taking into account the stopping criterion and elapsed time. These new methods provide important benefits when compared to more mature methods that rely on different principles to delay convergence of the population. Additionally, new best-known solutions are generated for several instances of the problems, thus providing proofs of the considerable benefits and robustness yielded by the schemes that incorporate this novel replacement strategy.

[1]  Carlo Mannino,et al.  Models and solution techniques for frequency assignment problems , 2003, 4OR.

[2]  V. K. Koumousis,et al.  A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance , 2006, IEEE Transactions on Evolutionary Computation.

[3]  Samir W. Mahfoud Crowding and Preselection Revisited , 1992, PPSN.

[4]  Pedro J. Ballester,et al.  An Effective Real-Parameter Genetic Algorithm with Parent Centric Normal Crossover for Multimodal Optimisation , 2004, GECCO.

[5]  Jean-Baptiste Mouret Novelty-Based Multiobjectivization , 2011 .

[6]  Jin-Kao Hao,et al.  Path relinking for the fixed spectrum frequency assignment problem , 2015, Expert Syst. Appl..

[7]  Ole J. Mengshoel,et al.  Adaptive generalized crowding for genetic algorithms , 2014, Inf. Sci..

[8]  Carlos Segura,et al.  A Novel Diversity-based Evolutionary Algorithm for the Traveling Salesman Problem , 2015, GECCO.

[9]  Eduardo Segredo,et al.  Scalability and robustness of parallel hyperheuristics applied to a multiobjectivised frequency assignment problem , 2013, Soft Comput..

[10]  Gara Miranda,et al.  A Parallel Plugin-Based Framework for Multi-objective Optimization , 2009, DCAI.

[11]  Carlos Cotta,et al.  Recent Advances in Evolutionary Computation for Combinatorial Optimization , 2008, Recent Advances in Evolutionary Computation for Combinatorial Optimization.

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

[13]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

[14]  Richard A. Watson,et al.  Reducing Local Optima in Single-Objective Problems by Multi-objectivization , 2001, EMO.

[15]  Hussein A. Abbass,et al.  Multiobjective optimization for dynamic environments , 2005, 2005 IEEE Congress on Evolutionary Computation.

[16]  Julian Togelius,et al.  Product Geometric Crossover for the Sudoku Puzzle , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[17]  Ankit Chaudhary,et al.  A comparative review of approaches to prevent premature convergence in GA , 2014, Appl. Soft Comput..

[18]  Byung Ro Moon,et al.  A hybrid genetic algorithm for a variant of two-dimensional packing problem , 2009, GECCO '09.

[19]  Gara Miranda,et al.  Metaheuristics for solving a real-world frequency assignment problem in GSM networks , 2008, GECCO '08.

[20]  T. Yato,et al.  Complexity and Completeness of Finding Another Solution and Its Application to Puzzles , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[21]  Alberto Moraglio,et al.  Theory and Principled Methods for the Design of Metaheuristics , 2014, Natural Computing Series.

[22]  Timo Mantere Improved ant colony genetic algorithm hybrid for Sudoku solving , 2013, 2013 Third World Congress on Information and Communication Technologies (WICT 2013).

[23]  Julian Togelius,et al.  Geometric particle swarm optimization for the sudoku puzzle , 2007, GECCO '07.

[24]  Lothar Thiele,et al.  A Comparison of Selection Schemes Used in Evolutionary Algorithms , 1996, Evolutionary Computation.

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

[26]  Michel Gendreau,et al.  A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows , 2013, Comput. Oper. Res..

[27]  Ladislav Clementis Advantage of Parallel Simulated Annealing Optimization by Solving Sudoku Puzzle , 2015 .

[28]  Gara Miranda,et al.  Using multi-objective evolutionary algorithms for single-objective optimization , 2013, 4OR.

[29]  Enrique Alba,et al.  Optimization algorithms for large-scale real-world instances of the frequency assignment problem , 2010, Soft Comput..

[30]  P. N. Suganthan,et al.  Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[31]  Timo Mantere,et al.  Solving and Rating Sudoku Puzzles with Genetic Algorithms , 2006 .

[32]  Roberto Montemanni,et al.  An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem , 2003, IEEE Trans. Veh. Technol..

[33]  Gara Miranda,et al.  A memetic algorithm and a parallel hyperheuristic island-based model for a 2D packing problem , 2009, GECCO.

[34]  A.M.J. Kuurne On GSM mobile measurement based interference matrix generation , 2002, Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367).

[35]  Eduardo Segredo,et al.  Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem , 2014, J. Glob. Optim..

[36]  Samir W. Mahfoud Niching methods for genetic algorithms , 1996 .

[37]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[38]  Zbigniew Michalewicz,et al.  Parameter Setting in Evolutionary Algorithms , 2007, Studies in Computational Intelligence.

[39]  Mohammed Azmi Al-Betar,et al.  Monogamous pair bonding in genetic algorithm , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[40]  Georges R. Harik,et al.  Finding Multimodal Solutions Using Restricted Tournament Selection , 1995, ICGA.

[41]  Gara Miranda,et al.  Parallel hyperheuristics for the frequency assignment problem , 2011, Memetic Comput..

[42]  Carlos A. Coello Coello,et al.  A Novel Diversity-Based Replacement Strategy for Evolutionary Algorithms , 2016, IEEE Transactions on Cybernetics.

[43]  Kazuhiro Ohkura,et al.  An evolutionary approach to sudoku puzzles with filtered mutations , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[44]  Eduardo Segredo,et al.  Parallel island-based multiobjectivised memetic algorithms for a 2D packing problem , 2011, GECCO '11.

[45]  Francisco Herrera,et al.  Replacement strategies to preserve useful diversity in steady-state genetic algorithms , 2008, Inf. Sci..

[46]  Tzung-Pei Hong,et al.  Two-dimentional Encoding Schema and Genetic Operators , 2006, JCIS.

[47]  Yuji Sato,et al.  Solving Sudoku with genetic operations that preserve building blocks , 2010, Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games.

[48]  Alain Pétrowski,et al.  A clearing procedure as a niching method for genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[49]  Gara Miranda,et al.  Improving the diversity preservation of multi-objective approaches used for single-objective optimization , 2013, 2013 IEEE Congress on Evolutionary Computation.

[50]  A. E. Eiben,et al.  On Evolutionary Exploration and Exploitation , 1998, Fundam. Informaticae.

[51]  Gara Miranda,et al.  Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization , 2016, Ann. Oper. Res..

[52]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[53]  Jenny Carter,et al.  Sudoku evolution , 2009, 2009 International IEEE Consumer Electronics Society's Games Innovations Conference.

[54]  David E. Goldberg,et al.  Probabilistic Crowding: Deterministic Crowding with Probabilistic Replacement , 1999 .