Universidad Complutense de Madrid
E-Prints Complutense

Heuristics for the robust vehicle routing problem with time windows


Downloads per month over past year




Downloads per month over past year

Braaten, Simen and Gjønnes, Ola and Hvattum, Lars Magnus and Tirado Domínguez, Gregorio (2017) Heuristics for the robust vehicle routing problem with time windows. Expert Systems with Applications, 77 . pp. 136-147. ISSN 0957-4174

[thumbnail of Tirado06.pdf] PDF
Restringido a Repository staff only


Official URL: http://www.sciencedirect.com/science/article/pii/S095741741730057X


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.

Item Type:Article
Uncontrolled Keywords:Robust optimization; Metaheuristic; Uncertainty; Travel time
Subjects:Sciences > Mathematics > Probabilities
ID Code:42648
Deposited On:18 May 2017 11:25
Last Modified:18 May 2017 11:54

Origin of downloads

Repository Staff Only: item control page