IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v42y1994i4p626-642.html
   My bibliography  Save this article

Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees

Author

Listed:
  • Marshall L. Fisher

    (University of Pennsylvania, Philadelphia, Pennsylvania)

Abstract

We consider the problem of optimally scheduling a fleet of K vehicles to make deliveries to n customers subject to vehicle capacity constraints. Given a graph with n + 1 nodes, a K-tree is defined to be a set of n + K edges that span the graph. We show that the vehicle routing problem can be modeled as the problem of finding a minimum cost K-tree with two K edges incident on the depot and subject to some side constraints that impose vehicle capacity and the requirement that each customer be visited exactly once. The side constraints are dualized to obtain a Lagrangian problem that provides lower bounds in a branch-and-bound algorithm. This algorithm has produced proven optimal solutions for a number of difficult problems, including a well-known problem with 100 customers and several real problems with 25–71 customers.

Suggested Citation

  • Marshall L. Fisher, 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees," Operations Research, INFORMS, vol. 42(4), pages 626-642, August.
    • Handle: RePEc:inm:oropre:v:42:y:1994:i:4:p:626-642
    DOI: 10.1287/opre.42.4.626
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.42.4.626
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.42.4.626?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:oropre:v:42:y:1994:i:4:p:626-642. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.