A hybrid Tabu search – Variable neighborhood descent algorithm for the cumulative capacitated vehicle routing problem with time windows in humanitarian applications

[Display omitted] •A humanitarian vehicle routing problem with time windows.•Novel approach with pre-speciefied number of available vehicles.•Solved with a Hybrid Tabu Search metaheuristic algorithm.•Solutions for the new approach are presented.•Two new best solutions found for the non- time windowe...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & industrial engineering Vol. 164; p. 107868
Main Authors:	Kyriakakis, Nikolaos A., Sevastopoulos, Ioannis, Marinaki, Magdalene, Marinakis, Yannis
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01-02-2022
Subjects:	Cumulative Capacitated Vehicle Routing Problem Humanitarian Supply Chain Management Path Relinking Tabu Search Path Relinking Tabu Search Cumulative Capacitated Vehicle Routing Problem Humanitarian Supply Chain Management
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	[Display omitted] •A humanitarian vehicle routing problem with time windows.•Novel approach with pre-speciefied number of available vehicles.•Solved with a Hybrid Tabu Search metaheuristic algorithm.•Solutions for the new approach are presented.•Two new best solutions found for the non- time windowed variant. The paper presents a Hybrid Tabu Search - Variable Neighborhood Descent (HTS-VND) metaheuristic algorithm for the Cumulative Capacitated Vehicle Routing Problem with Time Windows (CCVRPTW). The algorithm is also used to solve the Cumulative Capacitated Vehicle Routing Problem (CCVRP) without the time widow constraints. Its effectiveness is tested against well known benchmark instances from the literature and the results are compared with the results of other state-of-the-art approaches. The proposed metaheuristic was able to find new best known solutions in two instances of the CCVRP. For the CCVRPTW, two additional algorithms, a Tabu Search algorithm and a Variable Neighborhood Descent algorithm, were implemented to provide benchmark values for results obtained with HTS-VND. Overall, on the 92 CCVRP instances tested, the best known solutions were reached in 84 of them. For the CCVRPTW, 56 instances were tested and the proposed HTS-VND obtained better results than the two pure implementations, reaching the instance specified number of vehicles in 41 of them. The paper also provides solution cost values for the CCVRPTW, which are not included in approaches in the literature.
ISSN:	0360-8352 1879-0550
DOI:	10.1016/j.cie.2021.107868