Robust post-disaster route restoration
From MaRDI portal
Publication:2215565
DOI10.1007/S00291-020-00601-0zbMATH Open1454.90013OpenAlexW3079076697MaRDI QIDQ2215565FDOQ2215565
Authors: Aakil Caunhye, Nazli Yonca Aydin, H. Sebnem Duzgun
Publication date: 13 December 2020
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-020-00601-0
Recommendations
- Strategic network restoration
- Routing multiple work teams to minimize latency in post-disaster road network restoration
- A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty
- Emergency path restoration problems
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06) Robustness in mathematical programming (90C17)
Cites Work
- Integrated optimal scheduling of repair crew and relief vehicle after disaster
- The Price of Robustness
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust convex optimization
- Distributionally robust optimization and its tractable approximations
- Robust Solutions to Uncertain Semidefinite Programs
- Design of near optimal decision rules in multistage adaptive mixed-integer optimization
- Optimal scheduling of emergency roadway repair and subsequent relief distribution
- Minimizing latency in post-disaster road clearance operations
- The post-disaster debris clearance problem under incomplete information
- Uncertain linear programs: extended affinely adjustable robust counterparts
- Finite Adaptability in Multistage Linear Optimization
- The robust capacitated vehicle routing problem under demand uncertainty
- On the power and limitations of affine policies in two-stage adaptive optimization
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- \(K\)-adaptability in two-stage robust binary programming
- Multi-vehicle prize collecting arc routing for connectivity problem
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- Binary decision rules for multistage adaptive mixed-integer optimization
- Network repair crew scheduling for short-term disasters
- Adjustable robust optimization via Fourier-Motzkin elimination
Cited In (11)
- Network capacity reliability analysis considering traffic regulation after a major disaster
- Strategic network restoration
- Routing multiple work teams to minimize latency in post-disaster road network restoration
- A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
- Improved robust shortest paths by penalized investments
- A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty
- Developing robust facility reopening processes following natural disasters
- Applying ranking and selection procedures to long-term mitigation for improved network restoration
- Decision making on post-disaster rescue routing problems from the rescue efficiency perspective
- An indirect search algorithm for disaster restoration with precedence and synchronization constraints
- The post-disaster debris clearance problem under incomplete information
Uses Software
This page was built for publication: Robust post-disaster route restoration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215565)