Research On Global Optimization Nonlinear Optimization Method Of Global Shortest Path Programing

System global shortest path is one of the classic nonlinear combinatorialoptimization problems. It has extensive applications in engineering practices. Theminimum Steiner tree theory is the basis theory of global shortest path. So researchedthe global optimization algorithm for the minimum Steiner tree has importanttheoretical significance and wide application. Since the minimum Steiner tree problemhas been proved to be NP-hard problem, unless P=NP, or else Steiner tree problemdoes not exist polynomial-time algorithm, so find the suitable intelligent optimizationalgorithms to is an effective way to solve this problem.Based on the theory of minimum Steiner tree and physical visualizationexperiment,we explore solving methods of system global shortest path. Depending onthe physical visual experiment, we use experiment approach-algorithm-experimentapproach-project application as our research route. By the analysis of experimentalresults,we obtain the shortest path of F-convex road by designing the longest sideelimination method. This path is the full minimum Steiner tree of the points of F-convex road. The full minimum Steiner tree of the complex system is not necessarilyshortest path.We design subsection-deleting sides algorithm to solve general pointset.At first we find out the F-convex roads which contains the longest sides and themost points,then constructe the full minimum Steiner tree of these roads according tosubsection-deleting sides algorithm and delete the F-convex road. Minimum spanningtree in the other algorithm is often as optimal solution which compare with results,while subsection-deleting sides algorithm optimize minimum spanning tree of fixedpoints, so the optimization effect is very effective, compared with result ofvisualization experiment, the approximate proportion is99.84％.It verified the feasibility of algorithm by simple graphical examplein this paper. Bythree detailed examples, such as Highway optimization design in Henan cities, Griddesign in Haiyang city and the optimal design of communication network problem. we compare the data from the subsection-deleting sides algorithm with the minimumspanning tree, and verified practicality and effectiveness of algorithm. These examplesverified that the algorithm used with visual experiment can solve engineering practicalproblems, and lay the foundation for further method improving.