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

► We investigated dispatching and relocation decisions of emergency service providers. ► ADP is powerful in solving the underlying stochastic and dynamic optimization problem. ► Average response time can be improved by using more flexible dispatching rules. ► Relocating ambulances proactively improv...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 219; no. 3; pp. 611 - 621
Main Author:	Schmid, Verena
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.06.2012 Elsevier Elsevier Sequoia S.A North-Holland Pub. Co
Subjects:	Ambulance location Ambulance services Applied sciences Approximate dynamic programming Approximation Biological and medical sciences Dynamic programming Economy. Management Emergency vehicles Exact sciences and technology Health and social institutions Mathematical programming Medical sciences Operational research and scientific management Operational research. Management science Optimization algorithms OR in health services Public health. Hygiene Public health. Hygiene-occupational medicine Stochastic optimization Studies Austria Ambulance location Approximate dynamic programming Emergency vehicles Stochastic optimization OR in health services Dispatching problem Operations research Medical transport Transit time Modeling Location problem Optimization Time dependence Emergency department Ambulance Dynamic programming Localization Mathematical programming Travel time Hospital management Empirical method Routing Real time Stochastic programming Response time Time average Emergency Service Proposal
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!