The Time Window Assignment Vehicle Routing Problem

Remy Spliet () and Adriana F. Gabor ()
Additional contact information
Remy Spliet: Econometric Institute, Erasmus University Rotterdam, 3000 DR Rotterdam, Netherlands
Adriana F. Gabor: Econometric Institute, Erasmus University Rotterdam, 3000 DR Rotterdam, Netherlands

Transportation Science, 2015, vol. 49, issue 4, 721-731

Abstract: In this paper we introduce the time window assignment vehicle routing problem (TWAVRP). In this problem, time windows have to be assigned before demand is known. Next, a realization of demand is revealed, and a vehicle routing schedule is made that satisfies the assigned time windows. The objective is to minimize the expected traveling costs. We propose a branch-price-and-cut algorithm to solve the TWAVRP to optimality. We provide results of computational experiments performed using this algorithm. Finally, we offer insight on the value of an exact approach for the TWAVRP by comparing the optimal solution to the solution found by assigning time windows based on solving a vehicle routing problem with time windows with average demand.

Keywords: vehicle routing problem; time window assignment; pricing problem with linear node costs (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (32)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2013.0510 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:49:y:2015:i:4:p:721-731

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().