An empirical investigation on parallelization strategies for scatter search

DOI10.1016/j.ejor.2004.08.011zbMath1079.90168OpenAlexW2031179475MaRDI QIDQ2570149

Sebastián Lozano, Santiago García-Carbajal, Belarmino Adenso-Díaz

Publication date: 26 October 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.08.011

zbMATH Keywords

Parallel computingMetaheuristicsKnapsack problemScatter search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches

Uses Software

• SPSS
• Knapsack
• Scatter Search
• MPI/MPICH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A high-performance, portable implementation of the MPI message passing interface standard
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Parallel local search
• Parallel Strategies for Meta-Heuristics

This page was built for publication: An empirical investigation on parallelization strategies for scatter search