Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

GECCO
1999
Springer

favoriteEmaildiscussreport

116views Optimization» more GECCO 1999»

Dynamic Degree Constrained Network Design: A Genetic Algorithm Approach

13 years 8 months ago

Dynamic Degree Constrained Network Design: A Genetic Algorithm Approach

Download www.cs.bham.ac.uk

The design and development of network infrastructure to support mission-critical operations has become a critical and complicated issue. In this study we explore the use of genetic algorithms GA for the design of a degree constrained minimal spanning tree DCMST problem with varied degrees on each node. The performance of GA was compared with two popular heuristics. The results indicate that GA provide better solution quality compared to heuristics, but is worse than heuristics in terms of computation time.

Chao-Hsien Chu, G. Premkumar, Carey Chou, Jianzhon

Real-time Traffic

Complicated Issue | GECCO 1999 | Minimal Spanning Tree | Optimization | Popular Heuristics |

claim paper

Related Content

» A dynamically constrained genetic algorithm for hardwaresoftware partitioning

» Optimisation of Active Rule Agents Using a Genetic Algorithm Approach

» Nature inspired genetic algorithms for hard packing problems

» Dynamics of gene expression in an artificial genome

» Finding Balanced Incomplete Block Designs with Metaheuristics

» Applying genetic algorithms to decision making in autonomic computing systems

» INPoD InNetwork Processing over Sensor Networks based on Code Design

» A Practical Markov Chain Monte Carlo Approach to Decision Problems

» Novel architectures for P2P applications the continuousdiscrete approach

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	GECCO
Authors	Chao-Hsien Chu, G. Premkumar, Carey Chou, Jianzhong Sun

Comments (0)