A Many-Objective Evolutionary Algorithm With Two Interacting Processes: Cascade Clustering and Reference Point Incremental Learning
Researches have shown difficulties in obtaining proximity while maintaining diversity for many-objective optimization problems. Complexities of the true Pareto front pose challenges for the reference vector-based algorithms for their insufficient adaptability to the diverse characteristics with no priori. This paper proposes a many-objective optimization algorithm with two interacting processes: cascade clustering and reference point incremental learning (CLIA). In the population selection process based on cascade clustering (CC), using the reference vectors provided by the process based on incremental learning, the nondominated and the dominated individuals are clustered and sorted with different manners in a cascade style and are selected by round-robin for better proximity and diversity. In the reference vector adaptation process based on reference point incremental learning, using the feedbacks from the process based on CC, proper distribution of reference points is gradually obtained by incremental learning. Experimental studies on several benchmark problems show that CLIA is competitive compared with the state-of-the-art algorithms and has impressive efficiency and versatility using only the interactions between the two processes without incurring extra evaluations.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDiversityIncremental LearningSimilar Papers 제목 키워드 기반
A New Many-Objective Evolutionary Algorithm Based on Determinantal Point Processes
To handle different types of Many-Objective Optimization Problems (MaOPs), Many-Objective Evolutionary Algorithms (MaOEAs) need to simultaneously maintain convergence and population diversity in the high-dimensional obje…
DiversityEvolutionary AlgorithmsPoint ProcessesA Reference Vector based Many-Objective Evolutionary Algorithm with Feasibility-aware Adaptation
The infeasible parts of the objective space in difficult many-objective optimization problems cause trouble for evolutionary algorithms. This paper proposes a reference vector based algorithm which uses two interacting e…
Evolutionary AlgorithmsEvolutionary Reinforcement Learning for Sample-Efficient Multiagent Coordination
Many cooperative multiagent reinforcement learning environments provide agents with a sparse team-based reward, as well as a dense agent-specific reward that incentivizes learning basic skills. Training policies solely o…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Optimizing Multiagent Cooperation via Policy Evolution and Shared Experiences
Many cooperative multiagent reinforcement learning environments provide agents with a sparse team-based reward, as well as a dense agent-specific reward that incentivizes learning basic skills. Training policies solely o…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Visualising Evolution History in Multi- and Many-Objective Optimisation
Evolutionary algorithms are widely used to solve optimisation problems. However, challenges of transparency arise in both visualising the processes of an optimiser operating through a problem and understanding the proble…
Evolutionary Algorithms