Heuristics for ant colony optimisation using the generalised assignment problem

Marcus Randall*

*Corresponding author for this work

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

14 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 Dive into the research topics of 'Heuristics for ant colony optimisation using the generalised assignment problem'. Together they form a unique fingerprint.

  • Cite this