Filters








14,693 Hits in 7.3 sec

Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation [chapter]

Stefan Kratsch, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto
2010 Parallel Problem Solving from Nature, PPSN XI  
We investigate the NP-hard problem of computing a spanning tree that has a maximal number of leaves by evolutionary algorithms in the context of fixed parameter tractability (FPT) where the maximum number  ...  Investigating two common mutation operators, we show that an operator related to spanning tree problems leads to an FPT running time in contrast to a general mutation operator that does not have this property  ...  We put forward the parameterized analysis of evolutionary algorithms and investigate this kind of algorithms for the computation of a maximum leaf spanning tree.  ... 
doi:10.1007/978-3-642-15844-5_21 dblp:conf/ppsn/KratschLNO10 fatcat:byxjfluezzgydcmzdrxqmcskda

Evolutionary Local Search for Designing Peer-to-Peer Overlay Topologies Based on Minimum Routing Cost Spanning Trees [chapter]

Peter Merz, Steffen Wolf
2006 Lecture Notes in Computer Science  
We present evolutionary algorithms incorporating local search for the minimum routing cost spanning tree problem in which the overall routing/communication cost is minimized.  ...  Moreover, we present results from a fitness landscape analysis for the three types of local optima that reveal interesting properties of the problem data based on real measurements in the Internet.  ...  Conclusions We have presented highly effective evolutionary algorithms incorporating local search for the minimum routing cost spanning tree problem arising in the design of P2P overlay topologies.  ... 
doi:10.1007/11844297_28 fatcat:v6ob4qazdzgt7aqifqod5txi6u

The node-depth encoding

Telma W. de Lima, Franz Rothlauf, Alexandre C.B. Delbem
2008 Proceedings of the 10th annual conference on Genetic and evolutionary computation - GECCO '08  
In comparison to other evolutionary algorithms for the bounded-diameter minimum spanning tree evolutionary algorithms using the node-depth encoding have a good performance.  ...  This investigation, also, shows that the mutation operators are unbiased. The performance of node-depth encoding is investigated for the bounded-diameter minimum spanning tree problem.  ...  ACKNOWLEDGMENTS The authors acknowledgments are to FAPESP by the research scholarship and the Department of Information System and Business Administration in the University of Mainz, where part of this  ... 
doi:10.1145/1389095.1389279 dblp:conf/gecco/LimaRD08 fatcat:h573m4ho7vb27axy4voev7nwhe

Page 254 of The Journal of the Operational Research Society Vol. 54, Issue 3 [page]

2003 The Journal of the Operational Research Society  
This new tree encoding has the property that it inherits good properties from parents, and this provides a greater chance of evolving to a highly fit structure or even an optimal solution in the evolutionary  ...  Genetic algorithm approach on multi-criteria minimum spanning tree problem. Eur J Op Res 114: 141-152. } Davis L (1985). Applying adaptive algorithms to epistatic domains.  ... 

Approximation algorithms for constrained generalized tree alignment problem

Srikrishnan Divakaran
2009 Discrete Applied Mathematics  
phylogenetic trees that specify the topological constraints that an evolutionary tree of S needs to satisfy, construct a minimum cost evolutionary tree for S.  ...  For the generalized tree alignment problem, a special case of this problem, our algorithms provide a guaranteed error bound of 2 − 2/k.  ...  Acknowledgements We thank an anonymous referee for very helpful comments on a previous draft of this paper. We also would like to thank Professor Michael Saks for some useful comments and suggestions.  ... 
doi:10.1016/j.dam.2008.10.009 fatcat:z2d4i5hmyvdcxgzxmw2nlvwi2e

Permutation-based Recombination Operator to Node-depth Encoding

Telma Woerle de Lima, Alexandre Cláudio Botazzo Delbem, Roney Lopes Lima, Gustavo Post Sabin, Marcos Antônio Almeida de Oliveira
2016 Procedia Computer Science  
The node-depth encoding is a representation for evolutionary algorithms applied to tree problems. Its represents trees by storing the nodes and their depth in a proper ordered list.  ...  Introduction Node-depth encoding is a representation for evolutionary algorithms (EAs) applied to network design problems [3] . This encoding is based on the relation node-depth in a rooted tree.  ...  Acknowledgments The authors would like to thank CAPES, CNPq and Foundation for Research Support of the State of Goiás (FAPEG) for the financial support to this project.  ... 
doi:10.1016/j.procs.2016.05.320 fatcat:okfjbymybjcgxn7x63dsmmgmbe

Randomized local search, evolutionary algorithms, and the minimum spanning tree problem

Frank Neumann, Ingo Wegener
2007 Theoretical Computer Science  
The analysis of these randomized search heuristics has been started for some well-known problems, and this approach is followed here for the minimum spanning tree problem.  ...  Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization  ...  Foundation (GIF) in the project "Robustness Aspects of Algorithms".  ... 
doi:10.1016/j.tcs.2006.11.002 fatcat:ohrhbhkmrfahpghg3g43hwknru

Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem [chapter]

