Finding the shortest route surveying through proposed genetic algorithm

Finding the shortest route surveying through proposed genetic algorithm

0.00 Avg rating0 Votes
Article ID: iaor201529174
Volume: 16
Issue: 4
Start Page Number: 434
End Page Number: 444
Publication Date: Oct 2015
Journal: International Journal of Productivity and Quality Management
Authors: ,
Keywords: combinatorial optimization, heuristics: genetic algorithms
Abstract:

Surveying has long been one of the techniques used by human beings to determine the limits of lands. Today, this science is witnessed in all engineering tasks. The main objective of surveying is to determine the relative position of points on land surface or close to it. To survey on area, the distance between the existing lands must be covered. This paper intends to locate a tree in the area so that the shortest route may be covered. Therefore, the satellite map of the area is studied prior to surveying and a graph, which involves five benchmarks and their distances, is attained. The minimum spanning tree between the locations is then obtained by means of metaheuristic genetic algorithm (GA). When the tree (i.e., route) is located, surveying of the area can be made via covering the shortest route, decreasing the surveying time and increasing its efficiency.

Reviews

Required fields are marked *. Your email address will not be published.