Nadarajen Veerapen
ABSTRACT
Local optima networks are a compact representation of the global structure of a search space. They can be used for analysis and visualisation. This paper provides one of the first analyses of program search spaces using local optima networks. These are generated by sampling the search space by recording the progress of an Iterated Local Search algorithm. Source code mutations in comparison and Boolean operators are considered. The search spaces of two small benchmark programs, the triangle and TCAS programs, are analysed and visualised. Results show a high level of neutrality i.e. connected test-equivalent mutants. It is also generally relatively easy to find a path from a random mutant to a mutant that passes all test cases.
- Gabor Csardi and Tamas Nepusz. 2006. The igraph software package for complex network research. Inter Journal Complex Systems (2006), 1695. http://igraph.orgGoogle Scholar
- Richard A. DeMillo, Richard J. Lipton, and Frederick G. Sayward. 1978. Hints on Test Data Selection: Help for the Practicing Programmer. Computer 11, 4 (April 1978), 34--41. D0I Google ScholarDigital Library
- Hyunsook Do, Sebastian Elbaum, and Gregg Rothermel. 2005. Supporting Controlled Experimentation with Testing Techniques: An Infrastructure and its Potential Impact. Empirical Software Engineering 10, 4 (Oct. 2005), 405--435. Google ScholarDigital Library
- William B. Langdon, Mark Harman, and Yue Jia. 2010. Efficient multi-objective higher order mutation testing with genetic programming. Journal of Systems and Software 83, 12 (Dec. 2010), 2416--2430. Google ScholarDigital Library
- William B. Langdon and Gabriela Ochoa. 2016. Genetic improvement: A key challenge for evolutionary computation. In 2016 IEEE Congress on Evolutionary Computation (CEC). 3068--3075.Google Scholar
- William B. Langdon and Justyna Petke. 2017. Software is Not Fragile. In First Complex Systems Digital Campus World E-Conference 2015. Springer, Cham, 203--211.Google Scholar
- William B. Langdon, Nadarajen Veerapen, and Gabriela Ochoa. 2017. Visualising the Search Landscape of the Triangle Program. In Genetic Programming, James McDermott, Mauro Castelli, Lukas Sekanina, Evert Haasdijk, and Pablo Garcia-Sánchez (Eds.). Lecture Notes in Computer Science, Vol. 10196. Springer, Cham, 96--113.Google Scholar
- Shawn Martin, W. Michael Brown, and Brian N. Wylie. 2007. Dr.l: Distributed Recursive (graph) Layout. Technical Report dRl; 002182MLTPL00. Sandia National Laboratories.Google Scholar
- Gabriela Ochoa, Marco Tomassini, Sebástien Vérel, and Christian Darabos. 2008. A Study of NK Landscapes' Basins and Local Optima Networks. In Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (GECCO '08). ACM, New York, NY, USA, 555--562. Google ScholarDigital Library
- Gabriela Ochoa, Nadarajen Veerapen, Fabio Daolio, and Marco Tomassini. 2017. Understanding Phase Transitions with Local Optima Networks: Number Partitioning as a Case Study. In Evolutionary Computation in Combinatorial Optimization, Bin Hu and Manuel López-Ibáñez (Eds.). Lecture Notes in Computer Science, Vol. 10197. Springer, Cham, 233--248.Google Scholar
- Gabriela Ochoa, Nadarajen Veerapen, Darrell Whitley, and Edmund K. Burke. 2015. The Multi-Funnel Structure of TSP Fitness Landscapes: A Visual Exploration. In Artificial Evolution, Stéphane Bonnevay, Pierrick Legrand, Nicolas Monmarché, Evelyne Lutton, and Marc Schoenauer (Eds.). Lecture Notes in Computer Science, Vol. 9554. Springer International Publishing, 1--13. Google ScholarDigital Library
- Eric Schulte, Zachary P. Fry, Ethan Fast, Westley Weimer, and Stephanie Forrest. 2014. Software mutational robustness. Genetic Programming and Evolvable Machines 15, 3 (Sept. 2014), 281--312. Google ScholarDigital Library
- Peter F. Stadler. 2002. Fitness Landscapes. Appl. Math. and Comput 117 (2002), 187--207.Google Scholar
- Roland H. Untch, A. Jefferson Offutt, and Mary Jean Harrold. 1993. Mutation Analysis Using Mutant Schemata. In Proceedings of the 1993 ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA '93). ACM, New York, NY, USA, 139--148. Google ScholarDigital Library
- Nadarajen Veerapen, Gabriela Ochoa, Renato Tinós, and Darrell Whitley. 2016. Tunnelling Crossover Networks for the Asymmetric TSP. In Parallel Problem Solving from Nature --- PPSN XIV, Julia Handl, Emma Hart, Peter R. Lewis, Manuel López-Ibáñez, Gabriela Ochoa, and Ben Paechter (Eds.). Lecture Notes in Computer Science, Vol. 9921. Springer International Publishing, 994--1003.Google Scholar
- Sébastien Verel, Fabio Daolio, Gabriela Ochoa, and Marco Tomassini. 2012. Local Optima Networks with Escape Edges. In Artificial Evolution, EA 2011, Jin-Kao Hao, Pierrick Legrand, Pierre Collet, Nicolas Monmarché, Evelyne Lutton, and Marc Schoenauer (Eds.). Lecture Notes in Computer Science, Vol. 7401. Springer Berlin Heidelberg, 49--60. Google ScholarDigital Library
- Xiangjuan Yao, Mark Harman, and Yue Jia. 2014. A Study of Equivalent and Stubborn Mutation Operators Using Human Analysis of Equivalence. In Proceedings of the 36th International Conference on Software Engineering (ICSE 2014). ACM, New York, NY, USA, 919--930. Google ScholarDigital Library
Index Terms
- Modelling genetic improvement landscapes with local optima networks
Recommendations
Local optima networks for continuous fitness landscapes
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionLocal Optima Networks (LONs) have been proposed as a coarsegrained model of discrete (combinatorial) fitness landscapes, where nodes are local optima and edges are search transitions based on an exploration search operator. This paper presents one of ...
Visualising the global structure of search landscapes: genetic improvement as a case study
The search landscape is a common metaphor to describe the structure of computational search spaces. Different landscape metrics can be computed and used to predict search difficulty. Yet, the metaphor falls short in visualisation terms because it is ...
Local optima networks and the performance of iterated local search
GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computationLocal Optima Networks (LONs) have been recently proposed as an alternative model of combinatorial fitness landscapes. The model compresses the information given by the whole search space into a smaller mathematical object that is the graph having as ...
Comments