Experimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms
원문 초록
In this paper we systematically study the importance, i.e., the influence on performance, of the main design elements that differentiate scalarizing functions-based multiobjective evolutionary algorithms (MOEAs). This class of MOEAs includes Multiobjecitve Genetic Local Search (MOGLS) and Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D) and proved to be very successful in multiple computational experiments and practical applications. The two algorithms share the same common structure and differ only in two main aspects. Using three different multiobjective combinatorial optimization problems, i.e., the multiobjective symmetric traveling salesperson problem, the traveling salesperson problem with profits, and the multiobjective set covering problem, we show that the main differentiating design element is the mechanism for parent selection, while the selection of weight vectors, either random or uniformly distributed, is practically negligible if the number of uniform weight vectors is sufficiently large.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence Model
Synergizing Reinforcement Learning and Genetic Algorithms for Neural Combinatorial Optimization
Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization
Pareto Optimization with Robust Evaluation for Noisy Subset Selection
Selection of Filters for Photonic Crystal Spectrometer Using Domain-Aware Evolutionary Algorithms
토론
이 논문과 연결된 포럼 글이 아직 없습니다.