IDEAS home Printed from https://ideas.repec.org/a/ids/ijpqma/v16y2015i4p434-444.html
   My bibliography  Save this article

Finding the shortest route surveying through proposed genetic algorithm

Author

Listed:
  • Fatemeh Jaferi
  • Seyed Mojtaba Sajadi

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.

Suggested Citation

  • Fatemeh Jaferi & Seyed Mojtaba Sajadi, 2015. "Finding the shortest route surveying through proposed genetic algorithm," International Journal of Productivity and Quality Management, Inderscience Enterprises Ltd, vol. 16(4), pages 434-444.
    • Handle: RePEc:ids:ijpqma:v:16:y:2015:i:4:p:434-444
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=72416
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijpqma:v:16:y:2015:i:4:p:434-444. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=177 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.