Skip to main content
Erschienen in: Soft Computing 17/2017

11.11.2016 | Focus

A simulation-based quantitative analysis on the topological heritability of Dandelion-encoded meta-heuristics for tree optimization problems

verfasst von: Cristina Perfecto, Miren Nekane Bilbao, Javier Del Ser, Armando Ferro

Erschienen in: Soft Computing | Ausgabe 17/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Fußnoten
1
In formulations where subindices i and j are involved it is implicitly assumed that \(i>j\), i.e. undirected trees.
 
2
A similar behavior was observed for \(\mathbf {Q} \in \{\mathbf {Q}_{\mathrm{one}-X},\mathbf {Q}_{\mathrm{two}-X}\}\), whose plots have been omitted for brevity.
 
Literatur
Zurück zum Zitat Bäck T, Hoffmeister F, Schwefel HP (1991) A survey of evolution strategies. In: Proceedings of the fourth international conference on genetic algorithms. Morgan Kaufmann Bäck T, Hoffmeister F, Schwefel HP (1991) A survey of evolution strategies. In: Proceedings of the fourth international conference on genetic algorithms. Morgan Kaufmann
Zurück zum Zitat Bäck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, OxfordMATH Bäck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, OxfordMATH
Zurück zum Zitat Borůvka O (1926) On a minimal problem. Práce Moravské Pridovedecké Spolecnosti 3:37–58 Borůvka O (1926) On a minimal problem. Práce Moravské Pridovedecké Spolecnosti 3:37–58
Zurück zum Zitat Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, Hoboken Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, Hoboken
Zurück zum Zitat 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–350 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–350
Zurück zum Zitat 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 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
Zurück zum Zitat 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–384 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–384
Zurück zum Zitat Paulden T, Smith DK (2006) From the Dandelion code to the rainbow code: a class of bijective spanning tree representations with linear complexity and bounded locality. IEEE Trans Evol Comput 10(2):108–123. doi:10.1109/TEVC.2006.871249 CrossRef Paulden T, Smith DK (2006) From the Dandelion code to the rainbow code: a class of bijective spanning tree representations with linear complexity and bounded locality. IEEE Trans Evol Comput 10(2):108–123. doi:10.​1109/​TEVC.​2006.​871249 CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat 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 (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
Zurück zum Zitat 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 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
Zurück zum Zitat Picciotto S (1999) How to encode a tree. Dissertation, University of California Picciotto S (1999) How to encode a tree. Dissertation, University of California
Zurück zum Zitat Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389–1401CrossRef Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389–1401CrossRef
Zurück zum Zitat Rothlauf F (2002) Representations for genetic and evolutionary algorithms. Springer, BerlinCrossRefMATH Rothlauf F (2002) Representations for genetic and evolutionary algorithms. Springer, BerlinCrossRefMATH
Zurück zum Zitat Sabattin J, Bolton C, Arias M, Parada V (2012) Evolutionary optimization of electric power distribution using the Dandelion code. J Electr Comp Eng. doi:10.1155/2012/738409 Sabattin J, Bolton C, Arias M, Parada V (2012) Evolutionary optimization of electric power distribution using the Dandelion code. J Electr Comp Eng. doi:10.​1155/​2012/​738409
Zurück zum Zitat Salcedo-Sanz S, Del Ser J, Landa-Torres I et al (2014) The coral reefs optimization algorithm: a novel metaheuristic for efficiently solving optimization problems. Sci World J. doi:10.1155/2014/739768 Salcedo-Sanz S, Del Ser J, Landa-Torres I et al (2014) The coral reefs optimization algorithm: a novel metaheuristic for efficiently solving optimization problems. Sci World J. doi:10.​1155/​2014/​739768
Zurück zum Zitat Türetken E, González G, Blum C et al (2011) Automated reconstruction of dendritic and axonal trees by global optimization with geometric priors. Neuroinformatics 9(2–3):279–302. doi:10.1007/s12021-011-9122-1 CrossRef Türetken E, González G, Blum C et al (2011) Automated reconstruction of dendritic and axonal trees by global optimization with geometric priors. Neuroinformatics 9(2–3):279–302. doi:10.​1007/​s12021-011-9122-1 CrossRef
Zurück zum Zitat Weyland D (2010) A rigorous analysis of the harmony search algorithm: how the research community can be misled by a methodology. Int J Appl Metaheuristic Comput 1(2):50–60. doi:10.4018/jamc.2010040104 CrossRef Weyland D (2010) A rigorous analysis of the harmony search algorithm: how the research community can be misled by a methodology. Int J Appl Metaheuristic Comput 1(2):50–60. doi:10.​4018/​jamc.​2010040104 CrossRef
Zurück zum Zitat Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press, Frome Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press, Frome
Zurück zum Zitat 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 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
Metadaten
Titel
A simulation-based quantitative analysis on the topological heritability of Dandelion-encoded meta-heuristics for tree optimization problems
verfasst von
Cristina Perfecto
Miren Nekane Bilbao
Javier Del Ser
Armando Ferro
Publikationsdatum
11.11.2016
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 17/2017
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-016-2436-z

Weitere Artikel der Ausgabe 17/2017

Soft Computing 17/2017 Zur Ausgabe