Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach
DOI10.1007/s10479-023-05397-0zbMath1520.90040MaRDI QIDQ6179230
Babak Mohamadpour Tosarkani, Sepideh Nasiri, Donya Rahmani, Sakineh Lakzaei
Publication date: 5 September 2023
Published in: Annals of Operations Research (Search for Journal in Brave)
schedulingBenders decompositionroutingant colony optimizationdisasterroad restorationdebris management
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- A note on two problems in connexion with graphs
- Parallel ant colony optimization for resource constrained job scheduling
- Optimal scheduling of emergency roadway repair and subsequent relief distribution
- Partitioning procedures for solving mixed-variables programming problems
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- Integrated optimal scheduling of repair crew and relief vehicle after disaster
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- A survey on Benders decomposition applied to fixed-charge network design problems
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- The accessibility arc upgrading problem
- An improved Benders decomposition algorithm for the tree of hubs location problem
- OR/MS research in disaster operations management
- The Post-Disaster Debris Clearance Problem Under Incomplete Information
- Integer Programming Formulation of Traveling Salesman Problems
This page was built for publication: Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach
