Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem

DOI10.1007/S10898-019-00866-YzbMath1465.90087OpenAlexW2994782896MaRDI QIDQ2022213

Panagiotis Kalatzantonakis, Nikolaos Samaras, Angelo Sifaleras

Publication date: 28 April 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-019-00866-y

zbMATH Keywords

parallel computingvehicle routing problemvariable neighborhood searchself-adaptive mechanism

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Variable neighborhood search: the power of change and simplicity ⋮ Preface to the special issue ``ICVNS 2018

Uses Software

• VRP

Cites Work

• Exact algorithms for routing problems under vehicle capacity constraints
• Variable neighborhood search
• A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
• A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems
• Variable neighborhood search: basics and variants
• New benchmark instances for the capacitated vehicle routing problem
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• Open problems in green supply chain modeling and optimization with carbon emission targets
• Very large-scale vehicle routing: new test problems, algorithms, and results
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• MPI Parallelization of Variable Neighborhood Search
• A Parallel Algorithm for the Vehicle Routing Problem
• Parallel Variable Neighborhood Search
• Parallel Metaheuristics Applications
• Parallel Solution Methods for Vehicle Routing Problems
• Parallel iterative search methods for vehicle routing problems
• Toward a Taxonomy of Parallel Tabu Search Heuristics
• Preface to the Special Issue on Matheuristics and Metaheuristics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem