Robust and stochastic formulations for ambulance deployment and dispatch
type: Item
instance of: scholarly article
title: Robust and stochastic formulations for ambulance deployment and dispatch
zbMATH Open document ID: 1430.90057
author: Yeesian Ng
author: Dimitris Bertsimas
published in: European Journal of Operational Research
publication date: 2019-07-05T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C17
zbMATH DE Number: 7077323
zbMATH Keywords: OR in health systems
zbMATH Keywords: emergency medical systems
zbMATH Keywords: ambulance location
zbMATH Keywords: robust optimization
zbMATH Keywords: data-driven optimization
Wikidata QID: Q120697862
describes a project that uses: Julia
describes a project that uses: OpenStreetMap
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ejor.2019.05.011
OpenAlex ID: W2945455926
cites work: A Reliability Model Applied to Emergency Service Vehicle Location
cites work: Optimal dispatching strategies for emergency vehicles to increase patient survivability
cites work: The Maximal Expected Covering Location Problem: Revisited
cites work: Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles
cites work: Robust solutions of uncertain linear programs
cites work: A probabilistic model applied to emergency service vehicle location
cites work: Designing robust emergency medical service via stochastic programming
cites work: Theory and Applications of Robust Optimization
cites work: Multistage robust mixed-integer optimization with adaptive partitions
cites work: Binary decision rules for multistage adaptive mixed-integer optimization
cites work: Data-driven robust optimization
cites work: The Price of Robustness
cites work: Julia: A Fresh Approach to Numerical Computing
cites work: 2-stage robust MILP with continuous recourse variables
cites work: Introduction to Stochastic Programming
cites work: Ambulance location and relocation models.
cites work: Response Areas for Two Emergency Units
cites work: Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
cites work: A stochastic gradual cover location problem
cites work: Computational complexity of stochastic programming problems
cites work: Robust location transportation problems under uncertain demands
cites work: Solving an ambulance location model by tabu search
cites work: A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
cites work: The maximal expected coverage relocation problem for emergency vehicles
cites work: K-Adaptability in Two-Stage Robust Binary Programming
cites work: A maximal covering location model in the presence of partial coverage
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Covering models and optimization techniques for emergency response facility location and planning: a review
cites work: Computing in Operations Research Using Julia
cites work: A Bound on the Performance of an Optimal Ambulance Redeployment Policy
cites work: Approximate dynamic programming for ambulance redeployment
cites work: A stochastic optimization model for real-time ambulance redeployment
cites work: Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set
cites work: The Maximum Availability Location Problem
cites work: Q5494167
cites work: The Location of Emergency Service Facilities
cites work: Solving two-stage robust optimization problems using a column-and-constraint generation method
cites work: A robust counterpart approach to the bi-objective emergency medical service design problem
DOI: 10.1016/J.EJOR.2019.05.011
description: scientific article; zbMATH DE number 7077323