IDEAS home Printed from https://ideas.repec.org/p/hhb/aarbls/2008-002.html
   My bibliography  Save this paper

The Pyramidal Capacitated Vehicle Routing Problem

Author

Listed:
  • Lysgaard, Jens

    (Department of Business Studies, Aarhus School of Business)

Abstract

This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal route is de ned as a route on which the vehicle rst visits customers in increasing order of customer index, and on the remaining part of the route visits customers in decreasing order of customer index. Provided that customers are indexed in nondecreasing order of distance from the depot, the shape of a pyramidal route is such that its traversal can be divided in two parts, where on the rst part of the route, customers are visited in nondecreasing distance from the depot, and on the remaining part of the route, customers are visited in nonincreasing distance from the depot. Such a route shape is indeed found in many optimal solutions to CVRP instances. An optimal solution to the PCVRP may therefore be useful in itself as a heuristic solution to the CVRP. Further, an attempt can be made to nd an even better CVRP solution by solving a TSP, possibly leading to a non-pyramidal route, for each of the routes in the PCVRP solution. This paper develops an exact branch-and-cut-and-price (BCP) algorithm for the PCVRP. At the pricing stage, elementary routes can be computed in pseudo-polynomial time in the PCVRP, unlike in the CVRP. We have therefore implemented pricing algorithms that generate only elementary routes. Computational results suggest that PCVRP solutions are highly useful for obtaining near-optimal solutions to the CVRP. Moreover, pricing of pyramidal routes may due to its eciency prove to be very useful in column generation for the CVRP.

Suggested Citation

  • Lysgaard, Jens, 2008. "The Pyramidal Capacitated Vehicle Routing Problem," CORAL Working Papers L-2008-02, University of Aarhus, Aarhus School of Business, Department of Business Studies.
  • Handle: RePEc:hhb:aarbls:2008-002
    as

    Download full text from publisher

    File URL: http://www.hha.dk/bs/wp/log/L_2008_02.pdf
    Download Restriction: no

    More about this item

    Keywords

    vehicle routing; pyramidal traveling salesman; branch-and-cut-and-price;

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hhb:aarbls:2008-002. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Helle Vinbaek Stenholt). General contact details of provider: http://edirc.repec.org/data/ifhhadk.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.