|Authors:||Crainic, Teodor Gabriel
|Title:||Designing parallel meta-heuristic methods||Journal:||Handbook of Research on High Performance and Cloud Computing in Scientific Research and Education||First page:||260||Last page:||280||Issue Date:||31-Mar-2014||ISBN:||978-146665785-4||ISSN:||2327-3453||DOI:||10.4018/978-1-4666-5784-7.ch011||Abstract:||
Meta-heuristics represent powerful tools for addressing hard combinatorial optimization problems. However, real life instances usually cannot be treated efficiently in "reasonable" computing times. Moreover, a major issue in meta-heuristic design and calibration is to provide high performance solutions for a variety of problems. Parallel meta-heuristics aim to address both issues. The objective of this chapter is to present a state-of-the-art survey of the main parallelization ideas and strategies, and to discuss general design principles applicable to all meta-heuristic classes. To achieve this goal, the authors explain various paradigms related to parallel meta-heuristic development, where communications, synchronization, and control aspects are the most relevant. They also discuss implementation issues pointing out the characteristics of shared and distributed memory multiprocessors as target architectures. All these topics are illustrated by the examples from recent literature related to the parallelization of various meta-heuristic methods. Here, the authors focus on Variable Neighborhood Search and Bee Colony Optimization.
|Keywords:||Bee colony optimizations | Combinatorial optimization problems | Distributed-memory multiprocessors | Meta-heuristic methods | Parallelizations | State of the art | Target architectures | Variable neighborhood search||Publisher:||IGI Global|
Show full item record
checked on Feb 2, 2023
checked on Feb 3, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.