From 01754380f8e66221034ddfed639e81fed50603f9 Mon Sep 17 00:00:00 2001
From: MLopez-Ibanez <2620021+MLopez-Ibanez@users.noreply.github.com>
Date: Fri, 14 Jun 2024 09:02:36 +0100
Subject: [PATCH]  * articles.bib (MarLopStuCol2024auto): New.

---
 articles.bib | 34 ++++++++++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)

diff --git a/articles.bib b/articles.bib
index 7558445..4316ac6 100644
--- a/articles.bib
+++ b/articles.bib
@@ -12277,6 +12277,40 @@ @Article{MarDeBHaeVanSnoBae07
   pages =        {651--665},
 }
 
+@Article{MarLopStuCol2024auto,
+  author       = Martin-Santamaria_R #and# Lopez-Ibanez #and# Stuetzle #and#
+                  Colmenar_JM,
+  title        = {On the automatic generation of metaheuristic algorithms for
+                  combinatorial optimization problems},
+  journal      = ejor,
+  year         = 2024,
+  doi          = {10.1016/j.ejor.2024.06.001},
+  abstract     = {Metaheuristic algorithms have become one of the preferred
+                  approaches for solving optimization problems. Finding the
+                  best metaheuristic for a given problem is often difficult due
+                  to the large number of available approaches and possible
+                  algorithmic designs. Moreover, high-performing metaheuristics
+                  often combine general-purpose and problem-specific
+                  algorithmic components. We propose here an approach for
+                  automatically designing metaheuristics using a flexible
+                  framework of algorithmic components, from which algorithms
+                  are instantiated and evaluated by an automatic configuration
+                  method. The rules for composing algorithmic components are
+                  defined implicitly by the properties of each algorithmic
+                  component, in contrast to previous proposals, which require a
+                  handwritten algorithmic template or grammar. As a result,
+                  extending our framework with additional components, even
+                  problem-specific or user-defined ones, automatically updates
+                  the design space. Furthermore, since the generated algorithms
+                  are made up of components, they can be easily interpreted. We
+                  provide an implementation of our proposal and demonstrate its
+                  benefits by outperforming previous research in three distinct
+                  problems from completely different families: a facility
+                  layout problem, a vehicle routing problem and a clustering
+                  problem.},
+  keywords     = {irace}
+}
+
 @Article{MarMarWeiWol2002,
   title =        {Cutting planes in integer and mixed integer programming},
   author =       {Marchand, Hugues and Martin, Alexander and Weismantel, Robert and Wolsey, Laurence},