IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v28y1994i2p162-166.html
   My bibliography  Save this article

Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path

Author

Listed:
  • Igor Averbakh

    (University of Toronto, Division of Management and Economics at Scarborough College, Scarborough, Ontario M1C 1A4, Canada)

  • Oded Berman

    (University of Toronto, Division of Management and Economics at Scarborough and Faculty of Management, Toronto, Ontario M5S 1V4, Canada)

Abstract

In this note, we discuss routing and location-routing delivery men problems on a path. The objective of the delivery men problem is to find service tours so as to minimize the total waiting time of all customers. We present an O ( n 2 ) time algorithm for the location-routing problem with a single server. This algorithm is further used in polynomial time algorithms that are developed for routing and location-routing problems with p servers. Also considered is the sales-delivery men problem for which in addition to the delivery men criterion, also the traveling salesman criterion (which is of primary importance) is used.

Suggested Citation

  • Igor Averbakh & Oded Berman, 1994. "Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path," Transportation Science, INFORMS, vol. 28(2), pages 162-166, May.
    • Handle: RePEc:inm:ortrsc:v:28:y:1994:i:2:p:162-166
    DOI: 10.1287/trsc.28.2.162
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.28.2.162
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.28.2.162?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
    ---><---

    Citations

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


    Cited by:

    1. Ahmadi-Javid, Amir & Amiri, Elahe & Meskar, Mahla, 2018. "A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 866-881.
    2. Moshref-Javadi, Mohammad & Lee, Seokcheon, 2016. "The Latency Location-Routing Problem," European Journal of Operational Research, Elsevier, vol. 255(2), pages 604-619.

    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:inm:ortrsc:v:28:y:1994:i:2:p:162-166. 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.