Skip to main content
SpringerLink
Log in

Ant colony optimization with different crossover schemes for global optimization

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Global optimization, especially large scale optimization problems arise as a very interesting field of research, because they appear in many real-world problems. Ant colony optimization is one of optimization techniques for these problems. In this paper, we improve the continuous ant colony optimization (ACO\(_\mathrm{R})\) with crossover operator. Three crossover methods are employed to generate some new probability density function set of ACO\(_\mathrm{R}\). The proposed algorithms are evaluated by using 21 benchmark functions whose dimensionality is 30–1000. The simulation results show that the proposed ACO\(_\mathrm{R}\) with different crossover operators significantly enhance the performance of ACO\(_\mathrm{R}\) for global optimization. In the case the dimensionality is 1000, the proposed algorithm also can efficiently solves them. Compared with state-of-art algorithms, the proposal is a very competitive optimization algorithm for global optimization problems.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Zhang, X., Tian, Y., Jin, Y.: A knee point driven evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 19(6), 761–776 (2015)

    Article  Google Scholar 

  2. Zhang, X., Tian, Y., Cheng, R., Jin, Y.: An efficient approach to non-dominated sorting for evolutionary multi-objective optimization. IEEE Trans. Evol. Comput. 19(2), 201–213 (2015)

    Article  Google Scholar 

  3. Chen, Z.Q., Wang, R.L.: A new framework with FDPP-LX crossover for real-coded genetic algorithm. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E94.A(6), 1417–1425 (2011)

    Article  Google Scholar 

  4. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  5. Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. Eur. J. Oper. Res. 185(3), 1155–1173 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Tang, K., Yao, X., Suganthan, P.N., MacNish, C., Chen, Y.P., Chen, C.M., Yang, Z.: Benchmark Functions for the CEC’2008 Special Session and Competition on Large Scale Global Optimization. IEEE World Congress on Computational Intelligence (2008), Hong Kong

  7. Zhang, X., Tian, Y., Cheng, R., Jin, Y.: A decision variable clustering based evolutionary algorithm for large-scale many-objective optimization. IEEE Trans. Evol. Comput. (2016). doi:10.1109/TEVC.2016.2600642

  8. Zhang, X., Tian, Y., Jin, Y.: Approximate non-dominated sorting for evolutionary many-objective optimization. Inf. Sci. 369(10), 14–33 (2016)

    Article  Google Scholar 

  9. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: an autocatalytic optimizing process. Technical Report 91-016 Revised, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1991

  10. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B 26(1), 29–41 (1996)

    Article  Google Scholar 

  11. Bilchev, G., Parmee I.C.: The ant colony metaphor for searching continuous design spaces. Selected Papers from AISB Workshop on Evolutionary Computing, vol. 993, pp. 25–39 (1995)

  12. Monmarche, N., Venturini, G., Slimane, M.: On how pachycondyla apicalis ants suggest a new search algorithm. Future Gener. Comput. Syst. 16(8), 937–946 (2000)

    Article  Google Scholar 

  13. Dreo, J., Siarry, P.: A new ant colony algorithm using the heterarchical concept aimed at optimization of multiminima continuous functions. Ant Algorithms 2463, 216–221 (2002)

    Article  Google Scholar 

  14. Dréo, J., Siarry, P.: Continuous interacting ant colony algorithm based on dense heterarchy. Future Gener. Comput. Syst. 20(5), 841–856 (2004)

    Article  Google Scholar 

  15. Hu, X.M., Zhang, J., Li, Y.: Orthogonal methods based ant colony search for solving continuous optimization problems. J. Comput. Sci. Technol. 23, 2–18 (2008)

    Article  Google Scholar 

  16. Hu, X.M., Zhang, J., Chung, H.S.H., Li, Y., Liu, O.: SamACO: variable sampling ant colony optimization algorithm for continuous optimization. IEEE Trans. Syst. Man Cybern. B Cybern. 40, 1555–1566 (2010)

    Article  Google Scholar 

  17. Liao, T., Stützle, T.: A unified ant colony optimization algorithm for continuous optimization. Eur. J. Oper. Res. 234, 597–609 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  18. Eshelman, L.J., Schaffer, J.D.: Real-coded genetic algorithms and interval schemata. In: Whitley, D.L. (ed.) Foundation of Genetic Algorithms II, pp. 187–202. Morgan Kaufmann, San Mateo (1993)

    Google Scholar 

  19. Ono, I., Kobayashi, S.: A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover. In: Back, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 246–253. Morgan Kaufmann, San Mateo (1997)

    Google Scholar 

  20. Ballester, P.J., Carter, J.N.: An effective real-parameter genetic algorithm with parent centric normal crossover for multimodal optimization. In: Deb, K., et al. (eds.) Lecture Notes in Computer Science, vol. 3102, pp. 901–913. Springer, Berlin (2004)

  21. Shang, Y.W., Qiu, Y.H.: A note on the extended rosenbrock function. Evol. Comput. 14, 119–126 (2006)

    Article  Google Scholar 

  22. Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82–102 (1999)

    Article  Google Scholar 

  23. Rosenbrock, H.H.: An automatic method for finding the greatest or least value of a function. Comput. J. 3(3), 175–184 (1960)

    Article  MathSciNet  Google Scholar 

  24. Ortiz-Boyer, D., Hervas-Martinez, C., Garcia-Pedrajas, N.: A crossover operator for evolutionary algorithms based on population features. J. Artif. Intell. Res. 24, 1–48 (2005)

    Article  MATH  Google Scholar 

  25. Hansen, N.: The CMA Evolution Strategy: A Tutorial, 2010

Download references

Acknowledgements

This work is supported by Scientific and Technological Research Program of Chongqing Municipal Education Commission [Nos. KJ1500607, KJ1400629], Science Research Fund of Chongqing Technology and Business University [No. 2011-56-05], and the National Natural Science Foundation of China [51375517, 61402063].

Author information

Authors and Affiliations

  1. National Research Base of Intelligent Manufacturing Service, Chongqing Technology and Business University, Chongqing, China

    Zhiqiang Chen

  2. Chongqing Engineering Laboratory for Detection Control and Integrated System, Chongqing Technology and Business University, Chongqing, China

    Zhiqiang Chen

  3. School of Computer Science and Information Engineering, Chongqing Technology and Business University, Chongqing, China

    Zhiqiang Chen

  4. The Faculty of Engineering, University of Fukui, Fukui-shi, Japan

    Rong-Long Wang

Authors
  1. Zhiqiang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rong-Long Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhiqiang Chen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, Z., Wang, RL. Ant colony optimization with different crossover schemes for global optimization. Cluster Comput 20, 1247–1257 (2017). https://doi.org/10.1007/s10586-017-0793-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-0793-8

Keywords

Search

Navigation