Skip to main content

Large-Scale Global Optimization Using a Binary Genetic Algorithm with EDA-Based Decomposition

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2016)

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

Included in the following conference series:

Abstract

In recent years many real-world optimization problems have had to deal with growing dimensionality. Optimization problems with many hundreds or thousands of variables are called large-scale global optimization (LGSO) problems. The most advanced algorithms for LSGO are proposed for continuous problems and are based on cooperative coevolution schemes using the problem decomposition. In this paper a novel technique is proposed. A genetic algorithm is used as the core technique. The estimation of distribution algorithm is used for collecting statistical data based on the past search experience to provide the problem decomposition by fixing genes in chromosomes. Such an EDA-based decomposition technique has the benefits of the random grouping methods and the dynamic learning methods. The results of numerical experiments for benchmark problems from the CEC’13 competition are presented. The experiments show that the approach demonstrates efficiency comparable to other advanced algorithms.

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. Dong, W., Chen, T., Tino, P., Yao, X.: Scaling up estimation of distribution algorithms for continuous optimization. IEEE Trans. Evol. Comput. 17(6), 797–822 (2013)

    Article  Google Scholar 

  2. LaTorre, A., Muelas, S., Pena, J.-M.: Large scale global optimization: experimental results with MOS-based hybrid algorithms. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 2742–2749 (2013)

    Google Scholar 

  3. Li, X., Tang, K., Omidvar, M.N., Yang, Z., Qin, K.: Benchmark functions for the CEC 2013 special session and competition on large-scale global optimization. Evolutionary Computation and Machine Learning Group, RMIT University, Australia (2013)

    Google Scholar 

  4. Li, X., Tang, K., Omidvar, M.N., Yang, Z., Qin, K.: Technical report on 2013 IEEE Congress on Evolutionary Computation Competition on Large Scale Global Optimization. http://goanna.cs.rmit.edu.au/~xiaodong/cec13-lsgo/competition/lsgo-competition-sumary-2013.pdf

  5. Liu, J., Tang, K.: Scaling up covariance matrix adaptation evolution strategy using cooperative coevolution. In: Yin, H., Tang, K., Gao, Y., Klawonn, F., Lee, M., Weise, T., Li, B., Yao, X. (eds.) IDEAL 2013. LNCS, vol. 8206, pp. 350–357. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  6. Mahdavi, S., Shiri, M.E., Rahnamayan, S.: Metaheuristics in large-scale global continues optimization: a survey. Inf. Sci. 295, 407–428 (2015)

    Article  MathSciNet  Google Scholar 

  7. Omidvar, M.N., Li, X., Mei, Y., Yao, X.: Cooperative co-evolution with differential grouping for large scale optimization. IEEE Trans. Evol. Comput. 18(3), 378–393 (2014)

    Article  Google Scholar 

  8. Potter, M., De Jong, K.A.: Cooperative coevolution: an architecture for evolving coadapted subcomponents. Evol. Comput. 8(1), 1–29 (2000)

    Article  Google Scholar 

  9. Sopov, E., Sopov, S.: The convergence prediction method for genetic and PBIL-like algorithms with binary representation. In: IEEE International Siberian Conference on Control and Communications, SIBCON 2011, pp. 203–206 (2011)

    Google Scholar 

  10. Test suite for the IEEE CEC 2013 competition on the LSGO. http://goanna.cs.rmit.edu.au/~xiaodong/cec13-lsgo/competition/lsgo_2013_benchmarks.zip

  11. Wang, Y., Li, B.: A restart univariate estimation of distribution algorithm: sampling under mixed gaussian and Lévy probability distribution. In: IEEE Congress on Evolutionary Computation, CEC 2008, pp. 3917–3924 (2008)

    Google Scholar 

  12. Wei, F., Wang, Y., Huo, Y.: Smoothing and auxiliary functions based cooperative coevolution for global optimization. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 2736– 2741 (2013)

    Google Scholar 

  13. Yang, Z., Tang, K., Yao, X.: Large scale evolutionary optimization using cooperative coevolution. Inform. Sci. 178(15), 2985–2999 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The research was supported by the President of the Russian Federation grant (MK-3285.2015.9).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Evgenii Sopov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Sopov, E. (2016). Large-Scale Global Optimization Using a Binary Genetic Algorithm with EDA-Based Decomposition. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2016. Lecture Notes in Computer Science(), vol 9712. Springer, Cham. https://doi.org/10.1007/978-3-319-41000-5_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-41000-5_62

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40999-3

  • Online ISBN: 978-3-319-41000-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics