EDA-based Decomposition Approach for Binary LSGO Problems

Evgenii Sopov

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 (LSGO) problems. Many well-known real-world LSGO problems are not separable and are complex for detailed analysis, thus they are viewed as the black-box optimization problems. The most advanced algorithms for LSGO are based on cooperative coevolution schemes using the problem decomposition. These algorithms are mainly proposed for the real-valued search space and cannot be applied for problems with discrete or mixed variables. In this paper a novel technique is proposed, that uses a binary genetic algorithm as the core technique. The estimation of distribution algorithm (EDA) 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 EDA-based decomposition GA using the island model is also discussed. The results of numerical experiments for benchmark problems from the CEC competition are presented and discussed. The experiments show that the approach demonstrates efficiency comparable to other advanced techniques.

References

  1. Dong, W., Chen, T., Tino, P., Yao, X., 2013. Scaling up estimation of distribution algorithms for continuous optimization. IEEE Trans. Evol. Comput. 17 (6). pp. 797-822.
  2. Gonga Y.-J., Chena, W.N., Zhana, Zh.-H., Zhanga, J., Li, Y., Zhange, Q., Lif, J.-J., 2015. Distributed evolutionnary algorithms and their models: A survey of the stateof-the-art. Applied Soft Computing, 34. pp. 286-300.
  3. LaTorre, A., Muelas, S., Pena, J.-M., 2013. Large scale global optimization: experimental results with MOSbased hybrid algorithms. In 2013 IEEE Congress on Evolutionary Computation (CEC). pp. 2742-2749.
  4. Li, X., Tang, K., Omidvar, M.N., Yang, Zh., Qin, K., 2013a. Benchmark functions for the CEC 2013 special session and competition on large-scale global optimization. Technical Report, Evolutionary Computation and Machine Learning Group, RMIT University, Australia.
  5. Li, X., Tang, K., Omidvar, M.N., Yang, Zh., Qin, K., 2013b. Technical report on 2013 IEEE Congress on Evolutionary Computation Competition on Large Scale Global Optimization. [online] Available at: http://goanna.cs.rmit.edu.au/xiaodong/cec13- lsgo/competition/lsgo-competition-sumary-2013.pdf.
  6. Liu, J., Tang, K., 2013. Scaling up covariance matrix adaptation evolution strategy using cooperative coevolution. In Intelligent Data Engineering and Automated Learning - IDEAL 2013. pp. 350-357. Springer.
  7. Mahdavi, S., Shiri, M.E., Rahnamayan, Sh., 2015. Metaheuristics in large-scale global continues optimization: A survey. Information Sciences, Vol. 295. pp. 407-428.
  8. Omidvar, M.N., Li, X., Mei, Y., Yao, X., 2014. Cooperative co-evolution with differential grouping for large scale optimization. IEEE Trans. Evol. Comput. 18 (3). pp. 378-393.
  9. Potter, M., De Jong, K.A., 2000. Cooperative coevolution: an architecture for evolving coadapted subcomponents. Evol. Comput. 8 (1). pp. 1-29.
  10. Semenkin, E.S. and Semenkina, M.E., 2012. Selfconfiguring Genetic Algorithm with Modified Uniform Crossover Operator. Advances in Swarm Intelligence. Lecture Notes in Computer Science 7331. SpringerVerlag, Berlin Heidelberg. pp. 414-421.
  11. Sopov, E., 2015. A Self-configuring Metaheuristic for Control of Multi-Strategy Evolutionary Search. ICSICCI 2015, Part III, LNCS 9142. pp. 29-37.
  12. Sopov, E., Sopov, S., 2011. 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.
  13. Test suite for the IEEE CEC'13 competition on the LSGO. [online] Available at: http://goanna.cs.rmit.edu.au/ xiaodong/cec13-lsgo/competition/lsgo_2013_bench marks.zip.
  14. Wang, Y., Li, B., 2008. A restart univariate estimation of distribution algorithm: sampling under mixed gaussian and lévy probability distribution. In IEEE Congress on Evolutionary Computation, CEC 2008 (IEEE World Congress on Computational Intelligence). pp. 3917- 3924.
  15. Wei, F., Wang, Y., Huo, Y., 2013. Smoothing and auxiliary functions based cooperative coevolution for global optimization. In 2013 IEEE Congress on Evolutionary Computation (CEC). pp. 2736-2741.
  16. Yang, Zh., Tang, K., Yao, X., 2008. Large scale evolutionary optimization using cooperative coevolution. Inform. Sci. 178 (15). pp. 2985-2999.
Download


Paper Citation


in Harvard Style

Sopov E. (2016). EDA-based Decomposition Approach for Binary LSGO Problems . In Proceedings of the 8th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2016) ISBN 978-989-758-201-1, pages 132-139. DOI: 10.5220/0006034301320139


in Bibtex Style

@conference{ecta16,
author={Evgenii Sopov},
title={EDA-based Decomposition Approach for Binary LSGO Problems},
booktitle={Proceedings of the 8th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2016)},
year={2016},
pages={132-139},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006034301320139},
isbn={978-989-758-201-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2016)
TI - EDA-based Decomposition Approach for Binary LSGO Problems
SN - 978-989-758-201-1
AU - Sopov E.
PY - 2016
SP - 132
EP - 139
DO - 10.5220/0006034301320139