A simulation-based quantitative analysis on the topological heritability of Dandelion-encoded meta-heuristics for tree optimization problems
- 145 Downloads
The solutions to many optimization paradigms arising from different application domains can be modeled as a tree graph, in such a way that nodes represent the variables to be optimized and edges evince topological relationships between such variables. In these problems the goal is to infer an optimal tree graph interconnecting all nodes under a measure of topological fitness, for which a wide portfolio of exact and approximative solvers have hitherto been reported in the related literature. In this context a research line of interest in the last few years has been focused on the derivation of solution encoding strategies suited to deal with the topological constraints imposed by tree graph configurations, particularly when the encoded solution undergoes typical operators from Evolutionary Computation. Almost all contributions within this research area focus on the use of standard crossover and mutation operators from Genetic Algorithms onto the graph topology beneath encoded individuals. However, the pace at which new evolutionary operators have emerged from the community has grown much sharply during the last decade. This manuscript elaborates on the topological heritability of the so-called Dandelion tree encoding approach under non-conventional operators. This experimental application-agnostic-based study gravitates on the topological transmission of Dandelion-encoded solutions under a certain class of multi-parent crossover operators that lie at the core of the family of \((\mu +1)\) evolution strategies and in particular, the so-called Harmony Search algorithm. Metrics to define topological heritability and respect will be defined and evaluated over a number of convergence scenarios for the population of the algorithm, from which insightful conclusions will be drawn in terms of the preserved structural properties of the newly produced solutions with respect to the initial Dandelion-encoded population.
KeywordsDandelion codes Tree optimization Genetic algorithms Evolution strategies Multi-parent crossover
This work has been funded in part by the Basque Government under the ELKARTEK program (BID3A Project, Grant Ref. 123456).
Compliance with ethical standards
Conflict of interest
All authors declare that they have no conflict of interest regarding this work.
- Bäck T, Hoffmeister F, Schwefel HP (1991) A survey of evolution strategies. In: Proceedings of the fourth international conference on genetic algorithms. Morgan KaufmannGoogle Scholar
- Borůvka O (1926) On a minimal problem. Práce Moravské Pridovedecké Spolecnosti 3:37–58Google Scholar
- Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, HobokenGoogle Scholar
- Gottlieb J, Julstrom BA, Raidl GR, Rothlauf F (2001) Prüfer numbers: a poor representation of spanning trees for evolutionary search. In: Spector L (ed) GECCO’01 Proceedings of the 3rd annual conference on genetic and evolutionary computation. Morgan Kaufmann Publishers Inc, San Francisco, pp 343–350Google Scholar
- Landa-Torres I, Manjarres D, Gil-López S et al (2012) A preliminary approach to near-optimal multi-hop capacitated network design using grouping-Dandelion encoded heuristics. In: International workshop on computer aided modeling and design of communication links and networks (CAMAD), Proceedings of IEEE 17th IEEE, Barcelona, pp 85–89. doi: 10.1109/CAMAD.2012.6335385
- Palmer C, Kershenbaum A (1994) Representing trees in genetic algorithms. World congress on computational intelligence. Proceedings of the First IEEE. IEEE, Orlando FL, pp 379–384Google Scholar
- Paulden T, Smith DK (2006b) Recent advances in the study of the Dandelion code, happy code, and blob code spanning tree representations. In: International conference on evolutionary computation, Proceedings of IEEE. IEEE, Vancouver BC, pp 2111–2118. doi: 10.1109/CEC.2006.1688567
- Perez-Bellido AM, Salcedo-Sanz S, Ortiz-Garcia EG et al (2009) A Dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem. Comput Commun 32(1):154–158. doi: 10.1016/j.comcom.2008.09.030
- Perfecto C, Bilbao MN, Del Ser J et al (2015) On the heritability of Dandelion-encoded harmony search heuristics for tree optimization problems. In: International symposium on innovations in intelligent systems and applications, Proceedings of IEEE. IEEE, Madrid, pp 1–8. doi: 10.1109/INISTA.2015.7276763
- Perfecto C, Bilbao MN, Del Ser J et al (2016) Dandelion-encoded harmony search heuristics for opportunistic traffic offloading in synthetically modeled mobile networks. In: Kim JH (ed) Harmony search algorithm. Advances in intelligent systems and computing, vol 382. Springer, Berlin, pp 133–145. doi: 10.1007/978-3-662-47926-1_14
- Picciotto S (1999) How to encode a tree. Dissertation, University of CaliforniaGoogle Scholar
- Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press, FromeGoogle Scholar
- Zhang L, Lampe M, Wang Z (2011) Topology Design of Industrial Ethernet Networks using a Multi-Objective Genetic Algorithm. In: Communications and Networking in China (CHINACOM), 6th International ICST Conference on. IEEE, Harbin, pp 735–741. doi: 10.1109/ChinaCom.2011.6158251