Parallel Hybrid Trajectory Based Metaheuristics for Real-World Problems

Abstract

Abstract-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 realworld 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.

Models and algorithms for high school timetabling problems

“…On the one hand, the availability of multi-processor machines and appropriate coding schemes make the use of parallel algorithms more accessible than ever. On the other hand, although the literature is abundant in parallel solution methods for similar complex problems (SUBRAMANIAN et al, 2010;BOŻEJKO;PEMPERA;SMUTNICKI, 2013;SÁNCHEZ-ORO et al, 2015;ALBA, 2015), very little attention has been given to the design of parallel methods for the HSTP. The reader is referred to Section 4.1 for a closer look at these contributions .…”

“…They may also start with the same solution seed or from different ones. Luque and Alba (2015) state that parallel strategies for trajectory-based methods have been less studied than for population-based ones. For HSTP, we have found only three studies related to parallel metaheuristics.…”