A branch-and-regret algorithm for the same-day delivery problem

We study a dynamic vehicle routing problem where stochastic customers request urgent deliveries characterized by restricted time windows. The aim is to use a fleet of vehicles to maximize the number of served requests and minimize the traveled distance. The problem is known in the literature as the...

Full description

Saved in:
Bibliographic Details
Published inTransportation research. Part E, Logistics and transportation review Vol. 177; p. 103226
Main Authors Côté, Jean-François, Alves de Queiroz, Thiago, Gallesi, Francesco, Iori, Manuel
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.09.2023
Subjects
Online AccessGet full text
ISSN1366-5545
1878-5794
1878-5794
DOI10.1016/j.tre.2023.103226

Cover

More Information
Summary:We study a dynamic vehicle routing problem where stochastic customers request urgent deliveries characterized by restricted time windows. The aim is to use a fleet of vehicles to maximize the number of served requests and minimize the traveled distance. The problem is known in the literature as the same-day delivery problem, and it is of high importance because it models a number of real-world applications, including the delivery of online purchases. We solve the same-day delivery problem by proposing a novel branch-and-regret algorithm in which sampled scenarios are used to anticipate future events and an adaptive large neighborhood search is iteratively invoked to optimize routing plans. The branch-and-regret is equipped with four innovation elements: a new way to model the subproblem, a new policy to generate scenarios, new consensus functions, and a new branching scheme Extensive computational experiments on a large variety of instances prove the outstanding performance of the branch-and-regret, also in comparison with recent literature, in terms of served requests, traveled distance, and computational effort. •We study the same-day delivery problem.•Stochastic customers request urgent deliveries within restricted time windows.•We propose a novel branch-and-regret algorithm.•Sampled scenarios are used to anticipate future events.•Computational experiments prove the outstanding performance of the branch-and-regret.
ISSN:1366-5545
1878-5794
1878-5794
DOI:10.1016/j.tre.2023.103226