摘要
在各疏散点完成疏散具有最晚时间限制的条件下,研究了避难所完成疏散任务的车辆征集计划及出车任务安排,分别以最小化疏散总费用及最小化疏散总时间为目标建立了两个应急疏散车辆调度优化模型。通过约束条件增维降低了模型计算的难度,并利用CPLEX求解软件对同一个算例的两种不同目标函数进行了比较计算。
This paper is concerned with the vehicle acquisition and scheduling problem for emergency evacuation under time limitation. Two vehicle scheduling models are established considering the minimum total evacuation costs and the minimum total evacuation time respectively. The computing difficulty of model is reduced by increasing the dimensions of constrains. Finally, an example is solved by using the CPLEX solver to illustrate computational results with different objective functions.
出处
《电子科技大学学报(社科版)》
2013年第3期22-25,共4页
Journal of University of Electronic Science and Technology of China(Social Sciences Edition)
基金
教育部人文社会科学青年基金资助项目(10YJC630360)
浙江省自然科学基金资助项目(Y6110730)
关键词
应急疏散
时间限制
车辆调度
emergency evacuation
time limitation
vehicle scheduling