Moving Nature-Inspired Algorithms to Parallel, Asynchronous and Decentralised Environments

Enda Ridge; Daniel Kudenko; Dimitar Kazakov; Edward Curry

Moving Nature-Inspired Algorithms to Parallel, Asynchronous and Decentralised Environments

Enda Ridge, Daniel Kudenko, Dimitar Kazakov, Edward Curry

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

This paper motivates research into implementing nature-inspired algorithms in decentralised, asynchronous and parallel environments. These characteristics typify environments such as Peer-To-Peer systems, the Grid and autonomic computing which demand robustness, decentralisation, parallelism, asynchronicity and self-organisation. Nature-inspired systems promise these properties. However, current implementations of nature-inspired systems are only loosely based on their natural counterparts. They are generally implemented as synchronous, sequential, centralised algorithms that loop through passive data structures. For their successes to be relevant to the aforementioned new computing environments, variants of these algorithms must work in truely decentralised, parallel and asynchronous Multi-Agent System (MAS) environments. A general methodology is presented for engineering the transfer of nature-inspired algorithms to such a MAS framework. The concept of pheromone infrastructures is reviewed in light of emerging standards for agent platform architecture and interoperability. These ideas are illustrated using a particularly successful nature-inspired algorithm, Ant Colony System for the Travelling Salesman Problem.

Original language	Undefined/Unknown
Pages	35-49
Publication status	Published - 2005

Bibliographical note

ISBN 978-1-58603-577-8

Access to Document

http://www.booksonline.iospress.nl/Content/View.aspx?piid=797

Cite this

@conference{9020ac9d260c494eb6a46173dac6b943,

title = "Moving Nature-Inspired Algorithms to Parallel, Asynchronous and Decentralised Environments",

abstract = "This paper motivates research into implementing nature-inspired algorithms in decentralised, asynchronous and parallel environments. These characteristics typify environments such as Peer-To-Peer systems, the Grid and autonomic computing which demand robustness, decentralisation, parallelism, asynchronicity and self-organisation. Nature-inspired systems promise these properties. However, current implementations of nature-inspired systems are only loosely based on their natural counterparts. They are generally implemented as synchronous, sequential, centralised algorithms that loop through passive data structures. For their successes to be relevant to the aforementioned new computing environments, variants of these algorithms must work in truely decentralised, parallel and asynchronous Multi-Agent System (MAS) environments. A general methodology is presented for engineering the transfer of nature-inspired algorithms to such a MAS framework. The concept of pheromone infrastructures is reviewed in light of emerging standards for agent platform architecture and interoperability. These ideas are illustrated using a particularly successful nature-inspired algorithm, Ant Colony System for the Travelling Salesman Problem.",

author = "Enda Ridge and Daniel Kudenko and Dimitar Kazakov and Edward Curry",

note = "ISBN 978-1-58603-577-8",

year = "2005",

language = "Undefined/Unknown",

pages = "35--49",

}

TY - CONF

T1 - Moving Nature-Inspired Algorithms to Parallel, Asynchronous and Decentralised Environments

AU - Ridge, Enda

AU - Kudenko, Daniel

AU - Kazakov, Dimitar

AU - Curry, Edward

N1 - ISBN 978-1-58603-577-8

PY - 2005

Y1 - 2005

N2 - This paper motivates research into implementing nature-inspired algorithms in decentralised, asynchronous and parallel environments. These characteristics typify environments such as Peer-To-Peer systems, the Grid and autonomic computing which demand robustness, decentralisation, parallelism, asynchronicity and self-organisation. Nature-inspired systems promise these properties. However, current implementations of nature-inspired systems are only loosely based on their natural counterparts. They are generally implemented as synchronous, sequential, centralised algorithms that loop through passive data structures. For their successes to be relevant to the aforementioned new computing environments, variants of these algorithms must work in truely decentralised, parallel and asynchronous Multi-Agent System (MAS) environments. A general methodology is presented for engineering the transfer of nature-inspired algorithms to such a MAS framework. The concept of pheromone infrastructures is reviewed in light of emerging standards for agent platform architecture and interoperability. These ideas are illustrated using a particularly successful nature-inspired algorithm, Ant Colony System for the Travelling Salesman Problem.

AB - This paper motivates research into implementing nature-inspired algorithms in decentralised, asynchronous and parallel environments. These characteristics typify environments such as Peer-To-Peer systems, the Grid and autonomic computing which demand robustness, decentralisation, parallelism, asynchronicity and self-organisation. Nature-inspired systems promise these properties. However, current implementations of nature-inspired systems are only loosely based on their natural counterparts. They are generally implemented as synchronous, sequential, centralised algorithms that loop through passive data structures. For their successes to be relevant to the aforementioned new computing environments, variants of these algorithms must work in truely decentralised, parallel and asynchronous Multi-Agent System (MAS) environments. A general methodology is presented for engineering the transfer of nature-inspired algorithms to such a MAS framework. The concept of pheromone infrastructures is reviewed in light of emerging standards for agent platform architecture and interoperability. These ideas are illustrated using a particularly successful nature-inspired algorithm, Ant Colony System for the Travelling Salesman Problem.

M3 - Paper

SP - 35

EP - 49

ER -