A cellular ant colony optimisation for the generalised Steiner problem

The development of exact and heuristic algorithms for communication network design requires ever-growing amounts of computational power. In particular, finding a dependable, fault-tolerant network topology can be modelled as the generalised Steiner problem (GSP). This problem belongs to the NP-hard class, so that exact methods cannot be applied to real life sized problems. An alternative is using metaheuristics, but even in this case the computation time can quickly grow leading to extremely long runs or to degraded quality results. In this paper, we discuss the use of parallel implementations as a means to tackle this computational performance bottleneck. In particular, we concentrate on the ant colony optimisation (ACO) metaheuristic. We review previous ACO approaches for solving the GSP, as well as literature on parallelisation of this method. We propose and develop a new parallel model suitable for ACO, called cellular ACO, which is then applied to the GSP. We present computational results for large GSP instances, showing that cellular ACO finds high quality solutions, comparable to the best published sequential and parallel metaheuristics, while attaining a large speedup, resulting in very good computational efficiency.

[1]  Daniel Merkle,et al.  Parallel Ant Colony Algorithms , 2005 .

[2]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[3]  Witold Pedrycz,et al.  Computational Intelligence in Telecommunications Networks , 2000 .

[4]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[5]  Gerardo Rubino,et al.  Network design with node connectivity constraints , 2003, LANC '03.

[7]  Javier Jaén Martínez,et al.  A grid ant colony algorithm for the orienteering problem , 2005, 2005 IEEE Congress on Evolutionary Computation.

[8]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[9]  S. K. Arora,et al.  Synthesis of multiterminal communication nets: Finding one or all solutions , 1976 .

[10]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[11]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[12]  Franco Robledo On the Generalized Steiner Problem with Network Reliability Conditions , 2006, Electron. Notes Discret. Math..

[13]  Panos M. Pardalos,et al.  Handbook of Optimization in Telecommunications , 2006 .

[14]  Nicolas Zufferey,et al.  An Ant Algorithm for the Steiner Tree Problem in Graphs , 2009, EvoWorkshops.

[15]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

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

[17]  David Corne,et al.  Telecommunications Optimization: Heuristic and Adaptive Computation Techniques , 2000 .

[18]  J. Y. Yen Finding the K Shortest Loopless Paths in a Network , 1971 .

[19]  Martin J. Oates,et al.  Telecommunications Optimization: Heuristic and Adaptive Techniques , 2000 .

[20]  Stefan Voß,et al.  Steiner Tree Problems in Telecommunications , 2006, Handbook of Optimization in Telecommunications.

[21]  Paul H. Calamai,et al.  Exchange strategies for multiple Ant Colony System , 2007, Inf. Sci..

[22]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[23]  Enrique Alba,et al.  Nature-Inspired Informatics for Telecommunication Network Design , 2010, Nature-Inspired Informatics for Intelligent Applications and Knowledge Discovery.

[24]  Enrique Alba,et al.  Evolutionary algorithms applied to reliable communication network design , 2007 .

[25]  Anthony Skjellum,et al.  Using MPI - portable parallel programming with the message-parsing interface , 1994 .

[26]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

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

[28]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.