Optimal path algorithm with multi-constrained condition
带多约束条件的最优路径选择算法研究

Traditional heuristic algorithm converts the NP-complete problem to a simpler one that can be solved in polynomial time. However, it cannot guarantee a solution all the time. In this paper, the Lagrange relaxation was applied to traditional heuristic algorithm to improve the successful rate of finding an optimal path and to reduce the time complexity. Finally, the correctness and effectiveness of this algorithm are proved through experiment and analysis.