T-ACO Tournament Ant Colony Optimisation for High-dimensional Problems

Emmanuel Sapin; Ed Keedwell

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

T-ACO Tournament Ant Colony Optimisation for High-dimensional Problems

Topics: Swarm/Collective Intelligence

In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 0IJCCI, 81-86, 2012 , Barcelona, Spain

Authors: Emmanuel Sapin and Ed Keedwell

Affiliation: University of Exeter, United Kingdom

Keyword(s): Ant Colony Optimisation, Tournament Selection, High-dimensional Problem.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Computing ; Soft Computing ; Swarm/Collective Intelligence

Abstract: Standard ACO implementations use a roulette wheel to allow ants to make path decisions at each node of the topology which works well for problems of smaller dimensionality, but breaks down when higher numbers of variables are considered. Such problems are becoming commonplace in biology and particularly in genomics where thousands of variables are considered in parallel. In this paper, a tournament-based ACO approach is proposed that is shown to outperform the roulette wheel-based approach for all problems of higher dimensionality in terms of the performance of the final solutions and execution time on problems taken from the literature.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.118.145.114

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Sapin, E. and Keedwell, E. (2012). T-ACO Tournament Ant Colony Optimisation for High-dimensional Problems. In Proceedings of the 4th International Joint Conference on Computational Intelligence (IJCCI 2012) - ECTA; ISBN 978-989-8565-33-4; ISSN 2184-3236, SciTePress, pages 81-86. DOI: 10.5220/0004159900810086

@conference{ecta12,
author={Emmanuel Sapin. and Ed Keedwell.},
title={T-ACO Tournament Ant Colony Optimisation for High-dimensional Problems},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence (IJCCI 2012) - ECTA},
year={2012},
pages={81-86},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004159900810086},
isbn={978-989-8565-33-4},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the 4th International Joint Conference on Computational Intelligence (IJCCI 2012) - ECTA
TI - T-ACO Tournament Ant Colony Optimisation for High-dimensional Problems
SN - 978-989-8565-33-4
IS - 2184-3236
AU - Sapin, E.
AU - Keedwell, E.
PY - 2012
SP - 81
EP - 86
DO - 10.5220/0004159900810086
PB - SciTePress