Advanced Search
MyIDEAS: Login to save this article or follow this journal

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

Contents:

Author Info

  • Newell, Gordon F.
  • Daganzo, Carlos F.
Registered author(s):

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. 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.sciencedirect.com/science/article/B6V99-466CF0G-65/2/4a9ed76e9999943b5f0af1fdc226eaf0
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Transportation Research Part B: Methodological.

    Volume (Year): 20 (1986)
    Issue (Month): 5 (October)
    Pages: 345-363

    as in new window
    Handle: RePEc:eee:transb:v:20:y:1986:i:5:p:345-363

    Contact details of provider:
    Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description

    Order Information:
    Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
    Web: https://shop.elsevier.com/order?id=548&ref=548_01_ooc_1&version=01

    Related research

    Keywords:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Daganzo, Carlos F. & Smilowitz, Karen R., 2000. "Asymptotic Approximations for the Transportation LP and Other Scalable Network Problems," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3dn2j66w, Institute of Transportation Studies, UC Berkeley.
    2. Campbell, James F., 1995. "Using small trucks to circumvent large truck restrictions: Impacts on truck emissions and performance measures," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(6), pages 445-458, November.
    3. Daganzo, Carlos F & Smilowitz, Karen R, 2000. "Asymptotic Approximations for the Transportation LP and Other Scalable Network Problems," University of California Transportation Center, Working Papers qt7wb1g4z7, University of California Transportation Center.
    4. Bertazzi, Luca & Speranza, Maria Grazia & Ukovich, Walter, 1997. "Minimization of logistic costs with given frequencies," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 327-340, August.
    5. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.
    6. Diana, Marco & Dessouky, Maged M. & Xia, Nan, 2006. "A model for the fleet sizing of demand responsive transportation services with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 651-666, September.
    7. Novaes, Antonio G. N. & Graciolli, Odacir D., 1999. "Designing multi-vehicle delivery tours in a grid-cell format," European Journal of Operational Research, Elsevier, vol. 119(3), pages 613-634, December.
    8. Ouyang, Yanfeng, 2007. "Design of vehicle routing zones for large-scale distribution systems," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1079-1093, December.
    9. del Castillo, Jose M., 1998. "A heuristic for the traveling salesman problem based on a continuous approximation," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 123-152, April.
    10. Jabali, Ola & Gendreau, Michel & Laporte, Gilbert, 2012. "A continuous approximation model for the fleet composition problem," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1591-1606.
    11. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.