A Tutorial On the design, experimentation and application of metaheuristic algorithms to real-World optimization problems

Osaba Icedo, Eneko ORCID: https://orcid.org/0000-0001-7863-9910, Villar Rodríguez, Esther ORCID: https://orcid.org/0000-0003-3343-3737, Ser Lorente, Javier del ORCID: https://orcid.org/0000-0002-1260-9775, Nebro Urbaneja, Antonio J., Molina Cabrera, Daniel ORCID: https://orcid.org/0000-0002-4175-2204, LaTorre de la Fuente, Antonio ORCID: https://orcid.org/0000-0002-8718-5735, Suganthan, Ponnuthurai N. ORCID: https://orcid.org/0000-0003-0901-5105, Coello Coello, Carlos A. ORCID: https://orcid.org/0000-0002-8435-680X and Herrera Triguero, Francisco ORCID: https://orcid.org/0000-0002-0183-044X (2021). A Tutorial On the design, experimentation and application of metaheuristic algorithms to real-World optimization problems. "Swarm and Evolutionary Computation", v. 64 ; p. 100888. ISSN 2210-6510. https://doi.org/10.1016/j.swevo.2021.100888.

Descripción

Título: A Tutorial On the design, experimentation and application of metaheuristic algorithms to real-World optimization problems
Autor/es:
Tipo de Documento: Artículo
Título de Revista/Publicación: Swarm and Evolutionary Computation
Fecha: Julio 2021
ISSN: 2210-6510
Volumen: 64
Materias:
ODS:
Palabras Clave Informales: Metaheuristics, Real-world optimization, Good practices, Methodology, Tutorial
Escuela: E.T.S. de Ingenieros Informáticos (UPM)
Departamento: Arquitectura y Tecnología de Sistemas Informáticos
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[thumbnail of 9338908.pdf] PDF (Portable Document Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (891kB)

Resumen

In the last few years, the formulation of real-world optimization problems and their efficient solution via metaheuristic algorithms has been a catalyst for a myriad of research studies. In spite of decades of historical advancements on the design and use of metaheuristics, large difficulties still remain in regards to the understandability, algorithmic design uprightness, and performance verifiability of new technical achievements. A clear example stems from the scarce replicability of works dealing with metaheuristics used for optimization, which is often infeasible due to ambiguity and lack of detail in the presentation of the methods to be reproduced. Additionally, in many cases, there is a questionable statistical significance of their reported results. This work aims at providing the audience with a proposal of good practices which should be embraced when conducting studies about metaheuristics methods used for optimization in order to provide scientific rigor, value and transparency. To this end, we introduce a step by step methodology covering every research phase that should be followed when addressing this scientific field. Specifically, frequently overlooked yet crucial aspects and useful recommendations will be discussed in regards to the formulation of the problem, solution encoding, implementation of search operators, evaluation metrics, design of experiments, and considerations for real-world performance, among others. Finally, we will outline important considerations, challenges, and research directions for the success of newly developed optimization metaheuristics in their deployment and operation over real-world application environments.

Proyectos asociados

Tipo
Código
Acrónimo
Responsable
Título
Gobierno de España
TIN2017-83132-C2-2-R
Sin especificar
Sin especificar
Sin especificar
Gobierno de España
TIN2017-89517-P
Sin especificar
Sin especificar
Sin especificar

Más información

ID de Registro: 84027
Identificador DC: https://oa.upm.es/84027/
Identificador OAI: oai:oa.upm.es:84027
URL Portal Científico: https://portalcientifico.upm.es/es/ipublic/item/9338908
Identificador DOI: 10.1016/j.swevo.2021.100888
URL Oficial: https://www.sciencedirect.com/science/article/pii/...
Depositado por: iMarina Portal Científico
Depositado el: 07 Oct 2024 08:26
Ultima Modificación: 07 Oct 2024 09:06