IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-0-387-33636-7_11.html
   My bibliography  Save this book chapter

Rapid Distribution of Medical Supplies

In: Patient Flow: Reducing Delay in Healthcare Delivery

Author

Listed:
  • Maged Dessouky

    (University of Southern California)

  • Fernando Ordóñez

    (University of Southern California)

  • Hongzhong Jia

    (University of Southern California)

  • Zhihong Shen

    (University of Southern California)

Abstract

Some important issues in the design of an efficient pharmaceutical supply chain involve deciding where to place the warehouses/inventories and how to route distribution vehicles. Solving appropriate facility location and vehicle routing problems can ensure the design of a logistic network capable of rapid distribution of medical supplies. In particular, both these problems must be solved in coordination to quickly disburse medical supplies in response to a large-scale emergency. In this chapter, we present models to solve facility location and vehicle routing problems in the context of a response to a large-scale emergency. We illustrate the approach on a hypothetical anthrax emergency in Los Angeles County.

Suggested Citation

  • Maged Dessouky & Fernando Ordóñez & Hongzhong Jia & Zhihong Shen, 2006. "Rapid Distribution of Medical Supplies," International Series in Operations Research & Management Science, in: Randolph W. Hall (ed.), Patient Flow: Reducing Delay in Healthcare Delivery, chapter 0, pages 309-338, Springer.
    • Handle: RePEc:spr:isochp:978-0-387-33636-7_11
    DOI: 10.1007/978-0-387-33636-7_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    2. E. Angelelli & R. Mansini & M. Vindigni, 2016. "The Stochastic and Dynamic Traveling Purchaser Problem," Transportation Science, INFORMS, vol. 50(2), pages 642-658, May.
    3. He, Zhou & Fan, Bo & Cheng, T.C.E. & Wang, Shou-Yang & Tan, Chin-Hon, 2016. "A mean-shift algorithm for large-scale planar maximal covering location problems," European Journal of Operational Research, Elsevier, vol. 250(1), pages 65-76.

    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:spr:isochp:978-0-387-33636-7_11. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.