In this paper, we introduce the Vehicle Routing Problem with Flexible Time Windows (VRPFlexTW), in which vehicles are allowed to deviate from customer time windows by a given tolerance. This flexibility enables savings in the operational costs of carriers, since customers may be served before and after the earliest and latest time window bounds, respectively. However, as time window deviations are undesired from a customer service perspective, a penalty proportional to these deviations is accounted for in the objective function. We develop a solution procedure, in which feasible vehicle routes are constructed via a tabu search algorithm. Furthermore, we propose a linear programming model to handle the detailed scheduling of customer visits for given routes. We validate our solution procedure by a number of Vehicle Routing Problem with Time Windows (VRPTW) benchmark instances. We highlight the costs involved in integrating flexibility in time windows and underline the advantages of the VRPFlexTW, when compared to the VRPTW. © 2014 Elsevier Ltd.

A vehicle routing problem with flexible time windows

JABALI, OLA;
2014-01-01

Abstract

In this paper, we introduce the Vehicle Routing Problem with Flexible Time Windows (VRPFlexTW), in which vehicles are allowed to deviate from customer time windows by a given tolerance. This flexibility enables savings in the operational costs of carriers, since customers may be served before and after the earliest and latest time window bounds, respectively. However, as time window deviations are undesired from a customer service perspective, a penalty proportional to these deviations is accounted for in the objective function. We develop a solution procedure, in which feasible vehicle routes are constructed via a tabu search algorithm. Furthermore, we propose a linear programming model to handle the detailed scheduling of customer visits for given routes. We validate our solution procedure by a number of Vehicle Routing Problem with Time Windows (VRPTW) benchmark instances. We highlight the costs involved in integrating flexibility in time windows and underline the advantages of the VRPFlexTW, when compared to the VRPTW. © 2014 Elsevier Ltd.
2014
Flexible time windows, Soft time windows, Time windows, Vehicle routing problems, Computer Science, Management Science and Operations Research, Modeling and Simulation
File in questo prodotto:
File Dimensione Formato  
2014 - A Vehicle Routing Problem with Flexible Time Windows.pdf

Accesso riservato

Descrizione: Articolo principale
: Publisher’s version
Dimensione 566.98 kB
Formato Adobe PDF
566.98 kB Adobe PDF   Visualizza/Apri
A Vehicle Routing Problem with Flexible Time Windows_11311-1003010_Jabali.pdf

accesso aperto

: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 490.71 kB
Formato Adobe PDF
490.71 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1003010
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 69
  • ???jsp.display-item.citation.isi??? 56
social impact