Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming-Reference-Cited by-同舟云学术

Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming

Published:2012-06 Issue:3 Volume:219 Page:611-621
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Schmid Verena

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference25 articles.

1. Neuro-Dynamic Programming;Bertsekas,1996

2. Ambulance location and relocation models;Brotcorne;European Journal of Operational Research,2003

3. The maximal covering location problem;Church;Papers in Regional Science,1974

4. A maximum expected covering location model: Formulation, properties and heuristic solution;Daskin;Transportation Science,1983

5. Heuristic solution of an extended double-coverage ambulance location problem for Austria;Doerner;Central European Journal of Operations Research,2005

Cited by 208 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scalable policies for the dynamic traveling multi-maintainer problem with alerts;European Journal of Operational Research;2024-11

2. A stochastic programming model for ambulance (re)location–allocation under equitable coverage and multi-interval response time;Expert Systems with Applications;2024-09

3. Enhancing Concurrent Emergency Response: Joint Scheduling of Emergency Vehicles on Freeways with Tailored Heuristic;Applied Sciences;2024-08-23

4. Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions;Computers & Operations Research;2024-07

5. Dynamic migratory beekeeping route recommendation based on spatio-temporal distribution of nectar sources;Annals of Operations Research;2024-06-04