Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
type: Item
instance of: scholarly article
title: Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
zbMATH Open document ID: 1465.90087
author: Panagiotis Kalatzantonakis
author: Angelo Sifaleras
author: Nikolaos Samaras
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7340731
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: parallel computing
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: self-adaptive mechanism
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10898-019-00866-y
OpenAlex ID: W2994782896
cites work: A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems
cites work: Exact algorithms for routing problems under vehicle capacity constraints
cites work: Q3048611
cites work: Q3523238
cites work: Parallel Solution Methods for Vehicle Routing Problems
cites work: Parallel Metaheuristics Applications
cites work: Toward a Taxonomy of Parallel Tabu Search Heuristics
cites work: The truck dispatching problem
cites work: MPI parallelization of variable neighborhood search
cites work: Q4955265
cites work: A parallel algorithm for the vehicle routing problem
cites work: Variable neighborhood search: basics and variants
cites work: Q3751354
cites work: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
cites work: Very large-scale vehicle routing: new test problems, algorithms, and results
cites work: Variable neighborhood search
cites work: Parallel Variable Neighborhood Search
cites work: A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
cites work: Preface to the Special Issue on Matheuristics and Metaheuristics
cites work: Open problems in green supply chain modeling and optimization with carbon emission targets
cites work: Parallel iterative search methods for vehicle routing problems
cites work: The vehicle routing problem
cites work: New benchmark instances for the capacitated vehicle routing problem
DOI: 10.1007/S10898-019-00866-Y
Recommended article: A cooperative parallel metaheuristic for the capacitated vehicle routing problem
Recommended article: A variable neighborhood search algorithm for the capacitated vehicle routing problem
Recommended article: A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
Recommended article: Variable neighborhood search for the stochastic and dynamic vehicle routing problem
Recommended article: A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
description: scientific article; zbMATH DE number 7340731