Improving fairness in ambulance planning by time sharing

DOI10.1016/j.ejor.2019.08.003zbMath1430.90378OpenAlexW2967523051WikidataQ127405761 ScholiaQ127405761MaRDI QIDQ2327642

Yanyan Li

Publication date: 15 October 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.08.003

zbMATH Keywords

fairnessmulti-objective optimizationnonlinear optimizationfacility locationOR in health services

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (2)

Computing welfare-maximizing fair allocations of indivisible goods ⋮ Fair resource allocation: using welfare-based dominance constraints

Uses Software

• Ipopt
• SITATION
• MOD-DIST
• MENU-OKF
• JuMP
• GitHub
• JEMSS.jl

Cites Work

• Unnamed Item
• Unnamed Item
• Improving emergency service in rural areas: a bi-objective covering location model for EMS systems
• Ambulance location and relocation problems with time-dependent travel times
• A multiobjective model for locating undesirable facilities
• Equity measurement in facility location analysis: A review and framework
• Ambulance location and relocation models.
• Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
• Covering models and optimization techniques for emergency response facility location and planning: a review
• A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Time-dependent MEXCLP with start-up and relocation cost
• A New Formulation and Resolution Method for the p-Center Problem
• Approximate Dynamic Programming for Ambulance Redeployment
• The Price of Fairness
• Computing in Operations Research Using Julia
• Ambulance location for maximum survival
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Solving an ambulance location model by tabu search
• Cooperative facility location games
• Multicriteria Optimization
• A dynamic model and parallel tabu search heuristic for real-time ambulance relocation

This page was built for publication: Improving fairness in ambulance planning by time sharing