Sciweavers

81 search results - page 3 / 17
» A Genetic Algorithm for the Weight Setting Problem in OSPF R...
Sort
View
JNW
2006
88views more  JNW 2006»
13 years 5 months ago
A Genetic Algorithms Based Approach for Group Multicast Routing
Whereas multicast transmission in one-to-many communications allows the operator to drastically save network resources, it also makes the routing of the traffic flows more complex ...
Luca Sanna Randaccio, Luigi Atzori
SAC
2000
ACM
13 years 10 months ago
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
Günther R. Raidl, Bryant A. Julstrom
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
13 years 11 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
NETWORKS
2007
13 years 5 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 5 months ago
Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
Uwe Aickelin, Kathryn A. Dowsland