IDEAS home Printed from
   My bibliography  Save this article

Dynamic Resource Allocation Problem for Transportation Network Evacuation


  • Xiaozheng He


  • Srinivas Peeta



Allocating movable response resources dynamically enables evacuation management agencies to improve evacuation system performance in both the spatial and temporal dimensions. This study proposes a mixed integer linear program (MILP) model to address the dynamic resource allocation problem for transportation evacuation planning and operations. To enable realism in practice, the proposed model includes spatiotemporal constraints related to the time required to reallocate resources to another location, the minimum time allocated resources should be at a location, and the minimum time gap between successive allocations of resources to a location. The proposed model is transformed into a two-stage optimization program for which a greedy-type heuristic algorithm is developed to solve the MILP approximately but efficiently. Results from computational experiments demonstrate the effectiveness of the proposed model and the efficiency of the heuristic solution algorithm. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Xiaozheng He & Srinivas Peeta, 2014. "Dynamic Resource Allocation Problem for Transportation Network Evacuation," Networks and Spatial Economics, Springer, vol. 14(3), pages 505-530, December.
  • Handle: RePEc:kap:netspa:v:14:y:2014:i:3:p:505-530
    DOI: 10.1007/s11067-014-9247-5

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Douglas Bish & Edward Chamberlayne & Hesham Rakha, 2013. "Optimizing Network Flows with Congestion-Based Flow Reductions," Networks and Spatial Economics, Springer, vol. 13(3), pages 283-306, September.
    2. Tao Yao & Supreet Mandala & Byung Chung, 2009. "Evacuation Transportation Planning Under Uncertainty: A Robust Optimization Approach," Networks and Spatial Economics, Springer, vol. 9(2), pages 171-189, June.
    3. Yu-Ting Hsu & Srinivas Peeta, 2013. "An aggregate approach to model evacuee behavior for no-notice evacuation operations," Transportation, Springer, vol. 40(3), pages 671-696, May.
    4. Satish Ukkusuri & S. Waller, 2008. "Linear Programming Models for the User and System Optimal Dynamic Network Design Problem: Formulations, Comparisons and Extensions," Networks and Spatial Economics, Springer, vol. 8(4), pages 383-406, December.
    5. Daganzo, Carlos F., 1995. "The cell transmission model, part II: Network traffic," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 79-93, April.
    6. Cova, Thomas J. & Johnson, Justin P., 2003. "A network flow model for lane-based evacuation routing," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(7), pages 579-604, August.
    7. Chiu, Yi-Chang & Zheng, Hong, 2007. "Real-time mobilization decisions for multi-priority emergency response resources and evacuation groups: Model formulation and solution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(6), pages 710-736, November.
    8. Sherali, Hanif D. & Carter, Todd B. & Hobeika, Antoine G., 1991. "A location-allocation model and algorithm for evacuation planning under hurricane/flood conditions," Transportation Research Part B: Methodological, Elsevier, vol. 25(6), pages 439-452, December.
    9. John J. Jarvis & H. Donald Ratliff, 1982. "Note---Some Equivalent Objectives for Dynamic Network Flow Problems," Management Science, INFORMS, vol. 28(1), pages 106-109, January.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. repec:kap:netspa:v:17:y:2017:i:2:d:10.1007_s11067-017-9339-0 is not listed on IDEAS
    2. repec:kap:netspa:v:17:y:2017:i:2:d:10.1007_s11067-016-9332-z is not listed on IDEAS
    3. repec:eee:transe:v:105:y:2017:i:c:p:39-59 is not listed on IDEAS
    4. repec:kap:netspa:v:17:y:2017:i:1:d:10.1007_s11067-016-9323-0 is not listed on IDEAS


    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:kap:netspa:v:14:y:2014:i:3:p:505-530. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.