两点沿曲面最短路径的遗传算法研究

求两点沿曲面最小距离的关键是正确选择两点间沿曲面的最短路径。遗传算法是一种全局性概率搜索算法。它在整个问题空间实施搜索,可得到问题的全局最优解,本文应用了遗传算法的理论与方法。首先,将整个曲面作为搜索空间,路径长度作为目标函数,设定了路径优化问题。其次,建立了椭圆坐标系,满足了遗传编码完备性的要求,实现了二维实数编码。运用排序选择方法,单一交叉和最小变异操作,完成了遗传算法,同时获得了最短路径。该方法适用于各种形式的曲面。

The Study on Genetic Algorithm to Seek Shortest Route between Two Points along Curved Surface

The key to get the minimum distance between two points on the curved surface is to choice the shortest route in the surface.The genetic algorithm is one of the global probability search algorithms.It implements search in the whole problem domain,which could obtain the most optimal solution.In order to seek the shortest route between two points along surface,this paper presents a new method with genetic algorithm.First,curved surface is considered as the search field and the length of route as the objective function,thus the optimization problem of route is set.Second,the ellipse coordinate system is established for the sake of satisfying the perfection of code.And two-dimensional real number coding is realized.Using sequencing selection,single intersect and the minimum operator of variation,the calculation of genetic algorithm is finished,then the optimum solution for shortest route is obtained.