EC for Large-Scale Optimization: Methods and Real-World Optimization Problems
摘要
This chapter explores Large-Scale Optimization Problems (LSOPs), characterized by high-dimensional search spaces, complex constraints, and nonlinear interactions, making traditional Evolutionary Computation (EC) algorithms inefficient due to the curse of dimensionality. To address these challenges, the chapter introduces Cooperative Coevolution (CC), which decomposes LSOPs into smaller subproblems, and various grouping strategies such as Differential Grouping (DG), Recursive Differential Grouping (RDG), and Extended Recursive Differential Grouping (ERDG) for handling variable interactions. Non-grouping methods like Competitive Swarm Optimization (CSO) and multiple population differential evolution (mDE-brM) are considered alternatives for maintaining search diversity in high-dimensional spaces. Real-world applications, including the Large-Scale Traveling Salesman Problem (LSTSP) and Feature Selection in Machine Learning, demonstrate the practical significance of LSOPs in logistics, AI, and smart systems. By integrating evolutionary strategies, hybrid approaches, and problem decomposition, this chapter provides an effective framework for solving LSOPs, supporting advancements in AI-driven optimization, intelligent decision-making, and green energy systems.