Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm

Authors:
Ángel M. Pérez-Bellido;Sancho Salcedo-Sanz;Emilio G. Ortiz-García;Antonio Portilla-Figueras;Maurizio Naldi
Affiliations:
Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain 28871;Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain 28871;Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain 28871;Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain 28871;Dip. di Informatica, Sistemi e Produzione, Roma, Italy 00133
Venue:
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Year:
2008

Citing 8
Cited 0

A distributed algorithm for delay-constrained unicast routing

IEEE/ACM Transactions on Networking (TON)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
DCMC - Delay-Constrained Multipoint Communication with Multiple Sources

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
A hub location problem with fully interconnected backbone and access networks

Computers and Operations Research
Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem

Computer Communications
On teleprocessing system design: part II a method for approximating the optimal network

IBM Systems Journal
From the Dandelion Code to the Rainbow code: a class of bijective spanning tree representations with linear complexity and bounded locality

IEEE Transactions on Evolutionary Computation
The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) is a recently proposed problem which arises in the design of the topology of communications networks. The DC-CMST proposes the joint optimization of the network topology in terms of the traffic capacity and its mean time delay. In this paper, an evolutionary algorithm which uses Dandelion-encoding is proposed to solve the problem. The Dandelion code has been recently proposed as an effective way of encoding trees in evolutionary algorithms, due to its good properties of locality. We describe the main characteristics of the algorithm, and compare its results with that of an existing heuristic for the DC-CMST. We show that our Dandelion-encoded evolutionary algorithm is able to obtain better results in all the instances tackled.