MPI Parallelization of Variable Neighborhood Search
From MaRDI portal
Publication:2840781
DOI10.1016/j.endm.2012.10.032zbMath1268.68150OpenAlexW2056059863MaRDI QIDQ2840781
Teodor Gabriel Crainic, Tatjana Davidović
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.032
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain ⋮ Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems ⋮ A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Variable neighborhood search: basics and variants ⋮ Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem ⋮ Variable neighborhood search for graphical model energy minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Multiprocessor scheduling with communication delays
- Variable neighborhood search
- The parallel variable neighborhood search for the \(p\)-median problem
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
- Parallel variable neighbourhood search algorithms for job shop scheduling problems
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
