基于禁忌搜索的生化恐怖事件车辆路径问题研究

生化恐怖袭击事件是一类罕见但危害极大的突发事件。这类事件发生时,如何高效地利用有限的车辆等资源,在有限的时间内,将事发地受攻击人群尽快地送到附近的医院,并且使他们得到适当的治疗,是非常重要的。根据日本的沙林毒气事件和‘9.11’后炭疽事件等恐怖事件的经验教训,结合我国都市的特点,建立了针对生化恐怖突发事件中一特定场景的随机VRP模型,拟在"黄金救助时间"内将受害者送往各医院。基于禁忌搜索算法来求解该模型,并将该模型及算法集成到应急决策支持系统中,以算例进行仿真分析和比较,验证了模型的合理有效性,并说明了算法的应用性。

The Vehicle Routing Problem Based on the Tabu Search Algorithm for Responding to Biochemical Terrorist Attacks

Biochemical terrorist attacks are of rare but greatly dangerous events.When they happen,it is very important to efficiently utilize the limited resources such as cars in a limited period of time in order to send the attacked persons to the nearby hopitals and ensure that they are properly treated medically.According to the terrorist attacks which took place in Japan and US not long ago,as well as the characteristics of the cities in our country,we build a random VRP model for a particular scene in biochemical terrorist events for the victems to be sent to respective hospitals.We build the model based on the tabu search algorithm,integrate the model and the algorithm into an emergent decision-supporting system,analyse and compare the computing instances by simulation,verify the rationality of effectiveness of the model,and show the applicability of the algorithm.