| 摘要 |
PURPOSE:To provide the shortest closed loop connecting N nodes. CONSTITUTION:Nodes A and B comprising the longest branch are selected from all nodes. Then nodes C and D most apart from a line segment AB are selected on each side. The intersections of a vertical line drawing from the nodes C and D to the line segment AB are taken as E and F to be divided into four areas: AEC separated by line segments AE and EC, CEB separated by line segments CE and EB, BFD separated by line segments BF and FD, and DFA separated by line segments F and FA. In each area, a route through all nodes is prepared to find the approximated solution of the shortest closed loop by synthesizing the four routes. |
