Results 1 
5 of
5
EdgeSets: An Effective Evolutionary Coding of Spanning Trees
, 2002
"... The fundamental design choices in an evolutionary algorithm are its representation of candidate solutions and the operators that will act on that representation. We propose representing spanning trees in evolutionary algorithms for network design problems directly as sets of their edges, and we d ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
(Show Context)
The fundamental design choices in an evolutionary algorithm are its representation of candidate solutions and the operators that will act on that representation. We propose representing spanning trees in evolutionary algorithms for network design problems directly as sets of their edges, and we describe initialization, recombination, and mutation operators for this representation. The operators offer
A hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem
"... The problem of finding a Capacitated Minimum Spanning Tree asks for connecting a set of client nodes to a root node through a minimum cost tree network, subject to capacity constraints on all links. This paper reports on our design, implementation and performance evaluation of a hybrid Ant Colony Op ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
The problem of finding a Capacitated Minimum Spanning Tree asks for connecting a set of client nodes to a root node through a minimum cost tree network, subject to capacity constraints on all links. This paper reports on our design, implementation and performance evaluation of a hybrid Ant Colony Optimization algorithm for finding Capacitated Minimum Spanning Trees. Our Ant Colony Optimization algorithm is based on two important problem characteristics, namely the close relationship of the Capacitated Minimum Spanning Tree Problem with both the Capacitated Vehicle Routing Problem and the Minimum Spanning Tree Problem and hybridizes the Savings based Ant System with the algorithm of Prim, which is used to solve the subproblems of finding minimal spanning trees exactly. To assess the performance of our implementation we perform a computational study on a set of well known benchmark instances. For these instances our results show both the effectiveness and the efficiency of our algorithm when compared to several other stateoftheart techniques. 1
On WeightBiased Mutation for Graph Problems
"... Many graph problems seek subgraphs of minimum weight that satisfy the problems' constraints. Examples include the degreeconstrained minimum spanning tree and traveling salesman problems. Lowweight edges ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Many graph problems seek subgraphs of minimum weight that satisfy the problems' constraints. Examples include the degreeconstrained minimum spanning tree and traveling salesman problems. Lowweight edges
1.3 Theoretical Foundations and Practical Design of EAs............. 5
, 2002
"... von ..."
(Show Context)
Evolutionary Approach to Constrained Minimum Spanning Tree Problem  Commercial Software Based Application
"... The constrained minimum spanning tree problem is considered in the paper. We assume that the degree of any vertex should not exceed a particular constraint d. In this formulation the problem turns into NPhard one, therefore the evolutionary approach is applicable. The edge set representation of a c ..."
Abstract
 Add to MetaCart
The constrained minimum spanning tree problem is considered in the paper. We assume that the degree of any vertex should not exceed a particular constraint d. In this formulation the problem turns into NPhard one, therefore the evolutionary approach is applicable. The edge set representation of a chromosome was utilized for a tree in the algorithm. The evolutionary algorithm was worked out and the related computer program has been written. Interfaces between the core program and MS Visio as well as the data base system were prepared. The results obtained by means of the system are shown.