Study of shortest paths optimization algorithm based on obstructed distance under complexity geographical environment
Sun Yon · Cehui kexue · 2014
For the matter of the shortest path optimization problem under complex geographical environment,this paper designed the optimization algorithm based on obstructed distance.The algorithm introduced the concepts of surface distance,obstacle distance,considering the spatial information such as geographic spatial elevation,slope,obstacles and so on,in order to suit for the distance compute between objects under complexity geographical environment.Moreover,it constructed the complete topologic relationship network through determining the searching space,searching direction and the network's path weight based on the target geographical spatial networking.Finally,genetic algorithm was applied to the route optimization,and experimental result verified the feasibility of the algorithm.