{"title":"A Two-stage Stochastic Programming for the Integrated Emergency Mobility Facility Allocation and Road Network Design Under Uncertainty","authors":"Huatian Gong, Xiaoguang Yang","doi":"10.1007/s11067-024-09635-1","DOIUrl":null,"url":null,"abstract":"<p>Emergency Mobility Facilities (EMFs) possess the capability to relocate dynamically, providing adequate responses to fluctuations in emergent demand patterns across temporal and spatial dimensions. This study proposes a two-stage stochastic programming model that integrates the EMF allocation problem and the road network design problem for disaster preparedness. The model takes into account uncertainties arising from emergency demand and road network congestion levels under various sizes and timings of disaster occurrences. The first-stage decision involves determining the fleet size of EMFs and identifying which road links’ travel time should be reduced. The second-stage decision pertains to the routing and schedule of each EMF for each disaster scenario. Due to considering various sources of uncertainty, the resulting model takes the form of a non-convex mixed-integer nonlinear program (MINLP). This poses computational challenges due to the inclusion of bilinear terms, implicit expressions, and the double-layered structure in the second-stage model, along with integer decision variables. A comprehensive set of techniques is applied to solve the model efficiently. This includes employing linearization techniques, converting the second-stage model into a single-level equivalent, transforming an integer variable into multiple binary variables, and utilizing other methods to equivalently reformulate the model into a mixed-integer linear programming problem (MILP). These transformations render the model amenable to solutions using the integer L-shaped method. A simplified example clarifies the solution procedures of the model and algorithm, establishing the theoretical foundation for their practical implementation. Subsequently, to empirically demonstrate the practicality of the proposed model and algorithm, a real-world case study is conducted, effectively validating their utility.</p>","PeriodicalId":501141,"journal":{"name":"Networks and Spatial Economics","volume":"6 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Networks and Spatial Economics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11067-024-09635-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Emergency Mobility Facilities (EMFs) possess the capability to relocate dynamically, providing adequate responses to fluctuations in emergent demand patterns across temporal and spatial dimensions. This study proposes a two-stage stochastic programming model that integrates the EMF allocation problem and the road network design problem for disaster preparedness. The model takes into account uncertainties arising from emergency demand and road network congestion levels under various sizes and timings of disaster occurrences. The first-stage decision involves determining the fleet size of EMFs and identifying which road links’ travel time should be reduced. The second-stage decision pertains to the routing and schedule of each EMF for each disaster scenario. Due to considering various sources of uncertainty, the resulting model takes the form of a non-convex mixed-integer nonlinear program (MINLP). This poses computational challenges due to the inclusion of bilinear terms, implicit expressions, and the double-layered structure in the second-stage model, along with integer decision variables. A comprehensive set of techniques is applied to solve the model efficiently. This includes employing linearization techniques, converting the second-stage model into a single-level equivalent, transforming an integer variable into multiple binary variables, and utilizing other methods to equivalently reformulate the model into a mixed-integer linear programming problem (MILP). These transformations render the model amenable to solutions using the integer L-shaped method. A simplified example clarifies the solution procedures of the model and algorithm, establishing the theoretical foundation for their practical implementation. Subsequently, to empirically demonstrate the practicality of the proposed model and algorithm, a real-world case study is conducted, effectively validating their utility.
应急交通设施(EMF)具有动态搬迁的能力,可充分应对跨时空的突发需求模式波动。本研究提出了一个两阶段随机编程模型,该模型整合了紧急交通设施分配问题和备灾道路网络设计问题。该模型考虑了不同规模和时间的灾害发生时应急需求和路网拥堵水平所带来的不确定性。第一阶段的决策包括确定紧急避险车队的规模,并确定应缩短哪些道路的通行时间。第二阶段的决策涉及在每种灾害情况下每辆环保车的行驶路线和时间表。由于考虑到各种不确定性来源,由此产生的模型采用了非凸混合整数非线性程序(MINLP)的形式。由于在第二阶段模型中包含了双线性项、隐式表达、双层结构以及整数决策变量,这给计算带来了挑战。为了高效求解该模型,我们采用了一整套技术。这包括采用线性化技术、将第二阶段模型转换为单层等效模型、将整数变量转换为多个二进制变量,以及利用其他方法将模型等效地重新表述为混合整数线性规划问题(MILP)。通过这些转换,该模型可以使用整数 L 型方法求解。一个简化的例子阐明了模型和算法的求解过程,为其实际应用奠定了理论基础。随后,为了从经验上证明所提模型和算法的实用性,我们进行了一项实际案例研究,有效地验证了它们的实用性。