paper-with-me

Papers

A New Repair Operator for Multi-objective Evolutionary Algorithm in Constrained Optimization Problems

2015-04-01 · Zhun Fan, Wenji Li, Xinye Cai, Huibiao Lin, Shuxiang Xie, Erik Goodman

In this paper, we design a set of multi-objective constrained optimization problems (MCOPs) and propose a new repair operator to address them. The proposed repair operator is used to fix the solutions that violate the box constraints. More specifically, it employs a reversed correction strategy that can effectively avoid the population falling into local optimum. In addition, we integrate the proposed repair operator into two classical multi-objective evolutionary algorithms MOEA/D and NSGA-II. The proposed repair operator is compared with other two kinds of commonly used repair operators on benchmark problems CTPs and MCOPs. The experiment results demonstrate that our proposed approach is very effective in terms of convergence and diversity.

📄 PDF Abstract BibTeX arXiv:1504.00154

Code (0)

등록된 구현이 없습니다.

Tasks

DiversityEvolutionary Algorithms

Similar Papers 제목 키워드 기반

Enhanced Innovized Repair Operator for Evolutionary Multi- and Many-objective Optimization

2020-11-21 · Sukrit Mittal, Dhish Kumar Saxena, Kalyanmoy Deb, Erik Goodman

"Innovization" is a task of learning common relationships among some or all of the Pareto-optimal (PO) solutions in multi- and many-objective optimization problems. Recent studies have shown that a chronological sequence…

Large-Scale Portfolio Optimization Problem Under Cardinality Constraint With Enhanced Multi-Objective Evolutionary Algorithms

2026-07-10 · Danial Ramezani, Mostafa Abouei Ardakan arxiv

Decision-making is posing an increasingly formidable challenge to investors because of the growing number of alternatives available in financial markets. A hot area of research over the past few decades has been portfoli…

Portfolio Optimization

Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem

2020-04-07 · Yue Xie, Aneta Neumann, Frank Neumann

The chance-constrained knapsack problem is a variant of the classical knapsack problem where each item has a weight distribution instead of a deterministic weight. The objective is to maximize the total profit of the sel…

Evolutionary Algorithms

R2 Indicator and Deep Reinforcement Learning Enhanced Adaptive Multi-Objective Evolutionary Algorithm

2024-04-11 · Farajollah Tahernezhad-Javazm, Debbie Rankin, Naomi Du Bois, Alice E. Smith 외

Choosing an appropriate optimization algorithm is essential to achieving success in optimization challenges. Here we present a new evolutionary algorithm structure that utilizes a reinforcement learning-based agent aimed…

Deep Reinforcement Learningreinforcement-learningReinforcement Learning

A new dual-population constrained multi-objective evolutionary optimization algorithm with repair constraint handling for structural optimization

2026-07-14 · Fardad Homafar, Jasmin Jelovica arxiv

Structural optimization problems often involve a large number of decision variables and highly non-convex feasible regions, making convergence to the true Pareto front extremely challenging. Even when convergence is achi…