In this paper, the roads planning in the resort are taken as an example of application in Genetic Algorithm. Modeling the problem with target function and constraint condition to satisfy the minimum construction cost (which is converged to the minimum total length of roads), the problem is solved by using Genetic Algorithm with random operation in MATLAB. | Journal of Automation and Control Engineering, Vol. 1, No. 1, March 2013 Research and Implementation of Tourism Resort Roads Optimal Planning Model Based on Genetic Algorithm Han Tuo Astronomy School, Northwestern Polytechnical University, Xi’an, Shaanxi 710072 CHINA E-mail: 244112808@ Abstract—After a brief review of the theory involved, results of optimal planning research based on Genetic Algorithm are presented. In this paper, the roads planning in the resort are taken as an example of application in Genetic Algorithm. Modeling the problem with target function and constraint condition to satisfy the minimum construction cost (which is converged to the minimum total length of roads), the problem is solved by using Genetic Algorithm with random operation in MATLAB. I optimize the total length in six cases to get the number and coordinate of “nodes” when these nodes satisfy the minimum total length. Then the planning problem on the minimum total fee converts to an optimal planning problem on the minimum total length of all roads. Each length of each road is scaled from a node to another node. The node here is where each road changes its orientation (all nodes here, including the resort entrances, obviously). I assume that there’s a rectangular tourism resort which has eight entrances on the resort border. The number of nodes inside the resort is vibration n. Assumptions also include the following three aspects: Roads in the resort are all straight lines; Nodes’ length of roads is negligible; Each node can be simplified as a coordinate in a two dimensional coordinate system. Index Terms—genetic algorithm, optimization, planning model, random operation. B. Modeling As the above assumption said, the number of nodes in the resort is n+8. Then I can calculate the distance between each node. A weighted adjacency matrix W (in which the weight of each road is presented by , values of i can be taken as 1-8, and values of j can be taken as 1-7) can be produced .
