Abstract

Balancing exploration and exploitation is a crucial issue in evolutionary global optimization. This paper proposes a decomposition-based dynamic multi-objective evolutionary algorithm for addressing global optimization problems. In the proposed method, the niche count function is regarded as a helper objective to maintain the population diversity, which converts a global optimization problem to a multi-objective optimization problem (MOP). The niche-count value is controlled by the niche radius. In the early stage of evolution, a large niche radius promotes the population diversity for better exploration; in the later stage of evolution, a niche radius close to 0 focuses on convergence for better exploitation. Through the whole evolution process, the niche radius is dynamically decreased from a large value to zero, which can provide a sound balance between the exploration and exploitation. Experimental results on CEC 2014 benchmark problems reveal that the proposed algorithm is capable of offering high-quality solutions, in comparison with four state-of-the-art algorithms.

Highlights

  • In most science, business, and engineering fields, global optimization problems often arise with the purpose of locating the global optimum

  • WORK In this paper, a decomposition-based dynamic bi-objective evolutionary algorithm integrated into the framework of multi-objective EAs (MOEAs)/D-M2M, called DMOEA/D-M2M, is proposed to deal with complex global optimization problems

  • The proposed DMOEA/D-M2M decomposes the transformed bi-objective optimization problem into a number of bi-objective optimization subproblems which are easy to solve, and these simple bi-objective subproblems are handled in a collaborative way

Read more

Summary

Introduction

Business, and engineering fields, global optimization problems often arise with the purpose of locating the global optimum. Many approaches have been proposed to deal with global optimization problems. When the objective of global optimization problems is nonlinear, non-convex or non-differentiable, traditional mathematical approaches may become inefficient, or even fail to work. Evolutionary algorithm (EA) is a kind of population based iterative heuristic optimization paradigm. Over the last two decades, EAs have been widely studied and applied for many scientific and real-world optimization problems with promising results (Del, Osaba, & Molina, 2019). The basic EAs are easy to fall into some local optima when tackling complicated global optimization problems with a large number of local optima.

Results
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.