Deep memetic models for combinatorial optimization problems: application to the tool switching problem
Jhon Edgar Amaya, Carlos Cotta, Antonio J. Fern\'andez-Leiva, Pablo, Garc\'ia-S\'anchez

TL;DR
This paper introduces deep memetic models that leverage multi-level cooperative optimization algorithms to improve solutions for the Tool Switching Problem, demonstrating superior performance over existing metaheuristics.
Contribution
It presents a novel deep meta-cooperative framework for memetic algorithms, analyzing structural parameters and validating its effectiveness on a combinatorial problem.
Findings
Deep models outperform traditional metaheuristics on the Tool Switching Problem.
Structural parameters like communication topology influence model performance.
Deep cooperation enhances solution quality in combinatorial optimization.
Abstract
Memetic algorithms are techniques that orchestrate the interplay between population-based and trajectory-based algorithmic components. In particular, some memetic models can be regarded under this broad interpretation as a group of autonomous basic optimization algorithms that interact among them in a cooperative way in order to deal with a specific optimization problem, aiming to obtain better results than the algorithms that constitute it separately. Going one step beyond this traditional view of cooperative optimization algorithms, this work tackles deep meta-cooperation, namely the use of cooperative optimization algorithms in which some components can in turn be cooperative methods themselves, thus exhibiting a deep algorithmic architecture. The objective of this paper is to demonstrate that such models can be considered as an efficient alternative to other traditional forms of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
