A Novel Population Initialization Method via Adaptive Experience Transfer for General-Purpose Binary Evolutionary Optimization
Authors:
- Zhiyuan WangZWZhiyuan Wang
- Shengcai LiuSLShengcai Liu
- Shaofeng ZhangSZShaofeng Zhang
- Ke TangKTKe Tang
Preprint
Abstract
Evolutionary Algorithms (EAs) are widely used general-purpose optimization methods due to their domain independence. However, under a limited number of function evaluations (#FEs), the performance of EAs is quite sensitive to the quality of the initial population. Obtaining a high-quality initial population without problem-specific knowledge remains a significant challenge. To address this, this work proposes a general-purpose population initialization method, named mixture-of-experience for population initialization (MPI), for binary optimization problems where decision variables take values of 0 or 1. MPI leverages solving experiences from previously solved problems to generate high-quality initial populations for new problems using only a small number of FEs. Its main novelty lies in a general-purpose approach for representing, selecting, and transferring solving experiences without requiring problem-specific knowledge. Extensive experiments are conducted across six binary optimization problem classes, comprising three classic classes and three complex classes from real-world applications. The experience repository is constructed solely based on instances from the three classic classes, while the performance evaluation is performed across all six classes. The results demonstrate that MPI effectively transfers solving experiences to unseen problem classes (i.e., the complex ones) and higher-dimensional problem instances, significantly outperforming existing general-purpose population initialization methods.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Un-evaluated solutions may be valuable in expensive optimizationSwarm and Evolutionary Computation, 2025
- Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and ApplicationsIEEE Transactions on Cybernetics, 2024
- Biased random-key genetic algorithms: A reviewEuropean Journal of Operational Research, 2024
- How Good is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman ProblemIEEE Computational Intelligence Magazine, 2023
- Evolutionary Transfer Optimization - A New Frontier in Evolutionary Computation ResearchIEEE Computational Intelligence Magazine, 2021
- A Fast Dynamic Evolutionary Multiobjective Algorithm via Manifold Transfer LearningIEEE Transactions on Cybernetics, 2020
- Pymoo: Multi-Objective Optimization in PythonIEEE Access, 2020
- On the comparison of initialisation strategies in differential evolution for large scale optimisationOptimization Letters, 2017
- Memes as building blocks: a case study on evolutionary optimization + transfer learning for routing problemsMemetic Computing, 2015
- Memetic Search With Interdomain Learning: A Realization Between CVRP and CARPIEEE Transactions on Evolutionary Computation, 2014