An effective genetic algorithm approach to the quadratic minimum spanning tree problem
Computers and Operations Research
A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree
Journal of Heuristics
Network random keys: a tree representation scheme for genetic and evolutionary algorithms
Evolutionary Computation
Artificial Life and Molecular Evolutionary Biology
Proceedings of the Third European Conference on Advances in Artificial Life
Evolution Strategies, Network Random Keys, and the One-Max Tree Problem
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Direct Representation and Variation Operators for the Fixed Charge Transportation Problem
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Redundant representations in evolutionary computation
Evolutionary Computation
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
Evolutionary Computation
A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Genetic algorithms, path relinking, and the flowshop sequencing problem
Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Edge sets: an effective evolutionary coding of spanning trees
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
The edge-window-decoder representation for tree-based problems
IEEE Transactions on Evolutionary Computation
The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
The search behavior of an evolutionary algorithm depends on the interactions between the encoding that represents candidate solutions to the target problem and the operators that act on that encoding. In this paper, we focus on analyzing some properties such as locality, heritability, population diversity and searching behavior of various decoder-based evolutionary algorithm (EA) frameworks using different encodings, decoders and genetic operators for spanning tree based optimization problems. Although debate still continues on how and why EAs work well, many researchers have observed that EAs perform well when its encoding and operators exhibit good locality, heritability and diversity properties.We analyze these properties of various EA frameworks with two types of analytical ways on different spanning tree problems; static analysis and dynamic analysis, and then visualize them. We also show through this analysis that EA using the Edge Set encoding (ES) and the Edge Window Decoder encoding (EWD) indicate very good locality and heritability as well as very good diversity property. These are put forward as a potential explanation for the recent finding that they can outperform other recent high-performance encodings on the constrained spanning tree problems.