重大事故救灾路线双目标优化模型及算法

运用运筹学的理论和方法，建立一种重大事故救灾路线双目标优化数学模型.基于启发式算法思想，提出适合该模型且收敛速度较快的优化算法.该算法通过构造辅助函数调用Dijkstra算法，在最优解的近似区间内多次迭代逐渐逼近最优解，实现了双权重网络图最短路的求解，是一种近似的、快速的算法.基于所构造辅助函数的性质，给出实现该算法的具体步骤.对误差进行线性估计，分析了该算法收敛速度的影响因素，并讨论了算法的时间复杂度及优势.最后在案例分析中编译并运行该算法，证实其模拟结果与理论分析结论相吻合. 

Bi-objective optimization model and algorithm of rescue routes during major accident time

A bi-objective optimization model of rescue routes was built by using the operations research theory. An algorithm which suites to solve the model and has rapid convergence rate was proposed on the basis of heuristic algorithms. This algorithm calls the Dijkstra algorithm by constructing auxiliary functions, gradually approach optimal solutions in the approximate range of optimal solutions by multiple iterations and finally obtain the shortest path of the double-weighted network, therefore it is a fast, approximate algorithm. The specific steps of the algorithm were listed by analyzing the nature of auxiliary functions. The error and influence factors on the convergence rate were analyzed, and the time complexity and the advantages of the algorithm were also discussed. Finally, the algorithm was compiled and implemented in a specific case, and the results are proved to be consistent with theoretical conclusions.