Paper Info
Title
Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
Abstract
The capacitated vehicle routing problem (CVRP) is a well-known NP-hard combinatorial optimization problem with numerous real-world applications in logistics. In this work, we present a literature review with recent successful parallel implementations of variable neighborhood search regarding different variants of vehicle routing problems. We conduct an experimental study for the CVRP using well-known benchmark instances, and we present and investigate three parallelization strategies that coordinate the communication of the multiple processors. We experimentally evaluate a non-cooperative and two novel cooperation models, the managed cooperative and the parameterized cooperative strategies. Our results constitute a first proof-of-concept for the benefits of this new self-adaptive parameterized cooperative approach, especially in computationally hard instances.
Year
DOI
Venue
2020
10.1007/s10898-019-00866-y
Journal of Global Optimization
Keywords
DocType
Volume
Variable neighborhood search, Parallel computing, Vehicle routing problem, Self-adaptive mechanism
Journal
78
Issue
ISSN
Citations 
2
1573-2916
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Panagiotis Kalatzantonakis100.34
Angelo Sifaleras29816.91
Nikolaos Samaras310515.65