Parallel EigenAnt Algorithm based on MPI by ACO Approach

Parallelization is amongthe best approaches that can be used to enhance the performance in heuristic algorithms.The EigenAntalgorithmmodel is an Ant Colony Optimization (ACO)that leads to the selection of the shortestpaths.In this research, we propose a Parallel EigenAntAlgorithm(PEAA) using Ant Colony Optimization approach. The algorithm is implemented by Message Passing Interface (MPI) in a parallel form.It is possible to send or receive messages to a group of processes in collective communications. Parallel EigenAnt algorithmimproves the speed to find a better solution by ants. Experimental results showed that the proposed parallel EigenAnt algorithm yields a significant improvement by finding the shortest path from a source to a destination.The results also showed that thesuggested algorithm improves the execution time and efficiency.The performance of the proposed method improved the speedup, efficiency and quality of solution compared to Sequential EigenAnt algorithm