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

Delivery Volume Optimization

Author

Listed:
  • Ann Melissa Campbell

    (Tippie College of Business, Management Sciences Department, University of Iowa, Iowa City, Iowa 52242)

  • Martin W. P. Savelsbergh

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205)

Abstract

This work is motivated by the need to solve the inventory routing problem when implementing a business practice called vendor managed inventory replenishment. With vendor managed inventory replenishment, vendors monitor their customers' inventories, and decide when and how much inventory should be replenished at each customer. The inventory routing problem attempts to coordinate inventory replenishment and transportation in such a way that the cost is minimized over the long run. In this paper, we develop a linear time algorithm for determining a delivery schedule for a route, i.e., a given sequence of customer visits, that maximizes the total amount of product that is delivered on the route. This problem is not as easy as it may seem at first glance because of delivery windows at customers and the two dueling effects of increased inventory holding capacity at customers as time progresses and increased delivery times as more product is delivered at customers. Efficiently constructing such delivery schedules is important because it has to be done numerous times in insertion heuristics and local search procedures employed in solution approaches for the inventory routing problem.

Suggested Citation

  • Ann Melissa Campbell & Martin W. P. Savelsbergh, 2004. "Delivery Volume Optimization," Transportation Science, INFORMS, vol. 38(2), pages 210-223, May.
    • Handle: RePEc:inm:ortrsc:v:38:y:2004:i:2:p:210-223
    DOI: 10.1287/trsc.1030.0042
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1030.0042
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1030.0042?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. Zhao, Qiu-Hong & Chen, Shuang & Zang, Cun-Xun, 2008. "Model and algorithm for inventory/routing decision in a three-echelon logistics system," European Journal of Operational Research, Elsevier, vol. 191(3), pages 623-635, December.
    2. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    3. Li, Kunpeng & Chen, Bin & Sivakumar, Appa Iyer & Wu, Yong, 2014. "An inventory–routing problem with the objective of travel time minimization," European Journal of Operational Research, Elsevier, vol. 236(3), pages 936-945.
    4. G Brønmo & M Christiansen & B Nygreen, 2007. "Ship routing and scheduling with flexible cargo sizes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1167-1177, September.
    5. Claudia Archetti & Martin Savelsbergh, 2009. "The Trip Scheduling Problem," Transportation Science, INFORMS, vol. 43(4), pages 417-431, November.

    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:38:y:2004:i:2:p:210-223. 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.