Local Self-Adaptive Mutation: Enhancing Multi-Objective Optimization through Localized Operator Selection and Parameter Adaptation

This paper tackles the challenge of simultaneously selecting and tuning mutation operators in multi-objective evolutionary optimization. The proposed Local Self-Adaptive Mutation extends the Adaptive Non-dominated Tournament Genetic Algorithm. Unlike global approaches, it selects operators based on effectiveness in specific regions of the objective space. A key innovation is the adaptive mutation probability, replacing predefined values and allowing dynamic adjustment across the Pareto Front. Applied to two real-world problems—Multi-Skill Resource Constrained Project Scheduling and Multi-Stage Resource Allocation. The enhanced method matched or outperformed manually tuned approaches.

Authors

Institutions

Publication Details

Journal
Proceedings of the Genetic and Evolutionary Computation Conference Companion
Published
2025-07-14
DOI
https://doi.org/10.1145/3712255.3726741
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Local Self-Adaptive Mutation: Enhancing Multi-Objective Optimization through Localized Operator Selection and Parameter Adaptation

Michał Antkiewicz
Proceedings of the Genetic and Evolutionary Computation Conference Companion
Advanced Multi-Objective Optimization Algorithms
article

Local Self-Adaptive Mutation: Enhancing Multi-Objective Optimization through Localized Operator Selection and Parameter Adaptation

Michał Antkiewicz
article en

Abstract

This paper tackles the challenge of simultaneously selecting and tuning mutation operators in multi-objective evolutionary optimization. The proposed Local Self-Adaptive Mutation extends the Adaptive Non-dominated Tournament Genetic Algorithm. Unlike global approaches, it selects operators based on effectiveness in specific regions of the objective space. A key innovation is the adaptive mutation probability, replacing predefined values and allowing dynamic adjustment across the Pareto Front. Applied to two real-world problems—Multi-Skill Resource Constrained Project Scheduling and Multi-Stage Resource Allocation. The enhanced method matched or outperformed manually tuned approaches.

Proceedings of the Genetic and Evolutionary Computation Conference Companion
Wrocław University of Science and Technology (PL), AGH University of Krakow (PL)
Climate action
Openalex Percentile: Top 65%
Advanced Multi-Objective 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.