A surrogate-assisted memetic algorithm for permutation-based combinatorial optimization problems
-
This is an open-source code of the Gradient Boosting Decision Tree-assisted Memetic Algorithm (GBDTMA) implemented by MATLAB.
-
All codes of GBDTMA are our originals and implemented to run on PlatEMO.
-
Codes of Quadratic Assignment Problems (QAPs) are based on the QAPLIB library [1] and Taillard's webpage but modified for the PlatEMO environment.
[1] R. E. Burkard, S. E. Karisch, F. Rendl, QAPLIB–A Quadratic Assignment Problem Library, J. Global Optim., vol. 10, pp. 391–403, 1997.
-
Download all the files of GBDTMA and PlatEMO.
-
Add the
GBDTMA
directory in this repository to theAlgorithms/Single-objective optimization
directory. -
Add the
QAP
directory in this repository to theProblems/Single-objective optimization
directory. -
Run
platemo.m
and select GBDTMA. See the documents of PlatEMO for more details.
The copyright of the GBDTMA codes belongs to the authors in the Evolutionary Intelligence Research Group (Nakata Lab) at Yokohama National University, Corporate Research and Development Division at IHI Corporation, and the Computational Intelligence Laboratory at Muroran Institute of Technology, Japan. You are free to use this code for research purposes. Please refer to the following article;
Takashi Ikeguchi, Kei Nishihara, Yo Kawauchi, Yuji Koguma, and Masaya Nakata, “A surrogate-assisted memetic algorithm for permutation-based combinatorial optimization problems", Swarm and Evolutionary Computation, vol. 98, p. 102060 (15 pages), Oct. 2025.
@article{ikeguchi2025surrogate,
title = "{A surrogate-assisted memetic algorithm for permutation-based combinatorial optimization problems}",
author = "Ikeguchi, Takashi and Nishihara, Kei and Kawauchi, Yo and Koguma, Yuji and Nakata, Masaya",
journal = "Swarm Evol. Comput.",
publisher = "Elsevier",
volume = 98,
pages = 102060,
month = oct,
year = 2025,
doi = "10.1016/j.swevo.2025.102060",
issn = "2210-6502,2210-6510",
language = "en"
}