Approximate dynamic programming for network recovery problems with stochastic demand

Transportation Research, Part E: Logistics and Transportation Review - Tập 151 - Trang 102358 - 2021
Aybike Ulusan1, Özlem Ergun1
1Department of Mechanical and Industrial Engineering, Northeastern University, Boston, MA 02115, United States of America

Tài liệu tham khảo

Ahuja, 1988

Akbari, 2017, Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity, European J. Oper. Res., 257, 625, 10.1016/j.ejor.2016.07.043

Aksu, 2014, A mathematical model for post-disaster road restoration: Enabling accessibility and evacuation, Transp. Res. Part E, 61, 56, 10.1016/j.tre.2013.10.009

Averbakh, 2018, Lateness minimization in pairwise connectivity restoration problems, INFORMS J. Comput., 30, 522, 10.1287/ijoc.2017.0796

Ben-Tal, 2011, Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains, Transp. Res. Part B, 45, 1177, 10.1016/j.trb.2010.09.002

Berktas, 2016, Solution methodologies for debris removal in disaster response, EURO J. Comput. Optim., 4, 403, 10.1007/s13675-016-0063-1

Bertsekas, 1996

Bertsekas, 1996

Bozorgi-Amiri, 2013, A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty, OR Spect., 35, 905, 10.1007/s00291-011-0268-x

Bruneau, 2003, A framework to quantitatively assess and enhance the seismic resilience of communities, Earthquake Spectra, 19, 733, 10.1193/1.1623497

Cavdaroglu, 2013, Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems, Ann. Oper. Res., 203, 279, 10.1007/s10479-011-0959-3

Çelik, 2016, Network restoration and recovery in humanitarian operations: Framework, literature review, and research directions, Surv. Oper. Res. Manag. Sci., 21, 47

Celik, 2015, The post-disaster debris clearance problem under incomplete information, Oper. Res., 63, 65, 10.1287/opre.2014.1342

Domonoske, 2017

Dror, 1989, Vehicle routing with stochastic demands: Properties and solution frameworks, Transp. Sci., 23, 166, 10.1287/trsc.23.3.166

Fang, 2019, Optimum post-disruption restoration under uncertainty for enhancing critical infrastructure resilience, Reliab. Eng. Syst. Saf., 185, 1, 10.1016/j.ress.2018.12.002

2007

2010

2012

2017

Foundations, 1997

Geramifard, 2013, A tutorial on linear function approximators for dynamic programming and reinforcement learning, Found. Trends. Mach. Learn., 6, 375, 10.1561/2200000042

Gonzalez, 2016, The interdependent network design problem for optimal infrastructure system restoration, Comput.-Aided Civ. Infrastruct. Eng., 31, 334, 10.1111/mice.12171

Hoyos, 2015, OR models with stochastic components in disaster operations management: A literature survey, Comput. Ind. Eng., 82, 183, 10.1016/j.cie.2014.11.025

Hu, 2019, A multi-stage stochastic programming model for relief distribution considering the state of road network, Transp. Res. B, 123, 64, 10.1016/j.trb.2019.03.014

Keller, 2006, 449

Kleywegt, 2002, The stochastic inventory routing problem with direct deliveries, Transp. Sci., 36, 94, 10.1287/trsc.36.1.94.574

Li, 2018, Post-disaster multi-period road network repair: work scheduling and relief logistics optimization, Ann. Oper. Res., 1

Liberatore, 2013, Uncertainty in humanitarian logistics for disaster management. a review, 45

Lorca, 2017, An optimization-based decision-support tool for post-disaster debris operations, Prod. Oper. Manage., 26, 1076, 10.1111/poms.12643

2018

MassGIS, 2018

Maxwell, 2010, Approximate dynamic programming for ambulance redeployment, INFORMS J. Comput., 22, 266, 10.1287/ijoc.1090.0345

Medury, 2013, Incorporating network considerations into pavement management systems: A case for approximate dynamic programming, Transp. Res. C, 33, 134, 10.1016/j.trc.2013.03.003

