Version 1
: Received: 2 June 2022 / Approved: 6 June 2022 / Online: 6 June 2022 (09:08:33 CEST)
How to cite:
El Fahim, H. A Cooperative Parallel Tabu Search Meta-heuristic for the Vehicle Routing Problem with Time Windows. Preprints2022, 2022060074. https://doi.org/10.20944/preprints202206.0074.v1
El Fahim, H. A Cooperative Parallel Tabu Search Meta-heuristic for the Vehicle Routing Problem with Time Windows. Preprints 2022, 2022060074. https://doi.org/10.20944/preprints202206.0074.v1
El Fahim, H. A Cooperative Parallel Tabu Search Meta-heuristic for the Vehicle Routing Problem with Time Windows. Preprints2022, 2022060074. https://doi.org/10.20944/preprints202206.0074.v1
APA Style
El Fahim, H. (2022). A Cooperative Parallel Tabu Search Meta-heuristic for the Vehicle Routing Problem with Time Windows. Preprints. https://doi.org/10.20944/preprints202206.0074.v1
Chicago/Turabian Style
El Fahim, H. 2022 "A Cooperative Parallel Tabu Search Meta-heuristic for the Vehicle Routing Problem with Time Windows" Preprints. https://doi.org/10.20944/preprints202206.0074.v1
Abstract
This paper presents a cooperative parallel tabu search meta-heuristic for the vehicle routing problem with time windows. It is based on the scheme in which several search threads cooperate by asynchronously exchanging information on the best solutions identified. The exchanges are performed through a mechanism called adaptive memory which holds and manages a pool of solutions. This enforces the asynchronous strategy of information exchanges and ensures the independence of the individual search threads. Each of these independent threads implements a tabu search meta-heuristic. Comprehensive computational experiments and comparisons to best known solutions show that the proposed cooperative parallel tabu search algorithm is able to achieve 48 new best solutions on VRPTW benchmark instances.
Computer Science and Mathematics, Applied Mathematics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
