Minimizing latency in post-disaster road clearance operations
From MaRDI portal
Publication:1740563
DOI10.1016/j.ejor.2019.03.024zbMath1430.90043OpenAlexW2921829131MaRDI QIDQ1740563
F. Sibel Salman, Meraj Ajam, Vahid Akbari
Publication date: 30 April 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://nottingham-repository.worktribe.com/output/2472459
Related Items
A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem, Network construction/restoration problems: cycles and complexity, An online optimization approach for post-disaster relief distribution with online blocked edges, Routing multiple work teams to minimize latency in post-disaster road network restoration, Metaheuristics for the work‐troops scheduling problem, Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties, Robust post-disaster route restoration, Online failure diagnosis in interdependent networks, Weighted online minimum latency problem with edge uncertainty, A metaheuristic for the delivery man problem with time windows
Cites Work
- Locating temporary shelter areas after an earthquake: a case for Turkey
- Network repair crew scheduling and routing for emergency relief distribution problem
- Heuristics for the traveling repairman problem with profits
- A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics
- Solution methodologies for debris removal in disaster response
- Two improved formulations for the minimum latency problem
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- A GRASP metaheuristic to improve accessibility after a disaster
- Optimal scheduling of emergency roadway repair and subsequent relief distribution
- A new formulation for the traveling deliveryman problem
- An improved approximation ratio for the minimum latency problem
- Variable neighborhood search
- Multi-vehicle prize collecting arc routing for connectivity problem
- 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
- Greedy randomized adaptive search procedures
- A simple and effective metaheuristic for the minimum latency problem
- Variable neighborhood search for the travelling deliveryman problem
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- The Post-Disaster Debris Clearance Problem Under Incomplete Information
- P-Complete Approximation Problems
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
