摘要
针对城市交通非常规突发事件,在"出救点"和"应急点"已知情况下,研究了多目标下应急资源调度的最优路径问题。对问题进行了描述,建立了时间最短、费用最小的应急资源调度最优路径选择优化模型,将蚁群算法进行改进,结合改进的TOPSIS法求解最优方案,给出了仿真算例。
Targeting urban traffic unconventional emergencies,under the condition that a＂save point＂,and＂emergency point＂have been given,this paper studies the problem of optimal path of emergency resource scheduling under the multi-objectives.It first describes the problem,and then constructs the optimization model for optimal path selection in emergency resource scheduling of the shortest settling time and minimum cost.Meanwhile,the optimal program is given by referring to an improved ant colony algorithm together with the improved TOPSIS method.At last,this paper proposes a simulation example.
出处
《北京理工大学学报（社会科学版）》
CSSCI
2010年第6期65-68,共4页
Journal of Beijing Institute of Technology：Social Sciences Edition
基金
国家自然科学基金资助项目(70671025)
教育部人文社科研究资助项目(09YJA630021)
江苏省自然科学资助项目(BK2009290)
江苏省交通科学研究计划资助项目(09R12)
关键词
资源调度
最优路径
蚁群算法
resource scheduling
optimal path
ant colony algorithm
