This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Reachability cuts for the vehicle routing problem with time windows

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Lysgaard, Jens () (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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.hha.dk/afl/wp/log/L_2004_01.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by University of Aarhus, Aarhus School of Business, Department of Business Studies in its series CORAL Working Papers with number L-2004-01.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 20 pages
Date of creation: 25 Apr 2004
Date of revision:
Handle: RePEc:hhb:aarbls:2004-001

Contact details of provider:
Postal: The Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Fax: + 45 86 15 19 43
Web page: http://www.asb.dk/about/departments/bs.aspx
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Helle Vinbaek Stenholt).

Related research
Keywords: Routing; time windows; precedence constraints;

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

  1. Ahuja, Ravindra K. & Kodialam, Murali & Mishra, Ajay K. & Orlin, James B., 1997. "Computational investigations of maximum flow algorithms," European Journal of Operational Research, Elsevier, vol. 97(3), pages 509-542, March. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? Over 80% of the top 1000 economists are registered on RePEc.

This page was last updated on 2009-11-28.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.