On Pathological Fitness Landscapes for Constrained Combinatorial Optimization

Population-based search methods such as evolutionary algorithms follow gradients in the fitness landscape under the assumption that high quality solutions will lead to even better ones. Most real-world optimisation problems, however, have constraints which lead to infeasible solutions that may disrupt these gradients. As a result, high quality solutions may lie in regions that are often unreachable from regions in the fitness landscape where the preponderance of feasible solutions lie. In such cases, the make-up of the initial population as well as critical aspects of the search strategy become the crucial factors in determining whether or not high quality regions are ever reached. In this paper, we present examples of pathological landscapes that arise by considering the constrained component deployment optimisation problem for which standard evolutionary algorithms are almost certain to fail to reach the regions where high quality solutions lie. We indicate how some simple modifications can help alleviate this problem.

[1]  P. Stadler,et al.  The landscape of the traveling salesman problem , 1992 .

[2]  Fernando Niño,et al.  Towards a self-stopping evolutionary algorithm using coupling from the past , 2005, GECCO '05.

[3]  Aldeida Aleti,et al.  Designing automotive embedded systems with adaptive genetic algorithms , 2015, Automated Software Engineering.

[4]  A. Perelson,et al.  Protein evolution on partially correlated landscapes. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Josselin Garnier,et al.  Efficiency of Local Search with Multiple Local Optima , 2001, SIAM J. Discret. Math..

[6]  David E. Goldberg,et al.  Genetic Algorithm Difficulty and the Modality of Fitness Landscapes , 1994, FOGA.

[7]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .

[8]  L. Penrose,et al.  THE CORRELATION BETWEEN RELATIVES ON THE SUPPOSITION OF MENDELIAN INHERITANCE , 2022 .

[9]  Joachim Krug,et al.  Evolution in random fitness landscapes: the infinite sites model , 2007, 0711.1989.

[10]  Robert P. St.Onge,et al.  Defining genetic interaction , 2008, Proceedings of the National Academy of Sciences.

[11]  Nasser R. Sabar,et al.  An Adaptive Memetic Algorithm for the Architecture Optimisation Problem , 2017, ACALCI.

[12]  Michael Affenzeller,et al.  A Comprehensive Survey on Fitness Landscape Analysis , 2012, Recent Advances in Intelligent Engineering Systems.

[13]  Lionel Barnett,et al.  Netcrawling-optimal evolutionary search with neutral networks , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[14]  Irene Moser,et al.  Identifying Features of Fitness Landscapes and Relating Them to Problem Difficulty , 2017, Evolutionary Computation.

[15]  E. D. Weinberger,et al.  The NK model of rugged fitness landscapes and its application to maturation of the immune response. , 1989, Journal of theoretical biology.

[16]  Andries Petrus Engelbrecht,et al.  A survey of techniques for characterising fitness landscapes and some possible ways forward , 2013, Inf. Sci..