Adaptive Metaheuristic Selection in Island-Based Optimization

The optimization of complex problems remains a significant challenge across various domains of science and engineering. This paper introduces a novel approach to island-based optimization that dynamically adapts metaheuristic selection during runtime, extending the Diversity-driven Cooperating Portfolio of Metaheuristics (DdCPM) framework. Our method integrates additional metaheuristics beyond the original implementation and proposes adaptation strategies that dynamically reconfigure the algorithm portfolio based on performance indicators and population characteristics. Experimental results across both discrete and continuous optimization benchmarks demonstrate that adaptive metaheuristic selection enhances solution quality and convergence rates compared to static approaches. The proposed framework represents an advancement in hybrid optimization systems, offering improved performance through intelligent adaptation mechanisms that correspond to the evolving state of the search process.

Authors

Institutions

Publication Details

Journal
Procedia Computer Science
Published
2025-01-01
DOI
https://doi.org/10.1016/j.procs.2025.09.233
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Metaheuristic Selection in Island-Based Optimization

Jacek Mańdziuk, Adam Żychowski, Xin Yao
Procedia Computer Science
Metaheuristic Optimization Algorithms Research
article

Adaptive Metaheuristic Selection in Island-Based Optimization

Jacek Mańdziuk, Adam Żychowski, Xin Yao
article en

Abstract

The optimization of complex problems remains a significant challenge across various domains of science and engineering. This paper introduces a novel approach to island-based optimization that dynamically adapts metaheuristic selection during runtime, extending the Diversity-driven Cooperating Portfolio of Metaheuristics (DdCPM) framework. Our method integrates additional metaheuristics beyond the original implementation and proposes adaptation strategies that dynamically reconfigure the algorithm portfolio based on performance indicators and population characteristics. Experimental results across both discrete and continuous optimization benchmarks demonstrate that adaptive metaheuristic selection enhances solution quality and convergence rates compared to static approaches. The proposed framework represents an advancement in hybrid optimization systems, offering improved performance through intelligent adaptation mechanisms that correspond to the evolving state of the search process.

Procedia Computer ScienceVol. 270
Warsaw University of Technology (PL), Lingnan University (HK), AGH University of Krakow (PL)
Openalex Percentile: Top 83%
Metaheuristic Optimization Algorithms Research
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.