@Article{HernándezTorresCampLuz:2019:EnMuCo,
author = "Hern{\'a}ndez Torres, Reynier and Campos Velho, Haroldo Fraga de
and Luz, Eduardo F. P. da",
affiliation = "{Instituto Nacional de Pesquisas Espaciais (INPE)} and {Instituto
Nacional de Pesquisas Espaciais (INPE)} and {Centro Nacional de
Monitoramento e Alertas de Desastres Naturais (CEMADEN)}",
title = "Enhancement of the multi-particle collision algorithm by
mechanisms derived from the opposition-based optimization",
journal = "Selecciones Matem{\'a}ticas",
year = "2019",
volume = "6",
number = "2",
pages = "156--177",
keywords = "Stochastic algorithm, Metaheuristic, Opposition-Based Learning,
Reflection-Based Learning, Multi-Particle Collision Algorithm,
Algoritmo estocastico, Metaheur ´ ´\ı,,stica, Aprendizaje
basado en oposicion, Aprendizaje basado en refle- ´ xion,
Algoritmo de Colisi ´ on de M ´ ultiples part ´ ´\ı,,culas.",
abstract = "New versions of the metaheuristic Multi-Particle Collision
Algorithm (MPCA) are presented. In order to provide more effective
candidate solutions for an optimization problem, the concept of
opposition and reflection is introduced to improve the capacity to
find a solution in the search space. Four different strategies to
compute the reflected and opposite points are implemented. The
performance of all implementations is evaluated over thirty
objective functions with different complexities, using serial and
parallel versions of the algorithms. RESUMEN: En este trabajo se
presentan nuevas versiones de la metaheur´\ıstica Algoritmo
de Colision de M ´ ultiples Part ´ ´\ıculas (MPCA). Para
proporcionar soluciones candidatas mas efectivas para un problema
de optimizaci ´ on, se introduce ´ el concepto de oposicion y
reflexi ´ on, con el objetivo de mejorar la capacidad de encontrar
una soluci ´ on en el ´ espacio de busqueda. Se implementan cuatro
estrategias diferentes para calcular los puntos reflejados y
opues- ´ tos. El rendimiento de todas las implementaciones se
evalua en m ´ as de treinta funciones objetivo con diferentes ´
complejidades, utilizando versiones en serie y paralelas de los
algoritmos.",
doi = "10.17268/sel.mat.2019.02.03",
url = "http://dx.doi.org/10.17268/sel.mat.2019.02.03",
issn = "2411-1783",
language = "en",
targetfile = "hernandes enhancement.pdf",
urlaccessdate = "19 abr. 2024"
}