A dynamic dispatching problem to allocate relief vehicles after a disaster
DOI10.1080/0305215X.2020.1843164zbMath1523.90027OpenAlexW3106284970MaRDI QIDQ6094439
Fariborz Jolai, Unnamed Author, Seyyed Mohammad Taghi Fatemi Ghomi
Publication date: 10 October 2023
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2020.1843164
disasteremergency medical services\(\varepsilon\)-constraint methodnon-dominated sorting genetic algorithmmulti-objective imperialist competitive algorithm
Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06)
Related Items (2)
Cites Work
- Optimizing emergency preparedness and resource utilization in mass-casualty incidents
- Emergency logistics planning in natural disasters
- Joint ground and air emergency medical services coverage models: a greedy heuristic solution approach
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Integrated optimal scheduling of repair crew and relief vehicle after disaster
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Early stage response problem for post-disaster incidents
This page was built for publication: A dynamic dispatching problem to allocate relief vehicles after a disaster