Ambulance location and relocation problems with time-dependent travel times

摘要: Emergency service providers are facing the following problem: how and where to locate vehicles in order cover potential future demand effectively. Ambulances supposed be located at designated locations such that case of an emergency patients can reached a time-efficient manner. A patient is said covered by vehicle if (s)he ambulance within predefined time limit. Due variations speed resulting travel times it not sufficient solve static location problem once using fixed average times, as coverage areas themselves change throughout day. Hence we developed multi-period version, taking into account time-varying areas, allow repositioned maintain certain standard planning horizon. We have formulated mixed integer program for hand, which tries optimize various points simultaneously. The solved metaheuristically variable neighborhood search. show essential consider time-dependent respectively. When ignoring them objective will overestimated more than 24%. By these explicitly solution on improved 10%.