The VRP with Time-Window Constraints

David Simchi-Levi, Xin Chen, Julien Bramel

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In many distribution systems, in addition to the load that has to be delivered to it, each customer specifies a period of time, called a time window, in which this delivery must occur. The objective is to find a set of routes for the vehicles, where each route begins and ends at the depot, that serves a subset of the customers without violating the vehicle capacity and time-window constraints, while minimizing the total length of the routes. We call this model the vehicle routing problem with time windows (VRPTW).

Original languageEnglish (US)
Title of host publicationSpringer Series in Operations Research and Financial Engineering
PublisherSpringer Nature
Pages341-357
Number of pages17
DOIs
StatePublished - 2014

Publication series

NameSpringer Series in Operations Research and Financial Engineering
ISSN (Print)1431-8598
ISSN (Electronic)2197-1773

Keywords

  • Customer Location
  • Feasible Solution
  • Schedule Problem
  • Vehicle Capacity
  • Vehicle Rout Problem With Time Window

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computational Mathematics
  • Control and Optimization
  • Information Systems and Management
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'The VRP with Time-Window Constraints'. Together they form a unique fingerprint.

Cite this