Please use this identifier to cite or link to this item:

Title: Parallel Local Search
Authors: Codognet, Philippe
Munera, Danny
Diaz, Daniel
Abreu, Salvador
Editors: Hamadi, Youssef
Sais, Lakhdar
Issue Date: 2018
Publisher: Springer
Abstract: Local search metaheuristics are a recognized means of solving hard com- binatorial 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.
Type: bookPart
Appears in Collections:INF - Publicações - Capítulos de Livros

Files in This Item:

File Description SizeFormat
hpcr17.pdf442.29 kBAdobe PDFView/OpenRestrict Access. You can Request a copy!
FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Dspace Dspace
DSpace Software, version 1.6.2 Copyright © 2002-2008 MIT and Hewlett-Packard - Feedback
UEvora B-On Curriculum DeGois