A Survey of Ant Colony and Particle Swarm Meta-heuristics and their Application to Discrete Optimisation Problems

Tim Hendtlass, Marcus Randall

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

Optimisation problems have traditionally been dealt with by techniques from the operations research community such as branch and bound, cutting planes and dynamic programming. However, these often intractable problems are increasingly being solved by meta-heuristic class algorithms. Among these, simulated annealing, tabu search and genetic algorithms have been popular. A set of tools based on biological and evolutionary paradigms such as bird swarms and ant colonies have recently emerged. This paper surveys the progress of these algorithms on benchmark and real world problems. In addition, the types of problems each technique is suitable for as well as possible hybrid systems, are discussed.
Original languageEnglish
Title of host publicationProceedings of the Inaugural Workshop on Artificial Life: AL'01
EditorsHussein A. Abbass
PublisherUniversity of New South Wales
Pages15-25
Number of pages11
ISBN (Print)0731705084
Publication statusPublished - 2001

Fingerprint

Operations research
Tabu search
Birds
Simulated annealing
Hybrid systems
Dynamic programming
Genetic algorithms

Cite this

Hendtlass, T., & Randall, M. (2001). A Survey of Ant Colony and Particle Swarm Meta-heuristics and their Application to Discrete Optimisation Problems. In H. A. Abbass (Ed.), Proceedings of the Inaugural Workshop on Artificial Life: AL'01 (pp. 15-25). University of New South Wales.
Hendtlass, Tim ; Randall, Marcus. / A Survey of Ant Colony and Particle Swarm Meta-heuristics and their Application to Discrete Optimisation Problems. Proceedings of the Inaugural Workshop on Artificial Life: AL'01. editor / Hussein A. Abbass. University of New South Wales, 2001. pp. 15-25
@inproceedings{b7601e95bee445fbb45fbe89784dfe89,
title = "A Survey of Ant Colony and Particle Swarm Meta-heuristics and their Application to Discrete Optimisation Problems",
abstract = "Optimisation problems have traditionally been dealt with by techniques from the operations research community such as branch and bound, cutting planes and dynamic programming. However, these often intractable problems are increasingly being solved by meta-heuristic class algorithms. Among these, simulated annealing, tabu search and genetic algorithms have been popular. A set of tools based on biological and evolutionary paradigms such as bird swarms and ant colonies have recently emerged. This paper surveys the progress of these algorithms on benchmark and real world problems. In addition, the types of problems each technique is suitable for as well as possible hybrid systems, are discussed.",
author = "Tim Hendtlass and Marcus Randall",
year = "2001",
language = "English",
isbn = "0731705084",
pages = "15--25",
editor = "Abbass, {Hussein A.}",
booktitle = "Proceedings of the Inaugural Workshop on Artificial Life: AL'01",
publisher = "University of New South Wales",
address = "Australia",

}

Hendtlass, T & Randall, M 2001, A Survey of Ant Colony and Particle Swarm Meta-heuristics and their Application to Discrete Optimisation Problems. in HA Abbass (ed.), Proceedings of the Inaugural Workshop on Artificial Life: AL'01. University of New South Wales, pp. 15-25.

A Survey of Ant Colony and Particle Swarm Meta-heuristics and their Application to Discrete Optimisation Problems. / Hendtlass, Tim; Randall, Marcus.

Proceedings of the Inaugural Workshop on Artificial Life: AL'01. ed. / Hussein A. Abbass. University of New South Wales, 2001. p. 15-25.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

TY - GEN

T1 - A Survey of Ant Colony and Particle Swarm Meta-heuristics and their Application to Discrete Optimisation Problems

AU - Hendtlass, Tim

AU - Randall, Marcus

PY - 2001

Y1 - 2001

N2 - Optimisation problems have traditionally been dealt with by techniques from the operations research community such as branch and bound, cutting planes and dynamic programming. However, these often intractable problems are increasingly being solved by meta-heuristic class algorithms. Among these, simulated annealing, tabu search and genetic algorithms have been popular. A set of tools based on biological and evolutionary paradigms such as bird swarms and ant colonies have recently emerged. This paper surveys the progress of these algorithms on benchmark and real world problems. In addition, the types of problems each technique is suitable for as well as possible hybrid systems, are discussed.

AB - Optimisation problems have traditionally been dealt with by techniques from the operations research community such as branch and bound, cutting planes and dynamic programming. However, these often intractable problems are increasingly being solved by meta-heuristic class algorithms. Among these, simulated annealing, tabu search and genetic algorithms have been popular. A set of tools based on biological and evolutionary paradigms such as bird swarms and ant colonies have recently emerged. This paper surveys the progress of these algorithms on benchmark and real world problems. In addition, the types of problems each technique is suitable for as well as possible hybrid systems, are discussed.

M3 - Conference contribution

SN - 0731705084

SP - 15

EP - 25

BT - Proceedings of the Inaugural Workshop on Artificial Life: AL'01

A2 - Abbass, Hussein A.

PB - University of New South Wales

ER -

Hendtlass T, Randall M. A Survey of Ant Colony and Particle Swarm Meta-heuristics and their Application to Discrete Optimisation Problems. In Abbass HA, editor, Proceedings of the Inaugural Workshop on Artificial Life: AL'01. University of New South Wales. 2001. p. 15-25