Heuristics for ant colony optimisation using the generalised assignment problem

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

12 Citations (Scopus)

Abstract

The use of embedded heuristics within meta-heuristic search algorithms has a large effect on their performance. One of the more recent classes of meta-heuristics, ant colony optimisation, is examined in terms of both the heuristic used to select solution components and the local search heuristics used to improve solutions. Static and adaptive heuristic control strategies are developed, as well as neighbourhood oriented local search transition operators, that are able to obtain good solutions to large and tightly constrained generalised assignment problem instances.

Original languageEnglish
Title of host publicationCongress on Evolutionary Computation
Subtitle of host publicationCEC2004
Pages1916-1923
Number of pages8
Volume2
DOIs
Publication statusPublished - 2004
EventIEEE Congress on Evolutionary Computation - Portland, OR, United States
Duration: 19 Jun 200423 Jun 2004
https://www.ieee.org/conferences_events/index.html

Conference

ConferenceIEEE Congress on Evolutionary Computation
Abbreviated titleCEC2004
CountryUnited States
CityPortland, OR
Period19/06/0423/06/04
Internet address

Fingerprint

Ant colony optimization

Cite this

Randall, Marcus. / Heuristics for ant colony optimisation using the generalised assignment problem. Congress on Evolutionary Computation: CEC2004. Vol. 2 2004. pp. 1916-1923
@inproceedings{0336b0ad381d4b16a5a6de6da45e362d,
title = "Heuristics for ant colony optimisation using the generalised assignment problem",
abstract = "The use of embedded heuristics within meta-heuristic search algorithms has a large effect on their performance. One of the more recent classes of meta-heuristics, ant colony optimisation, is examined in terms of both the heuristic used to select solution components and the local search heuristics used to improve solutions. Static and adaptive heuristic control strategies are developed, as well as neighbourhood oriented local search transition operators, that are able to obtain good solutions to large and tightly constrained generalised assignment problem instances.",
author = "Marcus Randall",
year = "2004",
doi = "10.1109/CEC.2004.1331130",
language = "English",
isbn = "0780385152",
volume = "2",
pages = "1916--1923",
booktitle = "Congress on Evolutionary Computation",

}

Randall, M 2004, Heuristics for ant colony optimisation using the generalised assignment problem. in Congress on Evolutionary Computation: CEC2004. vol. 2, pp. 1916-1923, IEEE Congress on Evolutionary Computation, Portland, OR, United States, 19/06/04. https://doi.org/10.1109/CEC.2004.1331130

Heuristics for ant colony optimisation using the generalised assignment problem. / Randall, Marcus.

Congress on Evolutionary Computation: CEC2004. Vol. 2 2004. p. 1916-1923.

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

TY - GEN

T1 - Heuristics for ant colony optimisation using the generalised assignment problem

AU - Randall, Marcus

PY - 2004

Y1 - 2004

N2 - The use of embedded heuristics within meta-heuristic search algorithms has a large effect on their performance. One of the more recent classes of meta-heuristics, ant colony optimisation, is examined in terms of both the heuristic used to select solution components and the local search heuristics used to improve solutions. Static and adaptive heuristic control strategies are developed, as well as neighbourhood oriented local search transition operators, that are able to obtain good solutions to large and tightly constrained generalised assignment problem instances.

AB - The use of embedded heuristics within meta-heuristic search algorithms has a large effect on their performance. One of the more recent classes of meta-heuristics, ant colony optimisation, is examined in terms of both the heuristic used to select solution components and the local search heuristics used to improve solutions. Static and adaptive heuristic control strategies are developed, as well as neighbourhood oriented local search transition operators, that are able to obtain good solutions to large and tightly constrained generalised assignment problem instances.

UR - http://www.scopus.com/inward/record.url?scp=4344608505&partnerID=8YFLogxK

U2 - 10.1109/CEC.2004.1331130

DO - 10.1109/CEC.2004.1331130

M3 - Conference contribution

SN - 0780385152

SN - 9780780385153

VL - 2

SP - 1916

EP - 1923

BT - Congress on Evolutionary Computation

ER -