Towards Autonomous Bound Constraint Handling: Study on an Adaptive Correction in Differential Evolution

This research focuses on the development of adaptive bound constraint handling methods (BCHMs) operator for the Differential Evolution (DE) algorithm in the context of real-valued optimization over bounded feasible domains. The mutation operator involved in DE can generate infeasible solutions that exceed their predefined feasible bounds, necessitating corrective measures. Traditional BCHMs either adjust out-of-bound components individually (component-wise) or revise the entire solution vector (vector-wise) to ensure feasibility. However, the behavior of BCHMs can vary significantly across different fitness landscapes, making it challenging to determine the most suitable approach in a general setting. Drawing from empirical observations on benchmark functions exhibiting non-monotonic infeasibility probability trends, this study argues for the development of adaptive correction operators that can dynamically adjust their behavior based on the problem characteristics.

Authors

Institutions

Publication Details

Published
2024-09-04
DOI
https://doi.org/10.1109/inista62901.2024.10683842
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Towards Autonomous Bound Constraint Handling: Study on an Adaptive Correction in Differential Evolution

Mitran Mădălina-Andreea
Scheduling and Optimization Algorithms
article

Towards Autonomous Bound Constraint Handling: Study on an Adaptive Correction in Differential Evolution

Mitran Mădălina-Andreea
article en

Abstract

This research focuses on the development of adaptive bound constraint handling methods (BCHMs) operator for the Differential Evolution (DE) algorithm in the context of real-valued optimization over bounded feasible domains. The mutation operator involved in DE can generate infeasible solutions that exceed their predefined feasible bounds, necessitating corrective measures. Traditional BCHMs either adjust out-of-bound components individually (component-wise) or revise the entire solution vector (vector-wise) to ensure feasibility. However, the behavior of BCHMs can vary significantly across different fitness landscapes, making it challenging to determine the most suitable approach in a general setting. Drawing from empirical observations on benchmark functions exhibiting non-monotonic infeasibility probability trends, this study argues for the development of adaptive correction operators that can dynamically adjust their behavior based on the problem characteristics.

Vol. 12269
West University of Timişoara (RO)
Climate action
Openalex Percentile: Top 78%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Towards Autonomous Bound Constraint Handling: Study on an Adaptive Correction in Differential Evolution — Mitran Mădălina-Andreea · (2024) | TGRS Research Map | TGRS