Skip to main content

The ACO Encoding

Moraglio, Alberto, Otero, Fernando E.B., Johnson, Colin G. (2010) The ACO Encoding. In: Dorigo, Marco, ed. Swarm Intelligence - 7th International Conference (ANTS 2010). Lecture Notes in Computer Science 6234 . pp. 182-196.

PDF - Author's Accepted Manuscript
Download (144kB) Preview
[img]
Preview
Official URL
http://www.cs.kent.ac.uk/pubs/2010/3176

Abstract

Ant Colony Optimization (ACO) differs substantially from other meta-heuristics such as Evolutionary Algorithms (EA). Two of its distinctive features are: (i) it is constructive rather than based on iterative improvements, and (ii) it employs problem knowledge in the construction process via the heuristic function, which is essential for its success. In this paper, we introduce the ACO encoding, which is a self-contained algorithmic component that can be readily used to make available these two particular features of ACO to any search algorithm for continuous spaces based on iterative improvements to solve combinatorial optimization problems.

Item Type: Conference or workshop item (Poster)
Uncontrolled keywords: determinacy analysis, Craig interpolants
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Computational Intelligence Group
Depositing User: Fernando Otero
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 01 Aug 2019 10:35 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/30631 (The current URI for this page, for reference purposes)
Otero, Fernando E.B.: https://orcid.org/0000-0003-2172-297X
Johnson, Colin G.: https://orcid.org/0000-0002-9236-6581
  • Depositors only (login required):

Downloads

Downloads per month over past year