RT Journal Article
T1 Heuristics for the robust vehicle routing problem with time windows
A1 Braaten, Simen
A1 Gjønnes, Ola
A1 Hvattum, Lars Magnus
A1 Tirado Domínguez, Gregorio
AB Uncertainty is frequently present in logistics and transportation, where vehicle routing problems play a crucial role. However, due to the complexity inherent in dealing with uncertainty, most research has been devoted to deterministic problems. This paper considers a robust version of the vehicle routing problem with hard time windows, in which travel times are uncertain. A budget polytope uncertainty set describes the travel times, to limit the maximum number of sailing legs that can be delayed. This makes sure that improbable scenarios are not considered, while making sure that solutions are immune to delays on a given number of sailing legs. Existing exact methods are only able to solve small instances of the problem and can be computationally demanding. With the aim of solving large instances with reduced running times, this paper proposes an efficient heuristic based on adaptive large neighborhood search. The computational study performed on instances with different uncertainty levels compares and analyzes the performance of four versions of the heuristic and shows how good quality solutions can be obtained within short computational times.
PB Pergamon-Elsevier Science LTD
SN 0957-4174
YR 2017
FD 2017
LK https://hdl.handle.net/20.500.14352/17798
UL https://hdl.handle.net/20.500.14352/17798
LA eng
NO Ministerio de Ciencia e Innovación (MICINN)
NO Comunidad de Madrid
DS Docta Complutense
RD 23 abr 2025