摘要： 讨论了一类NP-C问题——多弧权约束最短路问题通过对搜索操作和参数的合理设置提出求解多约束最短路问题的模拟退火算法,并 通过对实例的计算表明该算法能快速有效地求出多约束最短路问题的最优解.

关键词: 多约束, 最短路, 罚函数, 模拟退火

Abstract: The shortest path problem with multi-additional constraints in arcs is NP-Complete. A simulated annealing approach for this problem is proposed, and the actual computational results of examples show that the SA algorithm is feasible and efficient.

中图分类号: 

• TP301.6