CORAL Working Papers,
University of Aarhus, Aarhus School of Business, Department of Business Studies

Abstract: This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing

Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived

from precedence constraints in the Asymmetric Traveling Salesman Problem with Time

Windows and to k-path cuts for the VRPTW. In particular, any reachability cut dominates

one or more k-path cuts. The paper presents separation procedures for reachability cuts

and reports computational experiments on well-known VRPTW instances. The computational

results suggest that reachability cuts can be highly useful as cutting planes for certain

VRPTW instances.

Keywords: Routing; time windows; precedence constraints

20 pages, April 25, 2004

Full text files

L_2004_01.pdf  

Download statistics

• University of Aarhus, Aarhus School of Business, Department of Business Studies
• Home page for this series

Questions (including download problems) about the papers in this series should be directed to Helle Vinbaek Stenholt ()
Report other problems with accessing this service to Sune Karlsson ().

RePEc:hhb:aarbls:2004-001This page generated on 2024-09-13 22:18:12.