Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions
From MaRDI portal
Publication:6047851
DOI10.1016/j.cor.2023.106314OpenAlexW4381033674MaRDI QIDQ6047851
Davood Shiri, Hakan Tozan, Vahid Akbari
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106314
competitive ratiopartial informationambulance routingdisaster reliefonline optimisationmass emergency incident
Cites Work
- Unnamed Item
- The Canadian tour operator problem on paths: tight bounds and resource augmentation
- Ambulance routing for disaster response with patient groups
- A stochastic algorithm for online bipartite resource allocation problems
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- On the power of randomization in on-line algorithms
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Emergency medical services and beyond: addressing new challenges through a wide literature review
- Online algorithms for the maximum \(k\)-colorable subgraph problem
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- Mass casualty management in disaster scene: a systematic review of OR\&MS research in humanitarian operations
- Ambulance routing in disaster response considering variable patient condition: NSGA-II and MOPSO algorithms
- Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
- Fairness in ambulance routing for post disaster management
- Online algorithms to schedule a proportionate flexible flow shop of batching machines
- A review of applications of operational research in healthcare coordination in disaster management
- Online crowdsourced truck delivery using historical information
- Online routing and searching on graphs with blocked edges
- Weighted online minimum latency problem with edge uncertainty
- A review of dynamic vehicle routing problems
- Online scheduling of jobs with favorite machines
- Competitive analysis of randomized online strategies for the multi-agent \(k\)-Canadian traveler problem
- An online optimization approach for post-disaster relief distribution with online blocked edges
- Semi-online scheduling: a survey
- Routing multiple work teams to minimize latency in post-disaster road network restoration
- An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Competitive algorithms and lower bounds for online randomized call control in cellular networks
- Online Searching
- On online bin packing with LIB constraints
- Stochastic regret minimization for revenue management problems with nonstationary demands
- Online traveling salesman problems with rejection options
- On the asymptotic optimality of algorithms for the flow shop problem with release dates
- On-line machine covering
- On competitive analysis for polling systems
