Parallel ACO algorithms for 2D Strip Packing

In this paper we present a study of a parallel Ant Colony System (ACS) for the two-dimensional strip packing problem. In our computational study, we emphasize the inuence of the incorporation of the received information in the target subcolony. Colonies send their best solutions instead of sending informa- tion from the matrix of pheromones, as happens in traditional parallel ACS. The solution arriving to a colony can provide further exploitation around promising solutions as this arrived solution can be used in both, the local update of the pheromone trail and the construction solution process of an ant. The aim of the paper is to report experimental results on the behavior of different types of paral- lel ACS algorithms, regarding solution qualities and parallel performance.

[1]  Andrew Lewis,et al.  A Parallel Implementation of Ant Colony Optimization , 2002, J. Parallel Distributed Comput..

[2]  Enrique Alba,et al.  Two models of parallel ACO algorithms for the minimum tardy task problem , 2007, Int. J. High Perform. Syst. Archit..

[3]  E. Hopper,et al.  A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.

[4]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[5]  Enrique Alba,et al.  Hybrid Ant Colony System to Solve a 2-Dimensional Strip Packing Problem , 2008, 2008 Eighth International Conference on Hybrid Intelligent Systems.

[6]  Frederick Ducatelle,et al.  Ant colony optimization and local search for bin packing and cutting stock problems , 2004, J. Oper. Res. Soc..

[7]  Günther R. Raidl,et al.  An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing , 2004, PPSN.

[8]  Vittorio Maniezzo,et al.  An Ant System Heuristic for the Two-Dimensional Finite Bin Packing Problem: preliminary results , 2005 .

[9]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[10]  Enrique Alba,et al.  Analyzing synchronous and asynchronous parallel distributed genetic algorithms , 2001, Future Gener. Comput. Syst..

[11]  Hartmut Schmeck,et al.  Multi Colony Ant Algorithms , 2002, J. Heuristics.

[12]  Pearl Y. Wang,et al.  Data set generation for rectangular placement problems , 2001, Eur. J. Oper. Res..

[13]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

[14]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[15]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[16]  Enrique Alba,et al.  Optimization Techniques for Solving Complex Problems , 2009 .