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

Bertsekas, 1996 Brotcorne, 2003, Ambulance location and relocation models, European Journal of Operational Research, 147, 451, 10.1016/S0377-2217(02)00364-8 Church, 1974, The maximal covering location problem, Papers in Regional Science, 32, 101, 10.1007/BF01942293 Daskin, 1983, A maximum expected covering location model: Formulation, properties and heuristic solution, Transportation Science, 17, 48, 10.1287/trsc.17.1.48 Doerner, 2005, Heuristic solution of an extended double-coverage ambulance location problem for Austria, Central European Journal of Operations Research, 13, 325 Gendreau, 1997, Solving an ambulance location model by tabu search, Location Science, 5, 75, 10.1016/S0966-8349(97)00015-6 Gendreau, 2001, A dynamic model and parallel tabu search heuristic for real-time ambulance relocation, Parallel Computing, 27, 1641, 10.1016/S0167-8191(01)00103-X Gendreau, 2006, The maximal expected coverage relocation problem for emergency vehicles, Journal of the Operational Research Society, 57, 22, 10.1057/palgrave.jors.2601991 Godfrey, 2002, An adaptive dynamic programming algorithm for dynamic fleet management, I: Single period travel times, Transportation Science, 36, 21, 10.1287/trsc.36.1.21.570 Godfrey, 2002, An adaptive dynamic programming algorithm for dynamic fleet management, II: Multiperiod travel times, Transportation Science, 36, 40, 10.1287/trsc.36.1.40.572 Laporte, 2009, Applications of the double standard model for ambulance location, 235 Maxwell, M.S., Henderson, S.G., Topaloglu, H., 2009. Ambulance redeployment: An approximate dynamic programming approach. In: Rossetti, M.D., Hill, R.R., Johansson, B., Dunkin, A., Ingalls, R.G. (Ed.), Proceedings of the 2009 Winter Simulation Conference. Maxwell, 2010, Approximate dynamic programming for ambulance redeployment, INFORMS Journal on Computing, 22, 266, 10.1287/ijoc.1090.0345 Powell, 2007 Powell, 2010, Merging AI and OR to solve high-dimensional stochastic optimization problems using approximate dynamic programming, INFORMS Journal on Computing, 22, 2, 10.1287/ijoc.1090.0349 Powell, 2005, Fleet management, 185 Powell, 2001, A representational paradigm for dynamic resource transformation problems, Annals of Operations Research, 104, 231, 10.1023/A:1013111608059 Rajagopalan, 2008, A multiperiod set covering location model for dynamic redeployment of ambulances, Computers and Operations Research, 35, 814, 10.1016/j.cor.2006.04.003 Repede, 1994, Developing and validating a decision support system for location emergency medical vehicles in louisville, kentucky, European Journal of Operational Research, 75, 567, 10.1016/0377-2217(94)90297-6 Ruszczyński, 2010, Post-decision states and separable approximations are powerful tools of approximate dynamic programming, INFORMS Journal on Computing, 22, 20, 10.1287/ijoc.1090.0351 Schmid, 2010, Ambulance location and relocation problems with time-dependent travel times, European Journal Of Operational Research, 207, 1293, 10.1016/j.ejor.2010.06.033 Simão, 2009, An approximate dynamic programming algorithm for large-scale fleet management: A case application, Transportation Science, 43, 178, 10.1287/trsc.1080.0238 Sutton, 1998 Thirion, A., 2006. ModFles de localisation et de rTallocation d’ambulances: Application aux communes en provinces de Namur et Brabant Wallon. Ph.D. thesis, FacultTs Universitaires Notre-Dame de la Paix, Namur, Belgium. Toregas, 1971, The location of emergency service facilities, Operations Research, 19, 1363, 10.1287/opre.19.6.1363