Show simple item record

dc.contributor.authorRestrepo, Mateo
dc.date.accessioned2008-07-21T12:23:39Z
dc.date.available2013-07-21T06:25:42Z
dc.date.issued2008-07-21T12:23:39Z
dc.identifier.otherbibid: 6397199
dc.identifier.urihttps://hdl.handle.net/1813/11121
dc.description.abstractWe propose new approaches to tackle the problems of static and dynamic ambulance fleet allocation. Static ambulance fleet allocation refers to deciding on home bases for ambulances, to which they return after serving calls. The number and location of bases are given. The goal is to keep response times to calls as small as possible. The first part introduces two models for this problem. Both of them are based on the Erlang loss formula. The first model is stylized and serves to illustrate that allocating ambulances to bases in proportion to base offered load is often non-optimal. The second model is similar in spirit to queueing theoretical models developed in the past but uses the but uses the Erlang loss function as a key ingredient. A careful computational comparison shows that the predictions obtained from our model are often more accurate than those produced by previous models, especially in low utilization regimes. This model can be used as a prescreening tool to find promising candidate allocations to be further evaluated through detailed simulation. Dynamic redeployment concerns the real-time relocation of idle ambulances so as to ensure better preparedness. The second part of this dissertation formulates this problem as a dynamic program in a high-dimensional and uncountable state space, and then resorts to approximate dynamic programing (ADP) techniques to obtain approximate solutions. To this end, a specially tailored approximation architecture for the problem is developed. The architecture depends on a small number of free parameters which are tuned using simulated cost trajectories of the system and linear regression. Computational experiments show that the relocation policies obtained from this approach offer significant performance improvements relative to benchmark static-relocation policies. In the third part we use the linear programming approach to ADP on the dynamic-redeployment problem, using the previously developed approximation architecture. We conclude that, although the policies obtained are comparable in quality to those obtained using regression, there are serious issues related to numerical stability. Furthermore, the amount of computation required makes this approach less practical than the regression-based one.en_US
dc.language.isoen_USen_US
dc.subjectambulanceen_US
dc.subjectdeploymenten_US
dc.subjectrelocationen_US
dc.subjectlogisticsen_US
dc.titleCOMPUTATIONAL METHODS FOR STATIC ALLOCATION AND REAL-TIME REDEPLOYMENT OF AMBULANCESen_US
dc.typedissertation or thesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics