A novel ant algorithm for solving the minimum broadcast time problem

Yehudit Hasson; Moshe Sipper

doi:10.1007/978-3-540-30217-9_51

A novel ant algorithm for solving the minimum broadcast time problem

Yehudit Hasson
, Moshe Sipper

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

6 Scopus citations

Abstract

The problem of Minimum Broadcast Time (MET) seeks to find the minimal number of times steps required to broadcast a message through a communication network. We describe a novel ant algorithm for solving this NP-Complete problem and compare it to three other known algorithms, one of which is genetic. Through experimentation on randomly generated graphs we show that our algorithm finds the best solutions.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Xin Yao, John A. Bullinaria, Jonathan Rowe, Peter Tino, Ata Kaban, Edmund Burke, Jose A. Lozano, Jim Smith, Juan J. Merelo-Guervos, Hans-Paul Schwefel
Publisher	Springer Verlag
Pages	501-510
Number of pages	10
ISBN (Print)	3540230920, 9783540230922
DOIs	https://doi.org/10.1007/978-3-540-30217-9_51
State	Published - 1 Jan 2004

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3242
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-30217-9_51

Cite this

Hasson, Y., & Sipper, M. (2004). A novel ant algorithm for solving the minimum broadcast time problem. In X. Yao, J. A. Bullinaria, J. Rowe, P. Tino, A. Kaban, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervos, & H.-P. Schwefel (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 501-510). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3242). Springer Verlag. https://doi.org/10.1007/978-3-540-30217-9_51

Hasson, Yehudit ; Sipper, Moshe. / A novel ant algorithm for solving the minimum broadcast time problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Xin Yao ; John A. Bullinaria ; Jonathan Rowe ; Peter Tino ; Ata Kaban ; Edmund Burke ; Jose A. Lozano ; Jim Smith ; Juan J. Merelo-Guervos ; Hans-Paul Schwefel. Springer Verlag, 2004. pp. 501-510 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{63b0347314a1450ca18c9befd277a636,

title = "A novel ant algorithm for solving the minimum broadcast time problem",

abstract = "The problem of Minimum Broadcast Time (MET) seeks to find the minimal number of times steps required to broadcast a message through a communication network. We describe a novel ant algorithm for solving this NP-Complete problem and compare it to three other known algorithms, one of which is genetic. Through experimentation on randomly generated graphs we show that our algorithm finds the best solutions.",

author = "Yehudit Hasson and Moshe Sipper",

year = "2004",

month = jan,

day = "1",

doi = "10.1007/978-3-540-30217-9\_51",

language = "English",

isbn = "3540230920",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "501--510",

editor = "Xin Yao and Bullinaria, \{John A.\} and Jonathan Rowe and Peter Tino and Ata Kaban and Edmund Burke and Lozano, \{Jose A.\} and Jim Smith and Merelo-Guervos, \{Juan J.\} and Hans-Paul Schwefel",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}

Hasson, Y & Sipper, M 2004, A novel ant algorithm for solving the minimum broadcast time problem. in X Yao, JA Bullinaria, J Rowe, P Tino, A Kaban, E Burke, JA Lozano, J Smith, JJ Merelo-Guervos & H-P Schwefel (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3242, Springer Verlag, pp. 501-510. https://doi.org/10.1007/978-3-540-30217-9_51

A novel ant algorithm for solving the minimum broadcast time problem. / Hasson, Yehudit; Sipper, Moshe.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Xin Yao; John A. Bullinaria; Jonathan Rowe; Peter Tino; Ata Kaban; Edmund Burke; Jose A. Lozano; Jim Smith; Juan J. Merelo-Guervos; Hans-Paul Schwefel. Springer Verlag, 2004. p. 501-510 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3242).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - A novel ant algorithm for solving the minimum broadcast time problem

AU - Hasson, Yehudit

AU - Sipper, Moshe

PY - 2004/1/1

Y1 - 2004/1/1

N2 - The problem of Minimum Broadcast Time (MET) seeks to find the minimal number of times steps required to broadcast a message through a communication network. We describe a novel ant algorithm for solving this NP-Complete problem and compare it to three other known algorithms, one of which is genetic. Through experimentation on randomly generated graphs we show that our algorithm finds the best solutions.

AB - The problem of Minimum Broadcast Time (MET) seeks to find the minimal number of times steps required to broadcast a message through a communication network. We describe a novel ant algorithm for solving this NP-Complete problem and compare it to three other known algorithms, one of which is genetic. Through experimentation on randomly generated graphs we show that our algorithm finds the best solutions.

UR - https://www.scopus.com/pages/publications/35048890167

U2 - 10.1007/978-3-540-30217-9_51

DO - 10.1007/978-3-540-30217-9_51

M3 - Chapter

AN - SCOPUS:35048890167

SN - 3540230920

SN - 9783540230922

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 501

EP - 510

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Yao, Xin

A2 - Bullinaria, John A.

A2 - Rowe, Jonathan

A2 - Tino, Peter

A2 - Kaban, Ata

A2 - Burke, Edmund

A2 - Lozano, Jose A.

A2 - Smith, Jim

A2 - Merelo-Guervos, Juan J.

A2 - Schwefel, Hans-Paul

PB - Springer Verlag

ER -

Hasson Y, Sipper M. A novel ant algorithm for solving the minimum broadcast time problem. In Yao X, Bullinaria JA, Rowe J, Tino P, Kaban A, Burke E, Lozano JA, Smith J, Merelo-Guervos JJ, Schwefel HP, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 501-510. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-30217-9_51

A novel ant algorithm for solving the minimum broadcast time problem

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this