Skip to main content
Log in

RMACO :a randomly matched parallel ant colony optimization

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

Ant Colony Optimization (ACO), inspired by the foraging behavior of real ants, is a widely applied bionic algorithm. Driven by the requirements of applications and the advances of computing technologies, ACO has been studied extensively, and the parallelism of ACO becomes an important research area. In this paper, we analyze the key factors that affect the performance of parallel ACO, based on which we propose a randomly matched parallel ant colony optimization (RMACO) using MPI. In RMACO, we design a new interconnection communication topology based on which the processors communicate with each other using a randomly matched method, and propose a non-fixed exchange cycle as well. All of these ensure the quality of the solution found by ACO and reduce the execution time. The experimental results show that RMACO has better efficiency compared with existing typical parallel ACO approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Dorigo M.: Optimization, learning and natural algorithms. Doctoral Dissertation, Politecnico di Milano, Italy (1992)

    Google Scholar 

  2. Dorigo M., Caro G.D., Gambardella L.M.: Ant algorithms for discrete optimization. Artif Life. 5(2), 137–172 (1999)

    Article  Google Scholar 

  3. Dorigo M., Maniezzo V., Colorni A.: Positive feedback as a search strategy. Technical Report 91–016, Dipartimento di Elettronica, Politecnico di Milano, Milan (1991)

    MATH  Google Scholar 

  4. Dorigo M., Maniezzo V., Colorni A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. on Systems, Man and Cybernet, Part-B. 26(1), 29–41 (1996)

    Article  Google Scholar 

  5. Bullnheimer B., Hartl R.F., Strauss C.: An improved ant system algorithm for the vehicle routing problem. Ann. Oper. Res. 89(1), 319–328 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)

  7. Dorigo M., Birattari M., Stützle T.: Ant colony optimization: artificial ants as a computational intelligence technique. IEEE Comput. Intell. Mag. 1(4), 28–39 (2006)

    Article  Google Scholar 

  8. Stützle T., Dorigo M.: A short convergence proof for a class of ant colony optimization algorithms. IEEE Trans. Evol. Comput. 6(4), 358–365 (2002)

    Article  Google Scholar 

  9. Maur M., López-Ibánez M., Stützle T.: Pre-scheduled and adaptive parameter variation in MAX-MIN ant system. In: Ishibuchi H. et al. (eds.) Proceedings of CEC 2010, pp. 3823–3830. IEEE Press, Piscataway (2010)

    Google Scholar 

  10. Lee Z.J., Su S.F., Chuang C.C., et al.: Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment. Appl. Soft Comput. 8(1), 55–78 (2008)

    Article  Google Scholar 

  11. Hani, Y., Amodeo, L., Yalaoui, F., et al.: Hybrid optimisation method for the facility layout problem. In: Swarm Intelligence: Focus on Ant and Particle Swarm Optimization, pp. 331–342. INTECH Open Access Publisher, Vienna (2007)

  12. Benkner, S., Doerner, K., Hartl, R.F., Kiechle, G., Lucka, M.: In: Complimentary Proceedings of PARA 2004 Workshop on State-of-the-Art in Scientific Computing, June 20–23, 2004, Lyngby, Denmark, pp. 3–12. (2005)

  13. Ellabib I., Calamai P., Basir O.: Exchange strategies for multiple ant colony system. Inf Sci. 177(5), 1248–1264 (2007)

    Article  Google Scholar 

  14. Stützle T.: Parallelization strategies for ant colony optimization. In: Eiben A.E., Bäck T., Schoenauer M., Schwefel H.-P. (eds.) Parallel problem solving from nature—PPSN V, LNCS, vol. 1498, pp. 722–731. Springer-Verlag, Berlin (1998)

    Chapter  Google Scholar 

  15. Manfrin M., Birattari M., Stützle T., Dorigo M.: Parallel ant colony optimization for the traveling salesman problem. In: Dorigo M., Gambardella L.M., Birattari M., Martinoli A., Poli R., Stützle T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 224–234. Springer, Heidelberg (2006)

    Google Scholar 

  16. Randall M., Lewis A.: A parallel implementation of ant colony optimization. J Parallel Distrib Comput. 62(9), 1421–1432 (2002)

    Article  MATH  Google Scholar 

  17. Koshimizu, H., Saito, T.: Parallel ant colony optimizers with local and global ants. In: Neural Networks, 2009. IJCNN 2009. International Joint Conference on, pp. 1655–1659. IEEE (2009)

  18. Garey M.R., Johnson D.S.: Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman & Company, San Francisco (1979)

    MATH  Google Scholar 

  19. Meng, X., Shen, Z., Yue, Y., et al.: An Improvement to the Coordination Method of Ant Colony Algorithm. Computer Distributed Control and Intelligent Environmental Monitoring (CDCIEM), International Conference on. IEEE, 114–117 (2012)

  20. Stützle T., Hoos H.: MAX-MIN ant system[J]. Future Gener Comput Syst. 16(8), 889–914 (2000)

    Article  Google Scholar 

  21. MPI: A Message-Passing Interface Standard Version 2.2., http://www.mpi-forum.org/docs/mpi-2.2/mpi22-report.pdf. (2015)

  22. Reinelt, G.: TSPLIB95 http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/. (2015)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qun Yang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, Q., Fang, L. & Duan, X. RMACO :a randomly matched parallel ant colony optimization. World Wide Web 19, 1009–1022 (2016). https://doi.org/10.1007/s11280-015-0369-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-015-0369-6

Keywords

Navigation