Robust and stochastic formulations for ambulance deployment and dispatch

DOI10.1016/j.ejor.2019.05.011zbMath1430.90057OpenAlexW2945455926WikidataQ120697862 ScholiaQ120697862MaRDI QIDQ2312348

Yeesian Ng, Dimitris J. Bertsimas

Publication date: 5 July 2019

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.05.011

zbMATH Keywords

robust optimizationemergency medical systemsdata-driven optimizationOR in health systemsambulance location

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90) Robustness in mathematical programming (90C17)

Related Items (2)

A recursive simulation-optimization framework for the ambulance location and dispatching problem ⋮ A robust optimization approach for the unrelated parallel machine scheduling problem

Uses Software

• Julia
• OpenStreetMap

Cites Work

• Unnamed Item
• A stochastic optimization model for real-time ambulance redeployment
• Robust location transportation problems under uncertain demands
• Robust solutions of uncertain linear programs
• Data-driven robust optimization
• Binary decision rules for multistage adaptive mixed-integer optimization
• Designing robust emergency medical service via stochastic programming
• Ambulance location and relocation models.
• A maximal covering location model in the presence of partial coverage
• Covering models and optimization techniques for emergency response facility location and planning: a review
• Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles
• A robust counterpart approach to the bi-objective emergency medical service design problem
• A probabilistic model applied to emergency service vehicle location
• 2-stage robust MILP with continuous recourse variables
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Computational complexity of stochastic programming problems
• Optimal dispatching strategies for emergency vehicles to increase patient survivability
• Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
• Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
• Approximate Dynamic Programming for Ambulance Redeployment
• A Bound on the Performance of an Optimal Ambulance Redeployment Policy
• Julia: A Fresh Approach to Numerical Computing
• Introduction to Stochastic Programming
• The Maximal Expected Covering Location Problem: Revisited
• Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
• Theory and Applications of Robust Optimization
• The Cutting-Plane Method for Solving Convex Programs
• The maximal expected coverage relocation problem for emergency vehicles
• K-Adaptability in Two-Stage Robust Binary Programming
• Computing in Operations Research Using Julia
• A stochastic gradual cover location problem
• The Price of Robustness
• Solving an ambulance location model by tabu search
• The Maximum Availability Location Problem
• A Reliability Model Applied to Emergency Service Vehicle Location
• The Location of Emergency Service Facilities
• Response Areas for Two Emergency Units
• A dynamic model and parallel tabu search heuristic for real-time ambulance relocation

This page was built for publication: Robust and stochastic formulations for ambulance deployment and dispatch