Model and a solution algorithm for the dynamic resource allocation problem for large-scale transportation network evacuation

Allocating movable 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 on large-scale networks. The proposed model is built on the earliest arrival flow formulation that significantly reduces problem size. A set of binary variables, specifically, the beginning and the ending time of resource allocation at a location, enable a strong formulation with tight constraints. A solution algorithm is developed to solve for an optimal solution on large-scale network applications by adopting Benders decomposition. In this algorithm, the MILP model is decomposed into two sub-problems. The first sub-problem, called the restricted master problem, identifies a feasible dynamic resource allocation plan. The second sub-problem, called the auxiliary problem, models dynamic traffic assignment in the evacuation network given a resource allocation plan. A numerical study is performed on the Dallas–Fort Worth network. The results show that the Benders decomposition algorithm can solve an optimal solution efficiently on a large-scale network.

[1]  Hong Zheng,et al.  On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems , 2015, Transp. Sci..

[2]  Srinivas Peeta,et al.  Planning for Evacuation : Insights from an Efficient Network Design Model , 2009 .

[3]  M. Anjos,et al.  Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem , 2012, IEEE Transactions on Power Systems.

[4]  S. Travis Waller,et al.  A Hybrid Bilevel Model for the Optimal Shelter Assignment in Emergency Evacuations , 2010, Comput. Aided Civ. Infrastructure Eng..

[5]  Henry X. Liu,et al.  Heuristic solution techniques for no-notice emergency evacuation traffic management , 2012 .

[6]  S. Waller,et al.  The evacuation optimal network design problem: model formulation and comparisons , 2009 .

[7]  S. Travis Waller,et al.  A dynamic evacuation network optimization problem with lane reversal and crossing elimination strategies , 2010 .

[8]  Yu-Ting Hsu,et al.  Behavior-consistent information-based network traffic control for evacuation operations , 2014 .

[9]  H. D. Ratliff,et al.  Note—Some Equivalent Objectives for Dynamic Network Flow Problems , 1982 .

[10]  Srinivas Peeta,et al.  An Exact Graph Structure for Dynamic Traffic Assignment: Formulation, Properties, and Computational Experience , 2007 .

[11]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[12]  Mohammad Marufuzzaman,et al.  Designing a Reliable Intermodal Hub-and-Spoke System for Biofuel Supply Chain Network , 2014 .

[13]  Andrew B. Philpott,et al.  Continuous-Time Flows in Networks , 1990, Math. Oper. Res..

[14]  Leon S. Lasdon,et al.  Solving Large Nonconvex Water Resources Management Models Using Generalized Benders Decomposition , 2001, Oper. Res..

[15]  J. MacGregor Smith,et al.  RESOURCE ALLOCATION IN STATE-DEPENDENT EMERGENCY EVACUATION NETWORKS , 1996 .

[16]  Michael Florian,et al.  The engine scheduling problem in a railway network , 1976 .

[17]  David Gale,et al.  Transient flows in networks. , 1959 .

[18]  Pamela Murray-Tuite,et al.  Evacuation transportation modeling: An overview of research, development, and practice , 2013 .

[19]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[20]  L. L. Garver,et al.  Power Generation Scheduling by Integer Programming-Development of Theory , 1962, Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems.

[21]  Hong K. Lo,et al.  A Cell-Based Traffic Control Formulation: Strategies and Benefits of Dynamic Timing Plans , 2001, Transp. Sci..

[22]  Athanasios K. Ziliaskopoulos,et al.  Tabu-Based Heuristic Approach for Optimization of Network Evacuation Contraflow , 2006 .

[23]  Robert Richardson.  An Optimization Approach to Routing Aircraft , 1976 .

[24]  Hong Zheng,et al.  Modeling no-notice mass evacuation using a dynamic traffic flow optimization model , 2007 .

[25]  Thomas J. Cova,et al.  A network flow model for lane-based evacuation routing , 2003 .

[26]  Lisa Fleischer,et al.  Faster Algorithms for the Quickest Transshipment Problem , 2001, SIAM J. Optim..

[27]  Anthony Chen,et al.  Shelter location-allocation model for flood evacuation planning , 2005 .

[28]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[29]  Carlos F. Daganzo,et al.  THE CELL TRANSMISSION MODEL.. , 1993 .

[30]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[31]  Yu-Ting Hsu,et al.  Risk-based spatial zone determination problem for stage-based evacuation operations , 2014 .

[32]  Antoine G. Hobeika,et al.  A LOCATION-ALLOCATION MODEL AND ALGORITHM FOR EVACUATION PLANNING UNDER HURRICANE/FLOOD CONDITIONS , 1991 .

[33]  Carlos F. Daganzo,et al.  THE CELL TRANSMISSION MODEL, PART II: NETWORK TRAFFIC , 1995 .

[34]  C. Daganzo.  THE CELL TRANSMISSION MODEL.. , 1994 .

[35]  Andres Ramos,et al.  BENDERS DECOMPOSITION FOR MIXED-INTEGER HYDROTHERMAL PROBLEMS BY LAGRANGEAN RELAXATION , 2002 .

[36]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[37]  Satish V. Ukkusuri,et al.  System-Optimal Stochastic Transportation Network Design , 2007 .

[38]  Saïd Salhi,et al.  A Tabu Search Approach for the Resource Constrained Project Scheduling Problem , 1998, J. Heuristics.

[39]  Mark A. Turnquist,et al.  Lane-based evacuation network optimization: An integrated Lagrangian relaxation and tabu search approach , 2011 .

[40]  A. Conejo,et al.  Optimal response of a thermal unit to an electricity spot market , 2000 .

[41]  Michael G.H. Bell,et al.  Network Reliability in Practice , 2012 .

[42]  S. Travis Waller,et al.  A Decomposition Scheme for System Optimal Dynamic Traffic Assignment Models , 2003 .

[43]  Carlos F. Daganzo,et al.  The Cell Transmission Model. Part I: A Simple Dynamic Representation Of Highway Traffic , 1992 .

[44]  Vinayak Dixit,et al.  Evacuation traffic dynamics , 2014 .

[45]  Martin Skutella,et al.  Quickest Flows Over Time , 2007, SIAM J. Comput..

[46]  Srinivas Peeta,et al.  Dynamic Resource Allocation Problem for Transportation Network Evacuation , 2014 .

[47]  Dennis Anderson.  Models for determining least-cost investments in electricity supply , 1972 .

[48]  F. Sibel Salman,et al.  Pre-disaster investment decisions for strengthening a highway network , 2010, Comput. Oper. Res..

[49]  Elise Miller-Hooks,et al.  traffic signal timing for urban evacuation , 2007 .

[50]  M. Carrion,et al.  A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem , 2006, IEEE Transactions on Power Systems.

[51]  Fritz Gehbauer,et al.  Optimized resource allocation for emergency response after earthquake disasters , 2000 .