Two models of parallel ACO algorithms for the minimum tardy task problem
by Enrique Alba, Guillermo Leguizamon, Guillermo Ordonez
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 1, No. 1, 2007

Abstract: Ant Colony Optimisation (ACO) algorithms are intrinsically distributed algorithms where independent agents are in charge of building solutions collaboratively. Stigmergy or indirect communication is the way in which each agent learns from the experience of the whole colony. In this sense, explicit communication models of ACO can be defined directly giving birth to parallel algorithms of high numerical and real time efficiency. We do so in this work and apply the resulting algorithms to the Minimum Tardy Task Problem (MTTP), a scheduling problem that has been faced with other metaheuristics in the past. The aim of this paper is to report experimental results on the behaviour of two types of parallel ACO algorithms on large instances of the mentioned problem with the goal of improving existing solutions significantly.

Online publication date: Thu, 19-Apr-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com