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

A simulation-based quantitative analysis on the topological heritability of Dandelion-encoded... 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)$$ ( μ + 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Soft Computing Springer Journals

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

Loading next page...
 
/lp/springer_journal/a-simulation-based-quantitative-analysis-on-the-topological-QtgSQGhOQz
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2016 by Springer-Verlag Berlin Heidelberg
Subject
Engineering; Computational Intelligence; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations; Control, Robotics, Mechatronics
ISSN
1432-7643
eISSN
1433-7479
D.O.I.
10.1007/s00500-016-2436-z
Publisher site
See Article on Publisher Site

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$49/month

Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588

$360/year

billed annually
Start Free Trial

14-day Free Trial