Simulated Annealing Approach for a Kind of Shortest Path Problem with Multi-additional Constraints
Qiang Han · Jisuanji gongcheng · 2004
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.