Journal Article10.1016/j.eswa.2023.122164
An information entropy-driven evolutionary algorithm based on reinforcement learning for many-objective optimization
Peng Liang,Yangtao Chen,Ting Huang,Wei Li +3 more
12
TL;DR: This paper proposes RL-RVEA, an information entropy-driven evolutionary algorithm based on reinforcement learning for many-objective optimization with irregular Pareto fronts, leveraging RL to adaptively adjust reference vectors and balance competing objectives.
read more
Abstract: Many-objective optimization problems (MaOPs) are challenging tasks involving optimizing many conflicting objectives simultaneously. Decomposition-based many-objective evolutionary algorithms have effectively maintained a balance between convergence and diversity in recent years. However, these algorithms face challenges in accurately approximating the complex geometric structure of irregular Pareto fronts (PFs). In this paper, an information entropy-driven evolutionary algorithm based on reinforcement learning (RL-RVEA) for many-objective optimization with irregular Pareto fronts is proposed. The proposed algorithm leverages reinforcement learning to guide the evolution process by interacting with the environment to learn the shape and features of PF, which adaptively adjusts the distribution of reference vectors to cover the PFs structure effectively. Moreover, an information entropy-driven adaptive scalarization approach is designed in this paper to reflect the diversity of nondominated solutions, which facilitates the algorithm to balance multiple competing objectives adaptively and select solutions efficiently while maintaining individual diversity. To verify the effectiveness of the proposed algorithm, the RL-RVEA compared with seven state-of-the-art algorithms on the DTLZ, MaF, and WFG test suites and four real-world MaOPs. The results of the experiments demonstrate that the suggested algorithm provides a novel and practical method for addressing MaOPs with irregular PFs.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Dynamic path planning for mobile robots based on artificial potential field enhanced improved multiobjective snake optimization (APF‐IMOSO)
LI Qi-lin,Qihua Ma,Xin Weng +2 more
TL;DR: APF‐IMOSO is a novel path planning algorithm for mobile robots that enhances the original snake optimization algorithm by introducing four key improvements and four fitness functions. It delivers significant improvements in path length, safety, energy consumption, and time efficiency compared to other advanced meta‐heuristics.
5
An efficient Q-learning integrated multi-objective hyper-heuristic approach for hybrid flow shop scheduling problems with lot streaming
Yarong Chen,Jia Yan Du,Jabir Mumtaz,Jingyan Zhong,Mudassar Rauf +4 more
3
A cascading elimination-based evolutionary algorithm with variable classification mutation for many-objective optimization
Wei Zhang,Jianchang Liu,Wanting Yang,Shubin Tan +3 more
TL;DR: This paper proposes CEEA, a many-objective evolutionary algorithm that balances convergence and diversity through a cascading elimination mechanism and variable classification mutation, outperforming peers on various benchmark test suites and real-world applications.
1
A decomposition-based many-objective evolutionary algorithm with Q-learning guide weight vectors update
H. Zhang,Yiru Dai +1 more
1
References
Technical Note : \cal Q -Learning
Chris Watkins,Peter Dayan +1 more
TL;DR: This paper presents and proves in detail a convergence theorem forQ-learning based on that outlined in Watkins (1989), showing that Q-learning converges to the optimum action-values with probability 1 so long as all actions are repeatedly sampled in all states and the action- values are represented discretely.
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Qingfu Zhang,Hui Li +1 more
TL;DR: Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjectives optimization problems.
Performance assessment of multiobjective optimizers: an analysis and review
TL;DR: This study provides a rigorous analysis of the limitations underlying this type of quality assessment in multiobjective evolutionary algorithms and develops a mathematical framework which allows one to classify and discuss existing techniques.
•Journal Article
Simulated Binary Crossover for Continuous Search Space.
TL;DR: A real-coded crossover operator is developed whose search power is similar to that of the single-point crossover used in binary-coded GAs, and SBX is found to be particularly useful in problems having mult ip le optimal solutions with a narrow global basin where the lower and upper bo unds of the global optimum are not known a priori.
3.3K
Scalable Test Problems for Evolutionary Multiobjective Optimization
Kalyanmoy Deb,Lothar Thiele,Marco Laumanns,Eckart Zitzler +3 more
- 01 Jan 2005
TL;DR: In this paper, the authors have suggested three different approaches for systematically designing test problems for multi-objective evolutionary algorithms (MOEAs) with more than two objectives, which can be found useful in various research activities on MOEAs, such as testing the performance of a new MOEA, comparing dierent MOEA, and better understanding of the working principles of MOEA.