一种应急系统车辆调度问题的求解算法  

An Algorithm of Vehicle Dispatching in Emergency System

作　　者：陈岳明[1] 萧德云[1] 

机构地区：[1]清华大学,北京100084

出　　处：《交通与计算机》2008年第1期24-26,43,共4页Computer and Communications

基　　金：国家"十五"科技攻关项目(批准号:2005BA414B09);国家"十一五"科技支撑项目(批准号:2007BAK12B15)资助

摘　　要：在应急系统中救援车辆调度对于提高应急响应能力、节约救援时间和降低生命财产损失发挥重要的作用。结合实际路网的特征,提出了以应急时间最短为优化目标函数,证明目标函数满足文中给出的最优调度函数定义。在此基础上,运用凸组合算法求解目标函数并进行了算法设计。仿真算例表明了所提目标函数的合理性及算法设计的有效性。Vehicle dispatching plays an important part in improving event reaction ability, saving rescue time, and reducing property losses in emergency system. Based on the characteristics of emergency rescue, an optimal object function based on the shortest emergency time was established, and was proved to satisfy the definition of the best dispatching plan. An algorithm based on convex combination method was also proposed. Finally, an example illustrates that the optimal objective is rational and the algorithm is effective.

关 键 词：应急系统 非线性规划 凸组合 

分 类 号：U491[交通运输工程—交通运输规划与管理]