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

Acceptance and Dispatching Policies for a Distribution Problem

Author

Listed:
  • Anton J. Kleywegt

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

  • Jason D. Papastavrou

    (School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907-1287)

Abstract

A dynamic and stochastic distribution problem with a number of terminals and a fleet of vehicles is analyzed. Customers request the transportation of batches of loads between different origins and destinations. A request can be accepted or rejected; if the request is accepted, a reward is received. Holding costs for vehicles and loads at terminals as well as transportation costs are included in the model. The objective is to determine a policy for accepting transportation requests and for dispatching vehicles that maximizes the expected value (rewards minus costs) of operating the distribution system. A Markov decision process model is developed, optimal policies are characterized, and algorithms that exploit the structure of the problem are developed.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ortrsc:v:32:y:1998:i:2:p:127-141
    DOI: 10.1287/trsc.32.2.127
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Daganzo, Carlos F., 1988. "A comparison of in-vehicle and out-of- vehicle freight consolidation strategies," Transportation Research Part B: Methodological, Elsevier, vol. 22(3), pages 173-180, June.
    2. 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.
    3. Carlos F. Daganzo, 1987. "The Break-Bulk Role of Terminals in Many-to-Many Logistic Networks," Operations Research, INFORMS, vol. 35(4), pages 543-555, August.
    4. Warren B. Powell, 1985. "Analysis of Vehicle Holding and Cancellation Strategies in Bulk Arrival, Bulk Service Queues," Transportation Science, INFORMS, vol. 19(4), pages 352-377, November.
    5. Warren B. Powell, 1986. "Iterative Algorithms for Bulk Arrival, Bulk Service Queues with Poisson and Non-Poisson Arrivals," Transportation Science, INFORMS, vol. 20(2), pages 65-79, May.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Miguel Andres Figliozzi & Hani S. Mahmassani & Patrick Jaillet, 2007. "Pricing in Dynamic Vehicle Routing Problems," Transportation Science, INFORMS, vol. 41(3), pages 302-318, August.
    2. van de Klundert, Joris & Otten, Bernhard, 2011. "Improving LTL truck load utilization on line," European Journal of Operational Research, Elsevier, vol. 210(2), pages 336-343, April.
    3. Al Hajj Hassan, Lama & Hewitt, Mike & Mahmassani, Hani S., 2022. "Daily load planning under different autonomous truck deployment scenarios," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Anna Franceschetti & Ola Jabali & Gilbert Laporte, 2017. "Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 413-433, October.
    2. Ç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.
    3. 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.
    4. 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.
    5. Warren B. Powell, 1987. "Waiting‐time distributions for bulk arrival, bulk service queues with vehicle‐holding and cancellation strategies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 207-227, April.
    6. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    7. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    8. Badia, Hugo & Argote-Cabanero , Juan & Daganzo, Carlos F., 2016. "Network Effects in Bus Transit: Evidence from Barcelona’s Nova Xarxa," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3996t4c6, Institute of Transportation Studies, UC Berkeley.
    9. Raymond K. Cheung & B. Muralidharan, 2000. "Dynamic Routing for Priority Shipments in LTL Service Networks," Transportation Science, INFORMS, vol. 34(1), pages 86-98, February.
    10. Le-Duc, T. & de Koster, M.B.M., 2002. "Determining The Optimal Order Picking Batch Size In Single Aisle Warehouses," ERIM Report Series Research in Management ERS-2002-64-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    11. Badia, Hugo & Argote-Cabanero, Juan & Daganzo, Carlos F., 2017. "How network structure can boost and shape the demand for bus transit," Transportation Research Part A: Policy and Practice, Elsevier, vol. 103(C), pages 83-94.
    12. 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.
    13. Luca Bertazzi & Maria Grazia Speranza & Walter Ukovich, 2000. "Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies," Management Science, INFORMS, vol. 46(7), pages 973-988, July.
    14. Chung-Yee Lee & Sila Çetinkaya & Wikrom Jaruphongsa, 2003. "A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse," Operations Research, INFORMS, vol. 51(5), pages 735-747, October.
    15. 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.
    16. 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.
    17. 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.
    18. Christian Brabänder & Maximilian Braun, 2020. "Bringing economies of integration into the costing of groupage freight," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 19(6), pages 366-385, December.
    19. Daniel Adelman, 2004. "A Price-Directed Approach to Stochastic Inventory/Routing," Operations Research, INFORMS, vol. 52(4), pages 499-514, August.
    20. Papadaki, Katerina P. & Powell, Warren B., 2002. "Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem," European Journal of Operational Research, Elsevier, vol. 142(1), pages 108-127, October.

    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:32:y:1998:i:2:p:127-141. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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.