电子科技大学学报(社会科学版)
電子科技大學學報(社會科學版)
전자과기대학학보(사회과학판)
JOURNAL OF UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA(SOCIAL SCIENCES EDITION)
2013年
3期
22-25
,共4页
应急疏散%时间限制%车辆调度
應急疏散%時間限製%車輛調度
응급소산%시간한제%차량조도
emergency evacuation%time limitation%vehicle scheduling
在各疏散点完成疏散具有最晚时间限制的条件下,研究了避难所完成疏散任务的车辆征集计划及出车任务安排,分别以最小化疏散总费用及最小化疏散总时间为目标建立了两个应急疏散车辆调度优化模型。通过约束条件增维降低了模型计算的难度,并利用CPLEX求解软件对同一个算例的两种不同目标函数进行了比较计算。
在各疏散點完成疏散具有最晚時間限製的條件下,研究瞭避難所完成疏散任務的車輛徵集計劃及齣車任務安排,分彆以最小化疏散總費用及最小化疏散總時間為目標建立瞭兩箇應急疏散車輛調度優化模型。通過約束條件增維降低瞭模型計算的難度,併利用CPLEX求解軟件對同一箇算例的兩種不同目標函數進行瞭比較計算。
재각소산점완성소산구유최만시간한제적조건하,연구료피난소완성소산임무적차량정집계화급출차임무안배,분별이최소화소산총비용급최소화소산총시간위목표건립료량개응급소산차량조도우화모형。통과약속조건증유강저료모형계산적난도,병이용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.