A dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem

被引：3

作者：

Perez-Bellido, Angel M. ^{[1
]}

Salcedo-Sanz, Sancho ^{[1
]}

Ortiz-Garcia, Emilio G. ^{[1
]}

Portilla-Figueras, Antonio ^{[1
]}

Naldi, Maurizio ^{[2
]}

机构：

[1] Univ Alcala de Henares, Dept Signal Theory & Commun, Madrid 28871, Spain

[2] Univ Roma Tor Vergata, Dipartimento Informat Sistemi & Prod, Rome, Italy

来源：

COMPUTER COMMUNICATIONS | 2009年 / 32卷 / 01期

关键词：

Delay-constrained capacitated minimum spanning tree; Evolutionary algorithms; Dandelion encoding; Heuristics; COMPLEXITY; CODE;

D O I：

10.1016/j.comcom.2008.09.030

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper proposes an evolutionary algorithm with Dandelion-encoding to tackle the Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) problem. This problem has been recently proposed, and consists of finding several broadcast trees from a source node, jointly considering traffic and delay constraints in trees. A version of the problem in which the source node is also included in the optimization process is considered as well in the paper. The Dandelion code used in the proposed evolutionary algorithm has been recently proposed as an effective way of encoding trees in evolutionary algorithms. Good properties of locality has been reported on this encoding, which makes it very effective to solve problems in which the solutions can be expressed in form of trees. In the paper we describe the main characteristics of the algorithm, the implementation of the Dandelion-encoding to tackled the DC-CMST problem and a modification needed to include the source node in the optimization. In the experimental section of this article we compare the results obtained by our evolutionary with that of a recently proposed heuristic for the DC-CMST. the Least Cost (LC) algorithm. We show that our Dandelion-encoded evolutionary algorithm is able to obtain better results that the LC in all the instances tackled. (C) 2008 Elsevier B.V. All rights reserved.

引用

页码：154 / 158

页数：5

共 17 条

[1] A hierarchical topology discovery service for IPv6 networks [J].

Astic, I ;

Festor, O .

NOMS 2002: IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM: MANAGEMENT SOLUTIONS FOR THE NEW COMMUNICATIONS WORLD, 2002, :497-510

[2]

Bejerano Y, 2003, IEEE INFOCOM SER, P342

[3]

Chandy K.M., 1973, NETWORKS, V3, P173

[4]

DEO N, 2001, C NUMERANTIUM, V151, P65

[5]

ESAU L, 1996, IBM SYST J, V3, P142

[6]

Gavish B., 1986, Proceedings of IEEE INFOCOM '86. Fifth Annual Conference on `Computers and Communications Integration Design, Analysis, Management' (Cat. No.86CH2284-8), P130

[7]

Golberg DE., 1989, Choice Reviews Online, V1989, P36, DOI DOI 10.5860/CHOICE.27-0936

[8]

KARAMAN A, 2003, P IEEE INT S COMP CO

[9] Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem [J].

Lee, YJ ;

Atiquzzaman, A .

COMPUTER COMMUNICATIONS, 2005, 28 (11) :1371-1379

[10]

LEE YJ, IET COMMUNICATIONS, V1, P1238

← 1 2 →