Abstract: 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.