A parallel implementation of ant colony optimization

M Randall, A. Lewis

Research output: Contribution to journalArticleResearchpeer-review

141 Citations (Scopus)
18 Downloads (Pure)

Abstract

Ant Colony Optimization is a relatively new class of meta-heuristic search techniques for optimization problems. As it is a population-based technique that examines numerous solution options at each step of the algorithm, there are a variety of parallelization opportunities. In this paper, several parallel decomposition strategies are examined. These techniques are applied to a specific problem, namely the travelling salesman problem, with encouraging speedup and efficiency results. (C) 2002 Elsevier Science (USA)

Original languageEnglish
Pages (from-to)1421-1432
Number of pages12
JournalJournal of Parallel and Distributed Computing
Volume62
Issue number9
DOIs
Publication statusPublished - Sep 2002

Cite this

@article{71ecb091b67b436f900eb1e7524ca85e,
title = "A parallel implementation of ant colony optimization",
abstract = "Ant Colony Optimization is a relatively new class of meta-heuristic search techniques for optimization problems. As it is a population-based technique that examines numerous solution options at each step of the algorithm, there are a variety of parallelization opportunities. In this paper, several parallel decomposition strategies are examined. These techniques are applied to a specific problem, namely the travelling salesman problem, with encouraging speedup and efficiency results. (C) 2002 Elsevier Science (USA)",
author = "M Randall and A. Lewis",
year = "2002",
month = "9",
doi = "10.1006/jpdc.2002.1854",
language = "English",
volume = "62",
pages = "1421--1432",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Elsevier",
number = "9",

}

A parallel implementation of ant colony optimization. / Randall, M; Lewis, A.

In: Journal of Parallel and Distributed Computing, Vol. 62, No. 9, 09.2002, p. 1421-1432.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - A parallel implementation of ant colony optimization

AU - Randall, M

AU - Lewis, A.

PY - 2002/9

Y1 - 2002/9

N2 - Ant Colony Optimization is a relatively new class of meta-heuristic search techniques for optimization problems. As it is a population-based technique that examines numerous solution options at each step of the algorithm, there are a variety of parallelization opportunities. In this paper, several parallel decomposition strategies are examined. These techniques are applied to a specific problem, namely the travelling salesman problem, with encouraging speedup and efficiency results. (C) 2002 Elsevier Science (USA)

AB - Ant Colony Optimization is a relatively new class of meta-heuristic search techniques for optimization problems. As it is a population-based technique that examines numerous solution options at each step of the algorithm, there are a variety of parallelization opportunities. In this paper, several parallel decomposition strategies are examined. These techniques are applied to a specific problem, namely the travelling salesman problem, with encouraging speedup and efficiency results. (C) 2002 Elsevier Science (USA)

U2 - 10.1006/jpdc.2002.1854

DO - 10.1006/jpdc.2002.1854

M3 - Article

VL - 62

SP - 1421

EP - 1432

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 9

ER -