Experience-Driven Offline Knowledge Learning Framework for Evolutionary Algorithms

Evolutionary algorithms have been used to solve various optimization problems by iteratively refining solutions through the process inspired by natural evolution. To reduce the randomness inherent, multiple trials are often performed on a single problem, producing a wealth of data that may hold valuable optimization insights. However, traditional EAs usually discard this accumulated experience when tackling new optimization tasks. To address this issue, a novel evolutionary computation paradigm, i.e., learning-aided evolutionary optimization, was developed to exploit past optimization knowledge to enhance search efficiency. In this regard, we propose an offline knowledge learning (OKL) framework, consisting of two key phases: (1) extracting knowledge from past successful optimization runs and (2) applying the knowledge to guide the evolutionary search process. Specifically, we employ a neural network as the knowledge model to generate promising offspring during the optimization process. Additionally, an adaptive mechanism is introduced to dynamically control the rate at which the knowledge model is utilized. Experiments are conducted using genetic algorithm (GA) as the backbone optimizer, resulting in the OKL-GA approach. The results demonstrate that the OKL framework can effectively leverage previous optimization knowledge, enabling generation of fitter offspring and significantly improving performance.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/cec65147.2025.11043027
Primary Topic
Evolutionary Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Experience-Driven Offline Knowledge Learning Framework for Evolutionary Algorithms

Chuan-Kang Ting, Yao‐Wen Hsu, J H Tee
Evolutionary Algorithms and Applications
article

Experience-Driven Offline Knowledge Learning Framework for Evolutionary Algorithms

Chuan-Kang Ting, Yao‐Wen Hsu, J H Tee
article en

Abstract

Evolutionary algorithms have been used to solve various optimization problems by iteratively refining solutions through the process inspired by natural evolution. To reduce the randomness inherent, multiple trials are often performed on a single problem, producing a wealth of data that may hold valuable optimization insights. However, traditional EAs usually discard this accumulated experience when tackling new optimization tasks. To address this issue, a novel evolutionary computation paradigm, i.e., learning-aided evolutionary optimization, was developed to exploit past optimization knowledge to enhance search efficiency. In this regard, we propose an offline knowledge learning (OKL) framework, consisting of two key phases: (1) extracting knowledge from past successful optimization runs and (2) applying the knowledge to guide the evolutionary search process. Specifically, we employ a neural network as the knowledge model to generate promising offspring during the optimization process. Additionally, an adaptive mechanism is introduced to dynamically control the rate at which the knowledge model is utilized. Experiments are conducted using genetic algorithm (GA) as the backbone optimizer, resulting in the OKL-GA approach. The results demonstrate that the OKL framework can effectively leverage previous optimization knowledge, enabling generation of fitter offspring and significantly improving performance.

National Tsing Hua University (TW)
National Science and Technology Council
Openalex Percentile: Top 93%
Evolutionary Algorithms and Applications
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.