A. Casado, S. Pérez-Peló, J. Sánchez-Oro, A. Duarte, M. Laguna
Scatter search(SS) is a well-established metaheuristic for hard combinatorial optimization problems. SS is characterized by its versatility and ease of context adaptation and implementation. Although the literature includes SS parallelization schemes for specific problems, a general parallel framework for Scatter Search has not been developed and tested. We introduce three SS parallel designs, each focusing on a different task, namely, reducing computational time, increasing search exploration, and balancing search intensification and diversification. The proposed designs are tested on problems where the state of the art is a traditional (sequential) SS approach. This testing platform helps us assess the contributions of the parallel computing strategies to solution speed and quality. Our publicly available code is designed to be adapted to optimization problems that are not considered here. The results show promising avenues for establishing a general framework of SS parallelization.
Keywords: Scatter Search, Parallel Design, Metaheuristics
Scheduled
Heuristics and Metaheuristics II
June 10, 2025 5:10 PM
MR 1