A vehicle routing problem with flexible time windows

D. Tas, O. Jabali, T. Woensel, van

Research output: Book/ReportReportAcademic

90 Downloads (Pure)

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.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages26
Publication statusPublished - 2013

Publication series

NameBETA publicatie : working papers
Volume403
ISSN (Print)1386-9213

Fingerprint

Vehicle routing
Tabu search
Costs
Scheduling

Cite this

Tas, D., Jabali, O., & Woensel, van, T. (2013). A vehicle routing problem with flexible time windows. (BETA publicatie : working papers; Vol. 403). Eindhoven: Technische Universiteit Eindhoven.
Tas, D. ; Jabali, O. ; Woensel, van, T. / A vehicle routing problem with flexible time windows. Eindhoven : Technische Universiteit Eindhoven, 2013. 26 p. (BETA publicatie : working papers).
@book{8826a11fd7fb4d60810fece6634e757e,
title = "A vehicle routing problem with flexible time windows",
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.",
author = "D. Tas and O. Jabali and {Woensel, van}, T.",
year = "2013",
language = "English",
series = "BETA publicatie : working papers",
publisher = "Technische Universiteit Eindhoven",

}

Tas, D, Jabali, O & Woensel, van, T 2013, A vehicle routing problem with flexible time windows. BETA publicatie : working papers, vol. 403, Technische Universiteit Eindhoven, Eindhoven.

A vehicle routing problem with flexible time windows. / Tas, D.; Jabali, O.; Woensel, van, T.

Eindhoven : Technische Universiteit Eindhoven, 2013. 26 p. (BETA publicatie : working papers; Vol. 403).

Research output: Book/ReportReportAcademic

TY - BOOK

T1 - A vehicle routing problem with flexible time windows

AU - Tas, D.

AU - Jabali, O.

AU - Woensel, van, T.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

M3 - Report

T3 - BETA publicatie : working papers

BT - A vehicle routing problem with flexible time windows

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -

Tas D, Jabali O, Woensel, van T. A vehicle routing problem with flexible time windows. Eindhoven: Technische Universiteit Eindhoven, 2013. 26 p. (BETA publicatie : working papers).