Parallel Ant Algorithms for the Minimum Tardy Task Problem

@inproceedings{AlbaParallelAA,
  title={Parallel Ant Algorithms for the Minimum Tardy Task Problem},
  author={Enrique Alba and Guillermo Leguizam{\'o}n and Guillermo Ordo{\~n}ez}
}
Ant Colony Optimization algorithms are intrinsically distributed algorithms where independent agents are in charge of building solutions. Stigmergy or indirect communication is the way in which each agent learns from the experience of the whole colony. However, explicit communication and parallel models of ACO can be implemented directly on different parallel platforms. We do so, and apply the resulting algorithms to the Minimum Tardy Task Problem (MTTP), a scheduling problem that has been… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 23 references

An Introduction to the Design and Analysis of Algorithms

D. R. Stinson
The Charles Babbage Research Center,, Winnipeg, Manitoba, Canada, 2nd edition edition, • 1987
View 14 Excerpts
Highly Influenced

E

G. Ordoñe
Alba, G. Leguizamón. Evolutionary algorithms for the minimum tardy task problem. In Proceedings of the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, pages 401–413, Rio de Janeiro, Brasil, • 2003
View 4 Excerpts
Highly Influenced

A Parallel Implementation of Ant Colony Optimization

J. Parallel Distrib. Comput. • 2002
View 4 Excerpts
Highly Influenced

An ant system for the maximum independent set problem

Z. Michalewicz M. Schütz G. Leguizamón
Proceedings of the 2001 Argentinian Congress on Computer Science • 2003

and T

M. Dorig
Stützle. Handbook of Metaheuristics, volume 57 of International Series In Operations Research and Management Science, chapter 9.-The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances, pages 251–285. Kluwer Academic Publisher, • 2003
View 1 Excerpt

Applying Evolutionary Algorithms to Combinatorial Optimization Problems

International Conference on Computational Science • 2001
View 1 Excerpt

Leguizamón . New version of ant system for subset problems

G. Z.Michalewicz
Proceedings of the 1999 Congress on Evolutionary Computation • 2001

M

N. Meulea
Zlochin, M. Birattari and M. Dorigo. Model-based search for combinatorial optimization. Technical report, TR/IRIDIA/2001-15, • 2001

Similar Papers

Loading similar papers…