Meng, 2017, Determining the optimal location of terror response facilities under the risk of disruption, IEEE Trans. Intell. Transp. Syst., 19, 476, 10.1109/TITS.2017.2697965

Miller, 2003

Nadi, 2016, A reinforcement learning approach for evaluation of real-time disaster relief demand and network condition, World Acad. Sci. Eng. Technol. Int. J. Environ. Chem. Ecol. Geol. Geophys. Eng., 11, 5

Newman, 2010

Novoa, 2009, An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, European J. Oper. Res., 196, 509, 10.1016/j.ejor.2008.03.023

Nozhati, 2021, A resilience-based framework for decision making based on simulation-optimization approach, Struct. Saf., 89, 10.1016/j.strusafe.2020.102032

Nozhati, 2020, Stochastic optimal control methodologies in risk-informed community resilience planning, Struct. Saf., 84, 10.1016/j.strusafe.2019.101920

Nozhati, 2020, Optimal stochastic dynamic scheduling for managing community recovery from natural hazards, Reliab. Eng. Syst. Saf., 193, 10.1016/j.ress.2019.106627

Nozhati, 2019, Near-optimal planning using approximate dynamic programming to enhance post-hazard community resilience management, Reliab. Eng. Syst. Saf., 181, 116, 10.1016/j.ress.2018.09.011

Nurre, 2012, Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem, European J. Oper. Res., 223, 794, 10.1016/j.ejor.2012.07.010

Patrick, 2008, Dynamic multipriority patient scheduling for a diagnostic resource, Oper. Res., 56, 1507, 10.1287/opre.1080.0590

Perkins, 2003, A convergent form of approximate policy iteration, 1627

Powell, 2007

Puterman, 2014

Roldan, 2017, A survey on the inventory-routing problem with stochastic lead times and demands, J. Appl. Log., 24, 15, 10.1016/j.jal.2016.11.010

Schmid, 2012, Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming, European J. Oper. Res., 219, 611, 10.1016/j.ejor.2011.10.043

Schuetz, 2012, Approximate dynamic programming for capacity allocation in the service industry, European J. Oper. Res., 218, 239, 10.1016/j.ejor.2011.09.007

Silver, 2012, Temporal-difference search in computer go, Mach. Learn., 87, 183, 10.1007/s10994-012-5280-0

Stone, 2005, Reinforcement learning for robocup soccer keepaway, Adapt. Behav., 13, 165, 10.1177/105971230501300301

Su, 2011, Path selection in disaster response management based on Q-learning, Int. J. Autom. Comput., 8, 100, 10.1007/s11633-010-0560-2

Sutton, 1998

Tootaghaj, 2017, Network recovery from massive failures under uncertain knowledge of damages, 1

Topaloglu, 2006, Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems, INFORMS J. Comput., 18, 31, 10.1287/ijoc.1040.0079

Tsitsiklis, 1996, Feature-based methods for large scale dynamic programming, Mach. Learn., 22, 59, 10.1007/BF00114724

Ulusan, 2018, Restoration of services in disrupted infrastructure systems: A network science approach, PLoS One, 13, 10.1371/journal.pone.0192272

Van Wassenhove, 2006, Humanitarian aid logistics: supply chain management in high gear, J. Oper. Res. Soc., 57, 475, 10.1057/palgrave.jors.2602125

Xu, 2007, Optimizing scheduling of post-earthquake electric power restoration tasks, Earthq. Eng. Struct. Dyn., 36, 265, 10.1002/eqe.623

Zhang, 2009, An approximate dynamic programming approach to network revenue management with customer choice, Transp. Sci., 43, 381, 10.1287/trsc.1090.0262

Zhang, 2017, Resilience-based post-disaster recovery strategies for road-bridge networks, Struct. Infrastruct. Eng., 13, 1404, 10.1080/15732479.2016.1271813

Zhong, 2020, Risk-averse optimization of disaster relief facility location and vehicle routing under stochastic demand, Transp. Res. Part E, 141, 10.1016/j.tre.2020.102015

Thông tin
Thông tin xuất bản

Transportation Research, Part E: Logistics and Transportation Review

Tập 151

102358

Thông tin tác giả