Parallel local search

10Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Local search metaheuristics are a recognized means of solving hard combinatorial problems. Over the last couple of decades, significant advances have been made in terms of the formalization, applicability and performance of these methods. Key to the performance aspect is the increased availability of parallel hardware, which turns out to be largely exploitable by this class of procedures. As real-life cases of combinatorial optimization easily degrade into intractable territory for exact or approximation algorithms, local search metaheuristics hold undeniable interest. This situation is further compounded by the good adequacy exhibited by this class of search procedures for large-scale parallel operation. In this chapter we explore and discuss ways which lead to parallelization in local search.

Cite

CITATION STYLE

APA

Codognet, P., Munera, D., Diaz, D., & Abreu, S. (2018). Parallel local search. In Handbook of Parallel Constraint Reasoning (pp. 381–417). Springer International Publishing. https://doi.org/10.1007/978-3-319-63516-3_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free