A Parallel MOEA with Criterion-based Selection Applied to the Knapsack Problem
In this paper, we propose a parallel multiobjective evolutionary algorithm called Parallel Criterion-based Partitioning MOEA (PCPMOEA), with an application to the Mutliobjective Knapsack Problem (MOKP). The suggested search strategy is based on a periodic partitioning of potentially efficient solutions, which are distributed to multiple multiobjective evolutionary algorithms (MOEAs). Each MOEA is dedicated to a sole objective, in which it combines both criterion-based and dominance-based approaches. The suggested algorithm addresses two main sub-objectives: minimizing the distance between the current non-dominated solutions and the ideal point, and ensuring the spread of the potentially efficient solutions. Experimental results are included, where we assess the performance of the suggested algorithm against the above mentioned sub-objectives, compared with state-of-the-art results using well-known multi-objective metaheuristics.
Code (0)
등록된 구현이 없습니다.
Tasks
Evolutionary AlgorithmsSimilar Papers 제목 키워드 기반
Non-Elitist Evolutionary Multi-Objective Optimisation: Proof-of-Principle Results
Elitism, which constructs the new population by preserving best solutions out of the old population and newly-generated solutions, has been a default way for population update since its introduction into multi-objective …
DiversityEvolutionary AlgorithmsUsing 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem
Real-world optimization problems often involve stochastic and dynamic components. Evolutionary algorithms are particularly effective in these scenarios, as they can easily adapt to uncertain and changing environments but…
Evolutionary AlgorithmsOn the Use of Bi-Objective Evolutionary Algorithms for the Stochastic MKP under Dynamic Constraints
The multiple knapsack problem (MKP) generalizes the classical knapsack problem by assigning items to multiple knapsacks subject to capacity constraints. It is used to model many real-world resource allocation and schedul…
Decomposition Multi-Objective Evolutionary Optimization: From State-of-the-Art to Future Opportunities
Decomposition has been the mainstream approach in the classic mathematical programming for multi-objective optimization and multi-criterion decision-making. However, it was not properly studied in the context of evolutio…
Decision MakingA Survey of Decomposition-Based Evolutionary Multi-Objective Optimization: Part I-Past and Future
Decomposition has been the mainstream approach in classic mathematical programming for multi-objective optimization and multi-criterion decision-making. However, it was not properly studied in the context of evolutionary…
Decision MakingSurvey