Skip to main content

Experimental Evaluation of ACO for Continuous Domains to Solve Function Optimization Problems

  • Conference paper
  • First Online:
Swarm Intelligence (ANTS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11172))

Included in the following conference series:

  • 1462 Accesses

Abstract

A new Ant Colony Optimization \(\text {ACO}_\text {B}\) to solve function optimization problems (FOP) is evaluated experimentally by using ten standard multimodal test functions such as Michaelwicz’s function. In \(\text {ACO}_\text {B}\), ants search for solutions in binary search space and can improve the accuracy of solutions by the stepwise localization of search space. Experiments show that \(\text {ACO}_\text {B}\) can keep the balance between accuracy and efficiency to search for optimum solutions, and that it can reduce the population size of \(\text {ACO}_\text {R}\), which is a preceding ACO based on real search space. It is also shown that Covariance Matrix Adaptation-Evolution Strategy (CMA-ES) is superior in computational time but lacks the accuracy of solutions, and that Genetic Algorithm (GA) is superior in the ratio of getting the optimum solutions but weak in the performance.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dorigo, M., StĂĽtzle, T.: Ant Colony Optimization. The MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  2. Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344, 243–278 (2005)

    Article  MathSciNet  Google Scholar 

  3. Yang, X.-S.: Test problems in optimization. In: Yang, X.-S. (ed.) Engineering Optimization: An Introduction with Metaheuristic Applications. Wiley (2010)

    Google Scholar 

  4. Borhani, R.: Machine Learning Refined: Foundations, Algorithms, and Applications. Cambridge University Press, Cambridge (2016)

    MATH  Google Scholar 

  5. Aarts, E., Lenstra, J.K.: Local Search in Combinatorial Optimization. Princeton University Press, Princeton (2003)

    MATH  Google Scholar 

  6. Sait, S.M., Youssef, H.: Iterative Computer Algorithms with Applications in Engineering, (translated into Japanese by Y. Shiraishi), Maruzen Co., Ltd (2002)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Socha, K.: ACO for continuous and mixed-variable optimization. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 25–36. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-28646-2_3

    Chapter  Google Scholar 

  9. Ojha, V.K., Abraham, A., Snásel, V.: ACO for continuous function optimization: a performance analysis. In: Proceeding of 14th International Conference on Intelligent Systems Design and Applications (ISDA), pp. 145–150. IEEE (2014)

    Google Scholar 

  10. Takahashi, R., Nakamura, Y.: Ant colony optimization with stepwise localization of the discrete search space to solve function optimization problems. In: Proceedings of 16th IEEE International Conference on Machine Learning and Applications (ICMLA17), pp. 701–706 (2017)

    Google Scholar 

  11. Hansen, N.: The CMA evolution strategy: a comparing review. In: Lozano, J.A., Larrañaga, P., Inza, I., Bengoetxea, E. (eds.) Towards a New Evolutionary Computation. STUDFUZZ, pp. 75–102. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-32494-1_4

    Chapter  Google Scholar 

  12. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company Inc., Boston (1989)

    MATH  Google Scholar 

  13. Eshelman, L.J., Schaffer, J.D.: Real coded genetic algorithms and interval-schemata. Found. Genet. Algorithms 2, 187–202 (1993)

    Google Scholar 

  14. Takahashi, R.: Empirical evaluation of changing crossover operators to solve function optimization problems. In: Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2016), pp. 1–10 (2016). https://doi.org/10.1109/SSCI.2016.7850141

  15. Schwefel, H.P., Wegener, I., Weinert, K.: Advances in Computational Intelligence. Springer, Heiderberg (2003). https://doi.org/10.1007/978-3-662-05609-7

    Book  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by JSPS KAKENHI Grant Number JP15K00347, Grant-in-Aid for Scientific Research (C). We would like to thank them for supporting our work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ryouei Takahashi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Takahashi, R., Nakamura, Y., Ibaraki, T. (2018). Experimental Evaluation of ACO for Continuous Domains to Solve Function Optimization Problems. In: Dorigo, M., Birattari, M., Blum, C., Christensen, A., Reina, A., Trianni, V. (eds) Swarm Intelligence. ANTS 2018. Lecture Notes in Computer Science(), vol 11172. Springer, Cham. https://doi.org/10.1007/978-3-030-00533-7_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00533-7_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00532-0

  • Online ISBN: 978-3-030-00533-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics