Parallel ant algorithms for the minimum tardy task problem

• Autores: Alba Torres, Enrique; Leguizamón, Guillermo; Ordoñez, Guillermo
• Año de publicación: 2004
• Idioma: inglés
• Tipo de recurso: documento de conferencia
• Materia: Ciencias Informáticas; Optimization; Hormigas; Parallel; Models; ARTIFICIAL INTELLIGENCE; Intelligent agents; ant colony optimization; parallel models; minimum tardy task problem
• Institución: Universidad Nacional de La Plata

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 faced with other metaheuristics, e.g., evolutionary algorithms and canonical ant algorithms. The aim of this article is twofold. First, it shows a new instance generator for MTTP to deal with the concept of “problem class”; second, it reports some preliminary results of the implementation of two type of parallel ACO algorithms for solving novel and larger instances of MTTP.
Eje: V - Workshop de agentes y sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI)