Improving Emergency Medical Dispatching with Emphasis on Mass-Casualty Incidents
暂无分享,去创建一个
[1] David Pisinger,et al. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..
[2] Paolo Toth,et al. An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.
[3] Richard F. Hartl,et al. Adaptive large neighborhood search for service technician routing and scheduling problems , 2012, J. Sched..
[4] John H. Holland,et al. Outline for a Logical Theory of Adaptive Systems , 1962, JACM.
[5] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[6] Jean-Charles Billaut,et al. A tabu search heuristic for the dynamic transportation of patients between care units , 2011, Eur. J. Oper. Res..
[7] Christine L. Mumford,et al. Constructing initial solutions for the multiple vehicle pickup and delivery problem with time windows , 2012, J. King Saud Univ. Comput. Inf. Sci..
[8] Chengbin Chu,et al. The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments , 2008, Eur. J. Oper. Res..
[9] Gilbert Laporte,et al. The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..
[10] Thomas Hanne,et al. Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals , 2009, Interfaces.
[11] Stefan Biffl,et al. Strategies in Support Ambulance Scheduling with Efficient Routing Services , 2009, Wirtschaftsinformatik.
[12] Michel Gendreau,et al. A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..
[13] David Pisinger,et al. A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..