IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i23p16141-d1284237.html
   My bibliography  Save this article

Hybrid Integrated Computing Algorithm for Sustainable Tourism

Author

Listed:
  • Yuan-Hsun Liao

    (Department of Computer Science, Taughai University, Taichung 407224, Taiwan)

  • Po-Chun Chang

    (Department of Computer Science, Taughai University, Taichung 407224, Taiwan)

  • Hsiao-Hui Li

    (Department of Maritime Information and Technology, National Kaohsiung University of Science and Technology, Cijin Campus, Kaohsiung 805301, Taiwan)

Abstract

To avoid destroying the natural environment, we can create tourist paths without disrupting ecological systems or rare places such as rainforests that contain endangered species. Likewise, in sustainable tourism, we should consider visiting national parks or national museums as a way to understand the core values and the meaning of that culture and environment more clearly. In this paper, we consider which points tourists need to avoid or visit for sustainable tourism. We designed an algorithm that can give a path to avoid certain points or to go to a preferred point. If this algorithm does not give any weight, it will give the shortest path from the start to the end, and it can decide which vertices to avoid or travel to. Moreover, it can be used to vary the weights of different positive or negative values to obtain a path to avoid a point or to reach a point. Compared to Dijkstra’s algorithm, we can add a negative weight to the graph and still find the shortest path. In application, it can be used for path schedule decisions. We did not wave the large resources to calculate the walk length. In the usage scenario, users only need to provide the starting node, end node, avoidance point, and facing point to calculate the best path. This algorithm will give a good path for users. At the same time, users can use this algorithm to implement sustainable travel route planning, such as going to museums, avoiding rare environments, etc. So, this algorithm provides a new way to decide the best path. Finally, the experimental results show that the classic algorithms cannot avoid points. In real tourism, tourists can use this algorithm for travel planning to achieve sustainable tourism.

Suggested Citation

  • Yuan-Hsun Liao & Po-Chun Chang & Hsiao-Hui Li, 2023. "Hybrid Integrated Computing Algorithm for Sustainable Tourism," Sustainability, MDPI, vol. 15(23), pages 1-22, November.
  • Handle: RePEc:gam:jsusta:v:15:y:2023:i:23:p:16141-:d:1284237
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/23/16141/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/15/23/16141/
    Download Restriction: no
    ---><---

    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:gam:jsusta:v:15:y:2023:i:23:p:16141-:d:1284237. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.