A Method for Automatic Routing Based on Route Binary Tree

The high-quality routing on an electronic navigational chart is significant to safe,economical navigation for ships.Aiming to greedy weakness existing in automatic routing methods,this paper proposes an automatic algorithm for routing of ships based on route binary tree.Based on the definition and construction of route binary tree,the algorithm utilizes "Store in Section" to store the information of route binary tree,decomposes the information through "The Depth Priority" combined with "Sounding out Searching",and chooses the shortest distance-route automatically from the feasible routes finally.The experimental result shows the proposed method can overcome the drawback of traditional automatic routing algorithms,and improve the optimization result.