Marco Baioletti
Alfredo Milani
ABSTRACT
In this work we analyze, from a qualitative point-of-view, the structure of the connections among the local optima in the fitness landscapes of the Quadratic Assignment Problem (QAP). In particular, we are interested in determining which search moves, intended as pairwise exchanges of permutation items, are beneficial for moving from one optimum to another. Novel algebraic methods are introduced for determining, and measuring the effectiveness, of the exchange moves connecting two given optima. The analysis considers real-like QAP instances whose local optima networks are clustered in communities. The results of the conducted experimentation shows the presence of few preferred search moves that look more effective for moving across intra-community optima, while the same is not so apparent when the optima are taken from different communities.
- Marco Baioletti, Alfredo Milani, and Valentino Santucci. 2015. Linear Ordering Optimization with a Combinatorial Differential Evolution. In Proc. of 2015 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015. 2135--2140.Google Scholar
Digital Library
- Marco Baioletti, Alfredo Milani, and Valentino Santucci. 2016. An Extension of Algebraic Differential Evolution for the Linear Ordering Problem with Cumulative Costs. In Proc. of 14th International Conference on Parallel Problem Solving from Nature - PPSN XIV. 123--133.Google ScholarCross Ref
- M. Baioletti, A. Milani, and V. Santucci. 2017. Algebraic Particle Swarm Optimization for the permutations search space. In Proc. of 2017 IEEE Congress on Evolutionary Computation (CEC 2017). 1587--1594.Google ScholarCross Ref
- M. Baioletti, A. Milani, and V. Santucci. 2018. Algebraic Crossover Operators for Permutations. In 2018 IEEE Congress on Evolutionary Computation (CEC 2018). 1--8.Google Scholar
- Marco Baioletti, Alfredo Milani, and Valentino Santucci. 2018. Automatic Algebraic Evolutionary Algorithms. In Proc. of Int. Workshop on Artificial Life and Evolutionary Computation (WIVACE 2017). Springer International Publishing, Cham, 271--283.Google ScholarCross Ref
- Marco Baioletti, Alfredo Milani, and Valentino Santucci. 2018. Learning Bayesian Networks with Algebraic Differential Evolution. In Proc. of 15th Int. Conf. on Parallel Problem Solving from Nature - PPSN XV. Springer International Publishing, Cham, 436--448.Google ScholarCross Ref
- Marco Baioletti, Alfredo Milani, and Valentino Santucci. 2018. MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem. In Proc. of European Conference on Evolutionary Computation in Combinatorial Optimization - EvoCOP 2018. Springer International Publishing, Cham, 132--145.Google ScholarCross Ref
- Marco Baioletti and Valentino Santucci. 2017. Fitness Landscape Analysis of the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion. In Computational Science and Its Applications - ICCSA 2017. Springer International Publishing, Cham, 705--716.Google ScholarCross Ref
- Albert-László Barabási et al. 2016. Network science. Cambridge university press.Google Scholar
- Kenneth D Boese, Andrew B Kahng, and Sudhakar Muddu. 1994. A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters 16, 2 (1994), 101--113. Google ScholarDigital Library
- Lidia Ceriani and Paolo Verme. 2012. The origins of the Gini index: extracts from Variabilità e Mutabilità (1912) by Corrado Gini. The Journal of Economic Inequality 10, 3 (01 Sep 2012), 421--443.Google ScholarCross Ref
- Gabor Csardi and Tamas Nepusz. 2006. The igraph software package for complex network research. Inter Journal Complex Systems (2006), 1695. http://igraph.orgGoogle Scholar
- Fabio Daolio, Marco Tomassini, Sébastien Vérel, and Gabriela Ochoa. 2011. Communities of minima in local optima networks of combinatorial spaces. Physica A: Statistical Mechanics and its Applications 390, 9 (2011), 1684--1694.Google Scholar
- J Garnier and L Kallel. 2001. How to detect all maxima of a function. In Theoretical aspects of evolutionary computing. Springer, 343--370. Google ScholarDigital Library
- Sebastian Herrmann, Gabriela Ochoa, and Franz Rothlauf. 2016. Communities of local optima as funnels in fitness landscapes. In Proceedings of the Genetic and Evolutionary Computation Conference 2016. ACM, 325--331. Google ScholarDigital Library
- S. A. Kauffman. 1993. The Origins of Order. Oxford University Press, New York.Google Scholar
- J. Knowles and D. Corne. 2003. Instance Generators and Test Suites for the Multiobjective Quadratic Assignment Problem. In Proceedings of the Evolutionary Multi-Criterion Optimization Conference (EMO 2003) (LNCS). Springer, 295--310. Google ScholarDigital Library
- T. C. Koopmans and M. Beckmann. 1957. Assignment Problems and the Location of Economic Activities. Econometrica 25, 1 (1957), 53--76.Google ScholarCross Ref
- Serge Lang. 2002. Algebra. Vol. 211. Springer.Google Scholar
- Paolo Mengoni, Alfredo Milani, and Yuanxi Li. 2018. Community graph elicitation from students' interactions in virtual learning environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 10962 LNCS. 414--425.Google Scholar
- Gabriela Ochoa, Marco Tomassini, Sebástien Verel, and Christian Darabos. 2008. A Study of NK Landscapes' Basins and Local Optima Networks. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2008. ACM, 555--562. Google ScholarDigital Library
- Gabriela Ochoa and Nadarajen Veerapen. 2016. Deconstructing the big valley search space hypothesis. In Evolutionary Computation in Combinatorial Optimization. Springer, 58--73.Google Scholar
- G. Ochoa, S. Verel, and M. Tomassini. 2010. First-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes. In Parallel Problem Solving from Nature - PPSN XI (Lecture Notes in Computer Science), Vol. 6238. Springer, 104--113. Google ScholarDigital Library
- C.M. Reidys and P.F. Stadler. 2002. Combinatorial landscapes. SIAM review 44, 1 (2002), 3--54. Google ScholarDigital Library
- Valentino Santucci, Marco Baioletti, Gabriele Di Bari, and Alfredo Milani. 2019. A Binary Algebraic Differential Evolution for the MultiDimensional Two-Way Number Partitioning Problem. In Evolutionary Computation in Combinatorial Optimization. Springer International Publishing, Cham, 17--32.Google Scholar
- Valentino Santucci, Marco Baioletti, and Alfredo Milani. 2014. A Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion. In Proc. of 13th International Conference on Parallel Problem Solving from Nature - PPSN XIII. Springer, Cham, 161--170.Google ScholarCross Ref
- V. Santucci, M. Baioletti, and A. Milani. 2016. Algebraic Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem With Total Flowtime Criterion. IEEE Transactions on Evolutionary Computation 20, 5 (2016), 682--694.Google ScholarCross Ref
- V. Santucci, M. Baioletti, and A. Milani. 2016. Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm. AI Communications 29, 2 (2016), 269--286.Google ScholarCross Ref
- Valentino Santucci and Alfredo Milani. 2011. Particle Swarm Optimization in the EDAs Framework. In Soft Computing in Industrial Applications. Springer Berlin Heidelberg, Berlin, Heidelberg, 87--96.Google Scholar
- Tommaso Schiavinotto and Thomas Stützle. 2007. A review of metrics on permutations for search landscape analysis. Computers & Operations Research 34, 10 (2007), 3143--3153. Google ScholarDigital Library
- É, D. Taillard. 1995. Comparison of iterative searches for the quadratic assignment problem. Location Science 3, 2 (1995), 87 -- 105.Google ScholarDigital Library
- Marco Tomassini, Sébastien Verel, and Gabriela Ochoa. 2008. Complex-Network Analysis of combinatorial spaces: The NK landscape case. Phys. Rev. E 78, 6 (2008), 066114.Google ScholarCross Ref
- S. Verel, F. Daolio, G. Ochoa, and M. Tomassini. 2012. Local Optima Networks with Escape Edges. In Proceedings of the International Conference on Artificial Evolution, EA-2011 (Lecture Notes in Computer Science), Vol. 7401. Springer, 49--60. Google ScholarDigital Library
- S. Verel, G. Ochoa, and M. Tomassini. 2011. Local Optima Networks of NK Landscapes with Neutrality. IEEE Transactions on Evolutionary Computation 15, 6(2011), 783--797.Google ScholarCross Ref
Index Terms
- Search moves in the local optima networks of permutation spaces: the QAP case
Recommendations
Fitness Landscape Analysis of Genetic Programming Search Spaces with Local Optima Networks
GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary ComputationFitness landscape analysis (FLA) refers to a set of techniques to characterise optimisation problems. This paper presents an FLA of three types of genetic programming (GP) benchmarks: parity, symbolic regression, and artificial ant. We applied a ...
Communities of Local Optima as Funnels in Fitness Landscapes
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016We conduct an analysis of local optima networks extracted from fitness landscapes of the Kauffman NK model under iterated local search. Applying the Markov Cluster Algorithm for community detection to the local optima networks, we find that the ...
Multi-layer local optima networks for the analysis of advanced local search-based algorithms
GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation ConferenceA Local Optima Network (LON) is a graph model that compresses the fitness landscape of a particular combinatorial optimization problem based on a specific neighborhood operator and a local search algorithm. Determining which and how landscape features ...
Comments