Please use this identifier to cite or link to this item:
Title: Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
Authors: Kalatzantonakis, Panagiotis
Sifaleras, Angelo
Samaras, Nikolaos
Type: Article
Subjects: FRASCATI::Natural sciences::Mathematics::Applied Mathematics
FRASCATI::Natural sciences::Computer and information sciences
Keywords: Variable neighborhood search
Parallel computing
Vehicle routing problem
Self-adaptive mechanism
Issue Date: 12-Dec-2019
Publisher: Springer
Source: Journal of Global Optimization
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.
ISSN: 0925-5001
Other Identifiers: 10.1007/s10898-019-00866-y
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
Cooperative_Vs_non-cooperative_parallel_VNS_strategies_a_case_study_on_the_CVRP.pdf1,37 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.