The Shortest Path Finding of Independent Multiple Constraints
Huang You-wena · Journal of Jiangxi University of Science and Technology · 2011
The shortest path problem is one of the most important issues in communication and transportation as well as an NP-complete problem.How to select an appropriate cost function is essential to solve this problem,.This paper focuses on the independent multiple constraints path finding and provides a theoretical framework on selecting the cost function for the independent multiple constraints path finding.Finally the framework is applied to shortest path selecting,and the result shows that the instantiation cost function can successfully help find a feasible path.