Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges
Proceedings of the 2002 ACM symposium on Applied computing
Proceedings of the 2003 ACM symposium on Applied computing
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Minimum spanning trees made easier via multi-objective optimization
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
An ant-based algorithm for finding degree-constrained minimum spanning tree
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Evolutionary algorithms and matroid optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
Orientation matters: how to efficiently solve ocst problems with problem-specific EAs
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A SOLUTION OF REAL-WORLD OCST PROBLEMS WITH A NEW TREE ENCODING-BASED GENETIC ALGORITHM
Cybernetics and Systems
Hierarchical spanning tree network design with Nash genetic algorithm
Computers and Industrial Engineering
'Adaptive Link Adjustment' Applied to the Fixed Charge Transportation Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On Optimal Solutions for the Optimal Communication Spanning Tree Problem
Operations Research
New insights into the OCST problem: integrating node degrees and their location in the graph
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Evolutionary algorithms and dynamic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
On the bias and performance of the edge-set encoding
IEEE Transactions on Evolutionary Computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
The property analysis of evolutionary algorithms applied to spanning tree problems
Applied Intelligence
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A solution for bi-level network design problem through nash genetic algorithm
ICHIT'06 Proceedings of the 1st international conference on Advances in hybrid information technology
Nonlinear network optimization: an embedding vector space approach
IEEE Transactions on Evolutionary Computation
A swarm intelligence approach to the quadratic minimum spanning tree problem
Information Sciences: an International Journal
Solving OCST problems with problem-specific guided local search
Proceedings of the 12th annual conference on Genetic and evolutionary computation
More effective crossover operators for the all-pairs shortest path problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A productivity-oriented methodology for local area network design in industrial environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
Multiobjective network topology design
Applied Soft Computing
A genetic algorithm based heuristic to the multi-period fixed charge distribution problem
Applied Soft Computing
On a property analysis of representations for spanning tree problems
EA'05 Proceedings of the 7th international conference on Artificial Evolution
On the application of evolutionary algorithms to the consensus tree problem
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Making the edge-set encoding fly by controlling the bias of its crossover operator
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
A novel genetic algorithm for multi-criteria minimum spanning tree problem
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
A frame for selecting replicated multicast servers using genetic algorithm
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Multiobjective EA approach for improved quality of solutions for spanning tree problem
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
A relation-algebraic view on evolutionary algorithms for some graph problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A memetic algorithm for the biobjective minimum spanning tree problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Proceedings of the 14th annual conference on Genetic and evolutionary computation
More effective crossover operators for the all-pairs shortest path problem
Theoretical Computer Science
Computers and Industrial Engineering
EvoGeneSys, a new evolutionary approach to graph generation
Applied Soft Computing
An analysis on recombination in multi-objective evolutionary optimization
Artificial Intelligence
| Hi-index | 0.00 |
The fundamental design choices in an evolutionary algorithm (EA) are its representation of candidate solutions and the operators that will act on that representation. We propose representing spanning trees in EAs for network design problems directly as sets of their edges and we describe initialization, recombination, and mutation operators for this representation. The operators offer locality, heritability, and computational efficiency. Initialization and recombination depend on an underlying random spanning-tree algorithm. Three choices for this algorithm, based on the minimum spanning-tree algorithms of Prim and Kruskal and on random walks, respectively, are examined analytically and empirically. We demonstrate the usefulness of the edge-set encoding in an EA for the NP-hard degree-constrained minimum spanning-tree problem. The algorithm's operators are easily extended to generate only feasible spanning trees and to incorporate local, problem-specific heuristics. Comparisons of this algorithm to others that encode candidate spanning trees via the Blob Code, with network random keys, and as strings of weights indicate the superiority of the edge-set encoding, particularly on larger instances.