> 1. To minimize the delivery cost, zones should be approximately rectangular in shape with a width comparable with [delta]-1/2 and length comparable with C[delta]-1/2. In order to illustrate some numerical methods of approximation, we will first analyze, in considerable detail, the routing of vehicles on an idealized ring-radial network including how one would distort the shape of the zones near the origin and at boundaries. In Part II we will generalize this to other network geometries, and in Part III consider modifications in strategy if the items (people, for example) are valuable. In contrast with presently available computer programs for which the accuracy may decrease with increasing number of points in the region, the methods described here are essentially asymptotic approximations; the more points there are in the region, the more accurate are the results."> > 1. To minimize the delivery cost, zones should be approximately rectangular in shape with a width comparable with [delta]-1/2 and length comparable with C[delta]-1/2. In order to illustrate some numerical methods of approximation, we will first analyze, in considerable detail, the routing of vehicles on an idealized ring-radial network including how one would distort the shape of the zones near the origin and at boundaries. In Part II we will generalize this to other network geometries, and in Part III consider modifications in strategy if the items (people, for example) are valuable. In contrast with presently available computer programs for which the accuracy may decrease with increasing number of points in the region, the methods described here are essentially asymptotic approximations; the more points there are in the region, the more accurate are the results.">
[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v20y1986i5p345-363.html
   My bibliography  Save this article

Design of multiple-vehicle delivery tours--I a ring-radial network

Author

Listed:
  • Newell, Gordon F.
  • Daganzo, Carlos F.
Abstract
Certain aspects of what is commonly described as the "Vehicle Routing Problem" are discussed. We wish to deliver items to a large number of points randomly distributed over some region by means of vehicles, each of which can deliver to only C points. The key to any detailed routing to minimize the cost of delivery (by hand or computer) is first to partition the region into zones in which individual vehicles make deliveries. We assume here that there are many such zones, an average density of points [delta], that the "unit of length" [delta]-1/2 is large compared with the spacing between roads, and C >> 1. To minimize the delivery cost, zones should be approximately rectangular in shape with a width comparable with [delta]-1/2 and length comparable with C[delta]-1/2. In order to illustrate some numerical methods of approximation, we will first analyze, in considerable detail, the routing of vehicles on an idealized ring-radial network including how one would distort the shape of the zones near the origin and at boundaries. In Part II we will generalize this to other network geometries, and in Part III consider modifications in strategy if the items (people, for example) are valuable. In contrast with presently available computer programs for which the accuracy may decrease with increasing number of points in the region, the methods described here are essentially asymptotic approximations; the more points there are in the region, the more accurate are the results.

Suggested Citation

  • Newell, Gordon F. & Daganzo, Carlos F., 1986. "Design of multiple-vehicle delivery tours--I a ring-radial network," Transportation Research Part B: Methodological, Elsevier, vol. 20(5), pages 345-363, October.
    • Handle: RePEc:eee:transb:v:20:y:1986:i:5:p:345-363
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(86)90008-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    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:eee:transb:v:20:y:1986:i:5:p:345-363. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.