Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity

DOI10.1016/j.ejor.2016.07.043zbMath1394.90074OpenAlexW2493507510MaRDI QIDQ1752846

F. Sibel Salman, Vahid Akbari

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://nottingham-repository.worktribe.com/output/1141381

zbMATH Keywords

network connectivityhumanitarian logisticsdisaster responseroad clearance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (22)

A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem ⋮ Multi-vehicle prize collecting arc routing for connectivity problem ⋮ Decomposition-based algorithms for the crew scheduling and routing problem in road restoration ⋮ Routing multiple work teams to minimize latency in post-disaster road network restoration ⋮ Metaheuristics for the work‐troops scheduling problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties ⋮ Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach ⋮ Learn to decompose multiobjective optimization models for large‐scale networks ⋮ A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration ⋮ Unnamed Item ⋮ Robust post-disaster route restoration ⋮ Endogenous stochastic optimisation for relief distribution assisted with unmanned aerial vehicles ⋮ Minimizing latency in post-disaster road clearance operations ⋮ Weighted online minimum latency problem with edge uncertainty ⋮ Incomplete information imputation in limited data environments with application to disaster response ⋮ Integrating location and network restoration decisions in relief networks under uncertainty ⋮ A multi-objective distributionally robust model for sustainable last mile relief network design problem ⋮ Abstract network flow with intermediate storage for evacuation planning ⋮ Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters ⋮ A multi-objective humanitarian pickup and delivery vehicle routing problem with drones ⋮ Synchronizing victim evacuation and debris removal: a data-driven robust prediction approach

Cites Work

• Unnamed Item
• The synchronized arc and node routing problem: application to road marking
• A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics
• A GRASP metaheuristic to improve accessibility after a disaster
• Optimal scheduling of emergency roadway repair and subsequent relief distribution
• Synchronized arc routing for snow plowing operations
• Min-Max K -vehicles windy rural postman problem
• The Post-Disaster Debris Clearance Problem Under Incomplete Information
• An algorithm for the Rural Postman problem on a directed graph
• Improvement Procedures for the Undirected Rural Postman Problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Arc Routing

This page was built for publication: Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity