Study on Real-Time Vehicle Scheduling Problem to Rescue Victims in Chemical and Biological Terrorist Attacks
Considering the real-time information (the number of new infection victims, the changed treatment capacity of hospitals and so on), we study the real-time vehicle scheduling problem to rescue victims with constraint of prime rescue time in multi-location chemical and biological terrorist attacks (CBTAs) and propose a mathematical model. Then, an algorithm with an event-time vector is designed to solve the mathematical model. We take computational experiments under small-scale CBTAs and large-scale CBTAs and obtain the optimal vehicle scheme. Experimental results show the model, and solution algorithm could be useful in practical CBTAs.
KeywordsChemical and biological terrorist attacks (CBTAs) Prime rescue time Vehicle scheduling problem Real-time information Event-time vector
This work is supported by National Basic Research Program of China (973 Program) with Grant No. 2011CB706900, National Natural Science Foundation of China (Grant No. 70971128), Beijing Natural Science Foundation (Grant No. 9102022), and the President Fund of GUCAS (Grant No.O95101HY00).
- 4.Recommendations of the CDC Strategic Planning Workgroup (2000) Biological and chemical terrorism: strategic plan for preparedness and response. MMWR Recomm Rep 49(4):1–14Google Scholar
- 5.Newgard CD, Schmicker RH et al (2010) Emergency medical services intervals and survival in trauma: assessment of the “Golden Hour” in a North American Prospective Cohort. Ann Emerg Med 55(3):235–246.e4Google Scholar
- 18.Liu Z, Yu H, Sui J, Liu D, Wang J (2011) A research on vehicle scheduling problem to rescue the victims from chemical and biological terrorist attacks. In: 2011 IEEE international conference on automation and logistics (ICAL), pp 356–361Google Scholar