PICA: Multi-population Implementation of Parallel Imperialist Competitive Algorithms

The importance of optimization and NP-problems solving cannot be over emphasized. The usefulness and popularity of evolutionary computing methods are also well established. There are various types of evolutionary methods that are mostly sequential, and some others have parallel implementation. We propose a method to parallelize Imperialist Competitive Algorithm (Multi-Population). The algorithm has been implemented with MPI on two platforms and have tested our algorithms on a shared-memory and message passing architecture. An outstanding performance is obtained, which indicates that the method is efficient concern to speed and accuracy. In the second step, the proposed algorithm is compared with a set of existing well known parallel algorithms and is indicated that it obtains more accurate solutions in a lower time.

[1]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .

[2]  Karim Faez,et al.  Adaptive Imperialist Competitive Algorithm (AICA) , 2010, 9th IEEE International Conference on Cognitive Informatics (ICCI'10).

[3]  Chuntian Cheng,et al.  A Parallel Ant Colony Algorithm for Bus Network Optimization , 2007, Comput. Aided Civ. Infrastructure Eng..

[4]  Ying Tan,et al.  Particle swarm optimization with triggered mutation and its implementation based on GPU , 2010, GECCO '10.

[5]  Peng-Yeng Yin,et al.  A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems , 2006, Comput. Stand. Interfaces.

[6]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[7]  Günter Rudolph,et al.  Dynamic Neighborhood Structures in Parallel Evolution Strategies , 2001, Complex Syst..

[8]  Alper Basturk,et al.  Comparison of fine-grained and coarse-grained parallel models in particle swarm optimization algorithm , 2012 .

[9]  Yu Wen,et al.  Parallel Ant Colony Optimization Algorithm , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[10]  Karim Faez,et al.  Imperialist Competitive Algorithm Using Chaos Theory for Optimization (CICA) , 2010, 2010 12th International Conference on Computer Modelling and Simulation.

[11]  Jason G. Digalakis,et al.  A Parallel Memetic Algorithm for Solving Optimization Problems , 2001 .

[12]  Giancarlo Mauri,et al.  A Comparative Study of Four Parallel and Distributed PSO Methods , 2011, New Generation Computing.

[13]  Harikrishna Narasimhan,et al.  Parallel artificial bee colony (PABC) algorithm , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[14]  Shahriar Lotfi,et al.  Review on parallel evolutionary computing and introduce three general framework to parallelize all EC algorithms , 2013, The 5th Conference on Information and Knowledge Technology.

[15]  Mohammad Reza Meybodi,et al.  Imperialist Competitive Algorithm with Adaptive Colonies Movement , 2012 .

[16]  Emílio Carlos Gomes Wille,et al.  Discrete Capacity Assignment in IP networks using Particle Swarm Optimization , 2011, Appl. Math. Comput..

[17]  Enrique Alba,et al.  Parallel heterogeneous genetic algorithms for continuous optimization , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[18]  R. M. Rizk-Allah,et al.  A hybrid ant colony optimization approach based local search scheme for multiobjective design optimizations , 2011 .

[19]  Shahriar Lotfi,et al.  Task graph scheduling in multiprocessor systems using a coarse grained genetic algorithm , 2010, 2010 2nd International Conference on Computer Technology and Development.

[20]  Enrique Alba,et al.  Parallel evolutionary algorithms can achieve super-linear performance , 2002, Inf. Process. Lett..

[21]  Rafael Stubs Parpinelli,et al.  Parallel Approaches for the Artificial Bee Colony Algorithm , 2011 .