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

A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching

Author

Listed:
  • Alan S. Minkoff

    (IBM Corporation, New York, New York)

Abstract

We describe a dynamic and stochastic vehicle dispatching problem called the delivery dispatching problem. This problem is modeled as a Markov decision process. Because exact solution of this model is impractical, we adopt a heuristic approach for handling the problem. The heuristic is based in part on a decomposition of the problem by customer, where customer subproblems generate penalty functions that are applied in a master dispatching problem. We describe how to compute bounds on the algorithm's performance, and apply it to several examples with good results.

Suggested Citation

  • Alan S. Minkoff, 1993. "A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching," Operations Research, INFORMS, vol. 41(1), pages 77-90, February.
    • Handle: RePEc:inm:oropre:v:41:y:1993:i:1:p:77-90
    DOI: 10.1287/opre.41.1.77
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.41.1.77
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.41.1.77?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. Frank Chen & Tong Wang & Tommy Xu, 2005. "Integrated Inventory Replenishment and Temporal Shipment Consolidation: A Comparison of Quantity-Based and Time-Based Models," Annals of Operations Research, Springer, vol. 135(1), pages 197-210, March.
    2. Sayarshad, Hamid R. & Gao, H. Oliver, 2018. "A non-myopic dynamic inventory routing and pricing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 83-98.
    3. Ilya O. Ryzhov & Martijn R. K. Mes & Warren B. Powell & Gerald van den Berg, 2019. "Bayesian Exploration for Approximate Dynamic Programming," Operations Research, INFORMS, vol. 67(1), pages 198-214, January.
    4. Côté, Jean-François & Alves de Queiroz, Thiago & Gallesi, Francesco & Iori, Manuel, 2023. "A branch-and-regret algorithm for the same-day delivery problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    5. Yves Crama & Mahmood Rezaei & Martin Savelsbergh & Tom Van Woensel, 2018. "Stochastic Inventory Routing for Perishable Products," Transportation Science, INFORMS, vol. 52(3), pages 526-546, June.
    6. Ouyang, Zhiyuan & Leung, Eric Ka Ho & Huang, George Q., 2022. "Community logistics for dynamic vehicle dispatching: The effects of community departure “time” and “space”," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    7. Lucas Agussurja & Shih-Fen Cheng & Hoong Chuin Lau, 2019. "A State Aggregation Approach for Stochastic Multiperiod Last-Mile Ride-Sharing Problems," Service Science, INFORMS, vol. 53(1), pages 148-166, February.
    8. Noah Gans & Garrett van Ryzin, 1999. "Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights," Operations Research, INFORMS, vol. 47(5), pages 675-692, October.
    9. Martin I. Reiman & Rodrigo Rubio & Lawrence M. Wein, 1999. "Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem," Transportation Science, INFORMS, vol. 33(4), pages 361-380, November.
    10. Anton J. Kleywegt & Jason D. Papastavrou, 1998. "Acceptance and Dispatching Policies for a Distribution Problem," Transportation Science, INFORMS, vol. 32(2), pages 127-141, May.
    11. Ketzenberg, Michael E. & Metters, Richard D., 2020. "Adapting operations to new information technology: A failed “internet of things” application," Omega, Elsevier, vol. 92(C).
    12. Sila Çetinkaya & Chung-Yee Lee, 2000. "Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems," Management Science, INFORMS, vol. 46(2), pages 217-232, February.
    13. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2004. "Dynamic Programming Approximations for a Stochastic Inventory Routing Problem," Transportation Science, INFORMS, vol. 38(1), pages 42-70, February.
    14. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2002. "The Stochastic Inventory Routing Problem with Direct Deliveries," Transportation Science, INFORMS, vol. 36(1), pages 94-118, February.
    15. Daniel Adelman, 2004. "A Price-Directed Approach to Stochastic Inventory/Routing," Operations Research, INFORMS, vol. 52(4), pages 499-514, August.
    16. Andreatta, G. & Lulli, G., 2008. "A multi-period TSP with stochastic regular and urgent demands," European Journal of Operational Research, Elsevier, vol. 185(1), pages 122-132, February.
    17. Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2015. "Managing stochastic demand in an Inventory Routing Problem with transportation procurement," Omega, Elsevier, vol. 56(C), pages 112-121.
    18. Alejandro Toriello & George Nemhauser & Martin Savelsbergh, 2010. "Decomposing inventory routing problems with approximate value functions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(8), pages 718-727, December.
    19. Çetinkaya, SIla & Bookbinder, James H., 2003. "Stochastic models for the dispatch of consolidated shipments," Transportation Research Part B: Methodological, Elsevier, vol. 37(8), pages 747-768, September.
    20. Zheng Wang & Jiuh‐Biing Sheu & Chung‐Piaw Teo & Guiqin Xue, 2022. "Robot Scheduling for Mobile‐Rack Warehouses: Human–Robot Coordinated Order Picking Systems," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 98-116, January.
    21. Vukadinovic, Katarina & Teodorovic, Dusan & Pavkovic, Goran, 1997. "A neural network approach to the vessel dispatching problem," European Journal of Operational Research, Elsevier, vol. 102(3), pages 473-487, November.
    22. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2000. "Diversion Issues in Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 34(4), pages 426-438, November.
    23. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.

    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:41:y:1993:i:1:p:77-90. 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.