An online optimization approach for post-disaster relief distribution with online blocked edges

DOI10.1016/j.cor.2021.105533OpenAlexW3197467750MaRDI QIDQ2669638

Vahid Akbari, Davood Shiri

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105533

zbMATH Keywords

competitive ratioonline optimizationminimum latency problemOR in disaster reliefdisaster responseemergency logisticstraveling repairman problemrelief distribution

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (3)

Online routing and searching on graphs with blocked edges ⋮ An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands ⋮ Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions

Cites Work

• Unnamed Item
• The Steiner traveling salesman problem with online edge blockages
• Heuristics for the traveling repairman problem with profits
• Two improved formulations for the minimum latency problem
• Emergency logistics planning in natural disasters
• Shortest paths without a map
• A note on the \(k\)-Canadian traveller problem
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• Online algorithms: a survey
• The Steiner traveling salesman problem with online advanced edge blockages
• Multi-vehicle prize collecting arc routing for connectivity problem
• A branch-and-price algorithm for the minimum latency problem
• A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
• Minimizing latency in post-disaster road clearance operations
• Online covering salesman problem
• An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains
• Variable neighborhood search for the travelling deliveryman problem
• Decision making on post-disaster rescue routing problems from the rescue efficiency perspective
• Online failure diagnosis in interdependent networks
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
• A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
• Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
• An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
• The \(k\)-Canadian travelers problem with communication
• On the online multi-agent O-D \(k\)-Canadian traveler problem
• Competitive analysis of randomized online strategies for the multi-agent \(k\)-Canadian traveler problem
• On the randomized online strategies for the \(k\)-Canadian traveler problem
• The covering Canadian traveller problem
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• Online Vehicle Routing Problems: A Survey
• The complexity of the travelling repairman problem
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The Delivery Man Problem and Cumulative Matroids
• The traveling salesman problem with cumulative costs

This page was built for publication: An online optimization approach for post-disaster relief distribution with online blocked edges