Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Composite Decomposition Method for Large-Scale Global Optimization (2403.01192v2)

Published 2 Mar 2024 in math.OC, cs.LG, and cs.NE

Abstract: Cooperative co-evolution (CC) algorithms, based on the divide-and-conquer strategy, have emerged as the predominant approach to solving large-scale global optimization (LSGO) problems. The efficiency and accuracy of the grouping stage significantly impact the performance of the optimization process. While the general separability grouping (GSG) method has overcome the limitation of previous differential grouping (DG) methods by enabling the decomposition of non-additively separable functions, it suffers from high computational complexity. To address this challenge, this article proposes a composite separability grouping (CSG) method, seamlessly integrating DG and GSG into a problem decomposition framework to utilize the strengths of both approaches. CSG introduces a step-by-step decomposition framework that accurately decomposes various problem types using fewer computational resources. By sequentially identifying additively, multiplicatively and generally separable variables, CSG progressively groups non-separable variables by recursively considering the interactions between each non-separable variable and the formed non-separable groups. Furthermore, to enhance the efficiency and accuracy of CSG, we introduce two innovative methods: a multiplicatively separable variable detection method and a non-separable variable grouping method. These two methods are designed to effectively detect multiplicatively separable variables and efficiently group non-separable variables, respectively. Extensive experimental results demonstrate that CSG achieves more accurate variable grouping with lower computational complexity compared to GSG and state-of-the-art DG series designs.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. M. N. Omidvar, X. Li, and X. Yao, “A review of population-based metaheuristics for large-scale black-box global optimization—Part I,” IEEE Transactions on Evolutionary Computation, vol. 26, no. 5, pp. 802–822, 2022.
  2. J.-Y. Li, Z.-H. Zhan, K. C. Tan, and J. Zhang, “Dual differential grouping: A more general decomposition method for large-scale optimization,” IEEE Transactions on Cybernetics, vol. 53, no. 6, pp. 3624–3638, 2023.
  3. M. Bhattacharya, M. R. Islam, and J. H. Abawajy, “Evolutionary optimization: A big data perspective,” J. Netw. Comput. Appl., vol. 59, pp. 416–426, 2016.
  4. Y. Cao and D. Sun, “A parallel computing framework for large-scale air traffic flow optimization,” IEEE Transactions on Intelligent Transportation Systems, vol. 13, no. 4, pp. 1855–1864, 2012.
  5. T. Bäck, D. B. Fogel, and Z. Michalewicz, “Handbook of evolutionary computation,” Release, vol. 97, no. 1, p. B1, 1997.
  6. S. Mahdavi, M. E. Shiri, and S. Rahnamayan, “Metaheuristics in large-scale global continues optimization: A survey,” Information Sciences, vol. 295, pp. 407–428, 2015.
  7. D. Molina, A. LaTorre, and F. Herrera, “Shade with iterative local search for large-scale global optimization,” in 2018 IEEE Congress on Evolutionary Computation (CEC), 2018, pp. 1–8.
  8. A. LaTorre, S. Muelas, and J.-M. Peña, “Large scale global optimization: Experimental results with mos-based hybrid algorithms,” in 2013 IEEE Congress on Evolutionary Computation, 2013, pp. 2742–2749.
  9. R. Cheng and Y. Jin, “A competitive swarm optimizer for large scale optimization,” IEEE Transactions on Cybernetics, vol. 45, no. 2, pp. 191–204, 2015.
  10. M. A. Potter and K. A. De Jong, “A cooperative coevolutionary approach to function optimization,” in International Conference on Parallel Problem Solving from Nature.   Springer, 1994, pp. 249–257.
  11. Z. Yang, K. Tang, and X. Yao, “Large scale evolutionary optimization using cooperative coevolution,” Information Sciences, vol. 178, no. 15, pp. 2985–2999, 2008.
  12. M. N. Omidvar, X. Li, Y. Mei, and X. Yao, “Cooperative co-evolution with differential grouping for large scale optimization,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 3, pp. 378–393, 2014.
  13. F. van den Bergh and A. Engelbrecht, “A cooperative approach to particle swarm optimization,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 225–239, 2004.
  14. Y. Sun, M. Kirley, and S. K. Halgamuge, “A recursive decomposition method for large scale continuous optimization,” IEEE Transactions on Evolutionary Computation, vol. 22, no. 5, pp. 647–661, 2018.
  15. A. Kumar, S. Das, and R. Mallipeddi, “An efficient differential grouping algorithm for large-scale global optimization,” IEEE Transactions on Evolutionary Computation, pp. 1–1, 2022.
  16. W. Chen, T. Weise, Z. Yang, and K. Tang, “Large-scale global optimization using cooperative coevolution with variable interaction learning,” in International Conference on Parallel Problem Solving from Nature.   Springer, 2010, pp. 300–309.
  17. H. Ge, L. Sun, X. Yang, S. Yoshida, and Y. Liang, “Cooperative differential evolution with fast variable interdependence learning and cross-cluster mutation,” Applied Soft Computing, vol. 36, pp. 300–314, 2015.
  18. M. M. Komarnicki, M. W. Przewozniczek, H. Kwasnicka, and K. Walkowiak, “Incremental recursive ranking grouping for large-scale global optimization,” IEEE Transactions on Evolutionary Computation, vol. 27, no. 5, pp. 1498–1513, 2023.
  19. M. Chen, W. Du, Y. Tang, Y. Jin, and G. G. Yen, “A decomposition method for both additively and nonadditively separable problems,” IEEE Transactions on Evolutionary Computation, vol. 27, no. 6, pp. 1720–1734, 2023.
  20. A. Chen, Z. Ren, M. Wang, Y. Liang, H. Liu, and W. Du, “A surrogate-assisted variable grouping algorithm for general large-scale global optimization problems,” Information Sciences, vol. 622, pp. 437–455, 2023.
  21. M. Yang, A. Zhou, C. Li, and X. Yao, “An efficient recursive differential grouping for large-scale continuous problems,” IEEE Transactions on Evolutionary Computation, vol. 25, no. 1, pp. 159–171, 2021.
  22. M. N. Omidvar, M. Yang, Y. Mei, X. Li, and X. Yao, “DG2: A faster and more accurate differential grouping for large-scale black-box optimization,” IEEE Transactions on Evolutionary Computation, vol. 21, no. 6, pp. 929–942, 2017.
  23. X. Ma, Z. Huang, X. Li, L. Wang, Y. Qi, and Z. Zhu, “Merged differential grouping for large-scale global optimization,” IEEE Transactions on Evolutionary Computation, vol. 26, no. 6, pp. 1439–1451, 2022.
  24. A. Chen, Z. Ren, W. Guo, Y. Liang, and Z. Feng, “An efficient adaptive differential grouping algorithm for large-scale black-box optimization,” IEEE Transactions on Evolutionary Computation, vol. 27, no. 3, pp. 475–489, 2023.
  25. Y. Sun, M. Kirley, and S. K. Halgamuge, “Extended differential grouping for large scale global optimization with direct and indirect variable interactions,” in Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, 2015, pp. 313–320.
  26. Y. Mei, M. N. Omidvar, X. Li, and X. Yao, “A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization,” ACM Transactions on Mathematical Software (TOMS), vol. 42, no. 2, pp. 1–24, 2016.
  27. Y. Sun, X. Li, A. Ernst, and M. N. Omidvar, “Decomposition for large-scale optimization problems with overlapping components,” in 2019 IEEE Congress on Evolutionary Computation (CEC).   IEEE, 2019, pp. 326–333.
  28. X. Zhang, B.-W. Ding, X.-X. Xu, J.-Y. Li, Z.-H. Zhan, P. Qian, W. Fang, K.-K. Lai, and J. Zhang, “Graph-based deep decomposition for overlapping large-scale optimization problems,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 53, no. 4, pp. 2374–2386, 2023.
  29. J. Blanchard, C. Beauthier, and T. Carletti, “Investigating overlapped strategies to solve overlapping problems in a cooperative co-evolutionary framework,” in International Conference on Optimization and Learning.   Springer, 2021, pp. 254–266.
  30. X.-Y. Zhang, Y.-J. Gong, Y. Lin, J. Zhang, S. Kwong, and J. Zhang, “Dynamic cooperative coevolution for large scale optimization,” IEEE Transactions on Evolutionary Computation, vol. 23, no. 6, pp. 935–948, 2019.
  31. K. Tang, X. Li, P. N. Suganthan, Z. Yang, and T. Weise, “Benchmark functions for the CEC’2010 special session and competition on large-scale global optimization (2010),” Nature Inspired Computation and Applications Laboratory, USTC, China, 2009.
  32. X. Li, K. Tang, M. N. Omidvar, Z. Yang, K. Qin, and H. China, “Benchmark functions for the CEC’2013 special session and competition on large-scale global optimization,” Gene, vol. 7, no. 33, p. 8, 2013.
  33. Y. Sun, M. N. Omidvar, M. Kirley, and X. Li, “Adaptive threshold parameter estimation with recursive differential grouping for problem decomposition,” in Proceedings of the genetic and evolutionary computation conference, 2018, pp. 889–896.
  34. M. N. Omidvar, X. Li, and K. Tang, “Designing benchmark problems for large-scale continuous optimization,” Information Sciences, vol. 316, pp. 419–436, 2015.
  35. H. Marouani and O. Al-Mutiri, “Optimization of reliability-redundancy allocation problems: A review of the evolutionary algorithms.” Computers, Materials & Continua, vol. 71, no. 1, 2022.
  36. B. Rey and J.-C. Rochet, “Health and wealth: How do they affect individual preferences?” The Geneva Papers on Risk and Insurance Theory, vol. 29, pp. 43–54, 2004.
  37. R. Chenavaz, “Dynamic pricing, product and process innovation,” European Journal of Operational Research, vol. 222, no. 3, pp. 553–557, 2012.
  38. Z. Yang, K. Tang, and X. Yao, “Self-adaptive differential evolution with neighborhood search,” in 2008 IEEE Congress on Evolutionary Computation.   IEEE, 2008, pp. 1110–1116.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Maojiang Tian (2 papers)
  2. Minyang Chen (2 papers)
  3. Wei Du (124 papers)
  4. Yang Tang (77 papers)
  5. Yaochu Jin (108 papers)
  6. Gary G. Yen (30 papers)

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now