Frank Neumann, Ingo Wegener
2004 Lecture Notes in Computer Science  
The analysis of these randomized search heuristics has been started for some well-known problems, and this approach is followed here for the minimum spanning tree problem.  ...  Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization  ...  Foundation (GIF) in the project "Robustness Aspects of Algorithms".  ... 
doi:10.1007/978-3-540-24854-5_73 fatcat:3f6gs4l7m5gwph4so6fqh33uki

A dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem

Angel M. Pérez-Bellido, Sancho Salcedo-Sanz, Emilio G. Ortiz-Garcı´a, Antonio Portilla-Figueras, Maurizio Naldi
2009 Computer Communications  
This paper proposes an evolutionary algorithm with Dandelion-encoding to tackle the Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) problem.  ...  Good properties of locality has been reported on this encoding, which makes it very effective to solve problems in which the solutions can be expressed in form of trees.  ...  The Dandelion encoding has been recently proposed as an effective method to represent trees in evolutionary algorithms [12] , with good properties of locality (small changes in the representation make  ... 
doi:10.1016/j.comcom.2008.09.030 fatcat:53mrcxl4jndabd7d3j5ie437sm

A genetic algorithm approach on tree-like telecommunication network design problem

G Zhou, M Gen
2003 Journal of the Operational Research Society  
Genetic algorithm approach on multi-criteria minimum spanning tree problem. Eur J Op Res 114: 141-152. } Davis L (1985). Applying adaptive algorithms to epistatic domains.  ...  This tree encoding has the property of inheriting good properties from parents and thus provides a great chance of evolving to a highly fit structure or solution in the evolutionary process.  ... 
doi:10.1057/palgrave.jors.2601510 fatcat:2dgsvvnkjbb7fl4hmfdphdftva

Minimum spanning trees made easier via multi-objective optimization

Frank Neumann, Ingo Wegener
2005 Proceedings of the 2005 conference on Genetic and evolutionary computation - GECCO '05  
That this is indeed the case is proved by investigating the computation of minimum spanning trees.  ...  One should not forget that the fitness vector with respect to more than one objective contains more information that in principle can direct the search of evolutionary algorithms.  ...  ACKNOWLEDGEMENT The authors thank Dirk Sudholt who performed the statistical tests with the SPSS software.  ... 
doi:10.1145/1068009.1068139 dblp:conf/gecco/NeumannW05 fatcat:wjozkuve2ng4dnem7mevq4mtge

Minimum spanning trees made easier via multi-objective optimization

Frank Neumann, Ingo Wegener
2006 Natural Computing  
That this is indeed the case is proved by investigating the computation of minimum spanning trees.  ...  One should not forget that the fitness vector with respect to more than one objective contains more information that in principle can direct the search of evolutionary algorithms.  ...  ACKNOWLEDGEMENT The authors thank Dirk Sudholt who performed the statistical tests with the SPSS software.  ... 
doi:10.1007/s11047-006-9004-x fatcat:zsikr2r5evgvra26ueb4phafkm

A Similarity Measure for DNA Sequence Analysis Based on Locality

Takashi Yokomori, Satoshi Kobayashi
1993 Genome Informatics Series  
We propose a simple string similarity measure and apply it to the problem of DNA sequence analysis, more specifically, to the problem of analysing molecular evolution.  ...  We demonstrate the usefulness of the proposed measure by presenting an experimental result which concerns evolutionary molecular analysis .  ...  Acknowledgements This work is supported in part by Grants-in-Aid for Scientific Research No.04229105 from the Ministry of Education, Science and Culture, Japan.  ... 
doi:10.11234/gi1990.4.283 fatcat:zceyooici5ghpo2iuem2mpjiuy

Baldwin effect and Lamarckian evolution in a memetic algorithm for Euclidean Steiner tree problem

Michał Bereta
2018 Memetic Computing  
Keywords Baldwin effect · Euclidean Steiner tree problem · Evolutionary algorithm · Genetic algorithm · Lamarckian evolution · Memetic algorithm Open Access This article is distributed under the terms  ...  To further check the ability of the proposed algorithm to find the optimal or near optimal solutions, results for problems from OR-Lib are provided.  ...  In the case of ESTP, when applying an evolutionary algorithm to solve it, both of the aforementioned problems are present and seem to be crucial.  ... 
doi:10.1007/s12293-018-0256-7 fatcat:qsymdwg7n5b35m7sazmewrhoem

Computational Complexity Analysis of Genetic Programming - Initial Results and Future Directions [chapter]

Frank Neumann, Una-May O'Reilly, Markus Wagner
2011 Genetic and Evolutionary Computation  
The computational complexity analysis of evolutionary algorithms working on binary strings has significantly increased the rigorous understanding on how these types of algorithm work.  ...  They would significantly increase the theoretical understanding on how and why genetic programming algorithms work and indicate, in a rigorous manner, how design choices of algorithm components impact  ...  GP complexity analysis will appear similar to binary evolutionary algorithm analysis with respect to analyzing each algorithms in the context of solving a specific problem.  ... 
doi:10.1007/978-1-4614-1770-5_7 fatcat:xzyardboffcalfdlkmrnf4yhki
« Previous Showing results 1 — 15 out of 14,693 results