2026-05-28T19:58:04Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/102302026-02-03T11:55:53Zcom_10630_2254col_10630_37959

00925njm 22002777a 4500 dc Luque-Polo, Gabriel Jesús author Alba-Torres, Enrique author 2015-09-10 This paper proposes a novel algorithm combining path relinking with a set of cooperating trajectory based parallel algorithms to yield a new metaheuristic of enhanced search features. Algorithms based on the exploration of the neighborhood of a single solution, like simulated annealing (SA), have offered accurate results for a large number of real-world problems in the past. Because of their trajectory based nature, some advanced models such as the cooperative one are competitive in academic problems, but still show many limitations in addressing large scale instances. In addition, the field of parallel models for trajectory methods has not deeply been studied yet (at least in comparison with parallel population based models). In this work, we propose a new hybrid algorithm which improves cooperative single solution techniques by using path relinking, allowing both to reduce the global execution time and to improve the efficacy of the method. We applied here this new model using a large benchmark of instances of two real-world NP-hard problems: DNA fragment assembly and QAP problems, with competitive results. http://hdl.handle.net/10630/10230 http://orcid.org/0000-0001-7909-1416 Algoritmos computacionales Parallel Hybrid Trajectory Based Metaheuristics for Real-World Problems