Parallelization strategies for bee colony optimization based on message passing communication protocol
DOI10.1080/02331934.2012.749258zbMath1311.68149OpenAlexW1989847873MaRDI QIDQ2868923
Tatjana Davidović, Milica Šelmić, Dušan Ramljak, Dušan Teodorović, Tatjana Jakšić
Publication date: 19 December 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2012.749258
scheduling problemsmeta-heuristicsswarm intelligenceparallel executiondistributed memory multiprocessors
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation
- Bee colony optimization for scheduling independent tasks to identical processors
- Bee colony optimization for the \(p\)-center problem
- Multi colony ant algorithms
- Parallel local search
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
- Parallel Metaheuristics Applications
- Parallel variable neighbourhood search algorithms for job shop scheduling problems
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Parallelization strategies for bee colony optimization based on message passing communication protocol