IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/9403207.html
   My bibliography  Save this article

Path Optimization Model of Rural Red Tourist Attractions Based on Ant Colony Algorithm

Author

Listed:
  • Luxi Chen
  • Jia Chen
  • Gengxin Sun

Abstract

As an important historical and cultural heritage, rural red tourism sites have high historical, cultural, and social values. Moreover, rural red tourism sites are suitable for development and protection as tourism resources due to their unique landscape, architecture, culture, and art. In this paper, we propose a path generation model based on an ant colony algorithm to recommend the best path for tourists to visit rural red tourism sites. First, this paper investigates the modeling methods of path planning and multiobjective planning and their related solution algorithms to prepare for the establishment and solution of the tour path generation model for rural red tourism sites. By analyzing the problem description, this paper proposes the two model objectives of the shortest tour path and the highest total rating of the tourist attraction, and the model limitation of the total tour usage time, to model the model with a multiobjective planning approach. Then, by modifying the calculation of visibility and pheromone increments of the ant colony algorithm, the modified ant colony algorithm can take into account the two objectives of shortest path and highest total rating when constructing the path. Finally, this paper proposes to update the optimal path by using the number of ratings per unit path length as the update criterion of the optimal path.

Suggested Citation

  • Luxi Chen & Jia Chen & Gengxin Sun, 2022. "Path Optimization Model of Rural Red Tourist Attractions Based on Ant Colony Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-12, September.
  • Handle: RePEc:hin:jnlmpe:9403207
    DOI: 10.1155/2022/9403207
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/9403207.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/9403207.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/9403207?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:9403207. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.