A new evolutionary algorithm for the shortest path planning on curved surface
Finding the shortest path between two given points over a curved surface is very important both in theoretically and practically. This article introduces the frame of genetic algorithm and with the help of the biological theory of DNA technology, it simulates double helix structure and utilizes molecular satisfying the Watson-Crick complementary condition to code and operate. DNA-GA inherited global search capability, enhanced the validity and the speed of convergence, and avoided the premature and lower convergent speed of the classic genetic algorithm, It fits for solving the problem of finding the shortest path on a curved surface. A numerical simulation example was presented at the end of the paper in order to testify the effectiveness and validity