IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0257317.html
   My bibliography  Save this article

An improved ant colony optimization algorithm based on context for tourism route planning

Author

Listed:
  • Shengbin Liang
  • Tongtong Jiao
  • Wencai Du
  • Shenming Qu

Abstract

To solve the problem of one-sided pursuit of the shortest distance but ignoring the tourist experience in the process of tourism route planning, an improved ant colony optimization algorithm is proposed for tourism route planning. Contextual information of scenic spots significantly effect people’s choice of tourism destination, so the pheromone update strategy is combined with the contextual information such as weather and comfort degree of the scenic spot in the process of searching the global optimal route, so that the pheromone update tends to the path suitable for tourists. At the same time, in order to avoid falling into local optimization, the sub-path support degree is introduced. The experimental results show that the optimized tourism route has greatly improved the tourist experience, the route distance is shortened by 20.5% and the convergence speed is increased by 21.2% compared with the basic algorithm, which proves that the improved algorithm is notably effective.

Suggested Citation

  • Shengbin Liang & Tongtong Jiao & Wencai Du & Shenming Qu, 2021. "An improved ant colony optimization algorithm based on context for tourism route planning," PLOS ONE, Public Library of Science, vol. 16(9), pages 1-16, September.
    • Handle: RePEc:plo:pone00:0257317
    DOI: 10.1371/journal.pone.0257317
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0257317
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0257317&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0257317?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
    ---><---

    References listed on IDEAS

    as
    1. Sven Axsäter, 1990. "Simple Solution Procedures for a Class of Two-Echelon Inventory Problems," Operations Research, INFORMS, vol. 38(1), pages 64-69, February.
    2. Baohui Shi & Yuexia Zhang, 2021. "A Novel Algorithm to Optimize the Energy Consumption Using IoT and Based on Ant Colony Algorithm," Energies, MDPI, vol. 14(6), pages 1-17, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xuya Zhang & Yue Wang & Dongqing Zhang, 2024. "Location-Routing Optimization for Two-Echelon Cold Chain Logistics of Front Warehouses Based on a Hybrid Ant Colony Algorithm," Mathematics, MDPI, vol. 12(12), pages 1-22, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ganesh Janakiraman & John A. Muckstadt, 2009. "A Decomposition Approach for a Class of Capacitated Serial Systems," Operations Research, INFORMS, vol. 57(6), pages 1384-1393, December.
    2. Chew, E. P. & Johnson, L. A., 1996. "Service level approximations for multiechelon inventory systems," European Journal of Operational Research, Elsevier, vol. 91(3), pages 440-455, June.
    3. Prak, Derk & Teunter, Rudolf & Babai, M. Z. & Syntetos, A. A. & Boylan, D, 2018. "Forecasting and Inventory Control with Compound Poisson Demand Using Periodic Demand Data," Research Report 2018010, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    4. Hossein Abouee‐Mehrizi & Oded Berman & Hassan Shavandi & Ata G. Zare, 2011. "An exact analysis of a joint production‐inventory problem in two‐echelon inventory systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 713-730, December.
    5. Yao Zhao, 2008. "Evaluation and Optimization of Installation Base-Stock Policies in Supply Chains with Compound Poisson Demand," Operations Research, INFORMS, vol. 56(2), pages 437-452, April.
    6. Hossein Abouee-Mehrizi & Opher Baron & Oded Berman, 2014. "Exact Analysis of Capacitated Two-Echelon Inventory Systems with Priorities," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 561-577, October.
    7. Gumus, Alev Taskin & Guneri, Ali Fuat & Ulengin, Fusun, 2010. "A new methodology for multi-echelon inventory management in stochastic and neuro-fuzzy environments," International Journal of Production Economics, Elsevier, vol. 128(1), pages 248-260, November.
    8. Rizwan Aslam Butt & Adnan Akhunzada & Muhammad Faheem & Basit Raza, 2022. "Enhanced Energy Savings with Adaptive Watchful Sleep Mode for Next Generation Passive Optical Network," Energies, MDPI, vol. 15(5), pages 1-17, February.
    9. Martinez de Albeniz, Victor & Lago, Alejandro, 2007. "Myopic inventory policies using individual customer arrival information," IESE Research Papers D/719, IESE Business School.
    10. Xin Xu & Yao Zhao & Ching-Yu Chen, 2016. "Project-driven supply chains: integrating safety-stock and crashing decisions for recurrent projects," Annals of Operations Research, Springer, vol. 241(1), pages 225-247, June.
    11. E. P. Chew & L. A. Johnson, 1995. "Service levels in distribution systems with random customer order size," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(1), pages 39-56, February.
    12. Melinda Timea Fülöp & Miklós Gubán & György Kovács & Mihály Avornicului, 2021. "Economic Development Based on a Mathematical Model: An Optimal Solution Method for the Fuel Supply of International Road Transport Activity," Energies, MDPI, vol. 14(10), pages 1-22, May.

    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:plo:pone00:0257317. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.