IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i23p3670-d1527728.html
   My bibliography  Save this article

A Fuzzy Variable H Strategy Based Ripple-Spreading Algorithm to Find the k Shortest Paths

Author

Listed:
  • Yingfei Zhang

    (College of Safety Science and Engineering, Civil Aviation University of China, Tianjin 300300, China)

  • Xiaobing Hu

    (College of Safety Science and Engineering, Civil Aviation University of China, Tianjin 300300, China
    School of Engineering, University of Warwick, Coventry CV4 7AL, UK
    Collaborative Innovation Center of Etourism, Beijing Union University, Beijing 100101, China)

  • Hang Li

    (College of Safety Science and Engineering, Civil Aviation University of China, Tianjin 300300, China)

  • Gongpeng Zhang

    (Collaborative Innovation Center of Etourism, Beijing Union University, Beijing 100101, China)

  • Chi Zhang

    (Beijing College of Politics and Law, Beijing 102628, China)

  • Mark S. Leeson

    (School of Engineering, University of Warwick, Coventry CV4 7AL, UK)

Abstract

Ripple-spreading Algorithm (RSA) is a relatively new, nature-inspired, multi-agent based method for path optimization. This paper demonstrates that by modifying the micro-level behaviors of nodes and ripples, RSA achieves good scalability for solving the k shortest paths problem ( k − SPP ). Initially, each node may generate k or more ripples to guarantee optimality. To improve computational efficiency for large-scale problems, we propose an approximate RSA (ARSA), where nodes generate no more than h ripples ( 1 ≤ h < k ). While this reduces optimality, it significantly improves efficiency. Further, we introduce a fuzzy variable H strategy, FVHSRSA, to strike a better balance between optimality and efficiency. The optimality/efficiency of ARSA may still suffer if it uses a constant h too small/large. This strategy allows nodes closer to the destination to generate more ripples, while nodes farther away use fewer ripples. By dynamically adjusting h , FVHSRSA achieves a better trade-off between optimality and efficiency. Comprehensive experiments on 4 common network categories validate the effectiveness and efficiency of FVHSRSA in solving the k − SPP .

Suggested Citation

  • Yingfei Zhang & Xiaobing Hu & Hang Li & Gongpeng Zhang & Chi Zhang & Mark S. Leeson, 2024. "A Fuzzy Variable H Strategy Based Ripple-Spreading Algorithm to Find the k Shortest Paths," Mathematics, MDPI, vol. 12(23), pages 1-26, November.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:23:p:3670-:d:1527728
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/23/3670/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/23/3670/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Thomas, Barrett W. & White III, Chelsea C., 2007. "The dynamic shortest path problem with anticipation," European Journal of Operational Research, Elsevier, vol. 176(2), pages 836-854, January.
    2. Duncan J. Watts & Steven H. Strogatz, 1998. "Collective dynamics of ‘small-world’ networks," Nature, Nature, vol. 393(6684), pages 440-442, June.
    3. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    4. Hu, Xiao-Bing & Zhang, Ming-Kong & Zhang, Qi & Liao, Jian-Qin, 2017. "Co-Evolutionary path optimization by Ripple-Spreading algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 411-432.
    Full references (including those not matched with items on IDEAS)

    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. Jie, Ke-Wei & Liu, San-Yang & Sun, Xiao-Jun & Xu, Yun-Cheng, 2023. "A dynamic ripple-spreading algorithm for solving mean–variance of shortest path model in uncertain random networks," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    2. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    3. Yinfeng Xu & Huili Zhang, 2015. "How much the grid network and rescuers’ communication can improve the rescue efficiency in worst-case analysis," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1062-1076, November.
    4. Levering, Nikki & Boon, Marko & Mandjes, Michel & Núñez-Queija, Rudesindo, 2022. "A framework for efficient dynamic routing under stochastically varying conditions," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 97-124.
    5. Wu, Jiabin & Li, Qihang & Bie, Yiming & Zhou, Wei, 2024. "Location-routing optimization problem for electric vehicle charging stations in an uncertain transportation network: An adaptive co-evolutionary clustering algorithm," Energy, Elsevier, vol. 304(C).
    6. Huan Wang & Chuang Ma & Han-Shuang Chen & Ying-Cheng Lai & Hai-Feng Zhang, 2022. "Full reconstruction of simplicial complexes from binary contagion and Ising data," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    7. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    8. Vinayak, & Raghuvanshi, Adarsh & kshitij, Avinash, 2023. "Signatures of capacity development through research collaborations in artificial intelligence and machine learning," Journal of Informetrics, Elsevier, vol. 17(1).
    9. Supriya Tiwari & Pallavi Basu, 2024. "Quasi-randomization tests for network interference," Papers 2403.16673, arXiv.org, revised Oct 2024.
    10. Anzhi Sheng & Qi Su & Aming Li & Long Wang & Joshua B. Plotkin, 2023. "Constructing temporal networks with bursty activity patterns," Nature Communications, Nature, vol. 14(1), pages 1-10, December.
    11. Samrachana Adhikari & Beau Dabbs, 2018. "Social Network Analysis in R: A Software Review," Journal of Educational and Behavioral Statistics, , vol. 43(2), pages 225-253, April.
    12. Wang, Xiaojie & Slamu, Wushour & Guo, Wenqiang & Wang, Sixiu & Ren, Yan, 2022. "A novel semi local measure of identifying influential nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    13. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    14. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    15. Zheng, Wei & Wei, Sheng, 2024. "A ‘node-place-network-city’ framework to examine HSR station area development dynamics: Station typologies and development strategies," Journal of Transport Geography, Elsevier, vol. 120(C).
    16. Ferreira, D.S.R. & Ribeiro, J. & Oliveira, P.S.L. & Pimenta, A.R. & Freitas, R.P. & Dutra, R.S. & Papa, A.R.R. & Mendes, J.F.F., 2022. "Spatiotemporal analysis of earthquake occurrence in synthetic and worldwide data," Chaos, Solitons & Fractals, Elsevier, vol. 165(P2).
    17. Mario V. Tomasello & Mauro Napoletano & Antonios Garas & Frank Schweitzer, 2017. "The rise and fall of R&D networks," Industrial and Corporate Change, Oxford University Press and the Associazione ICC, vol. 26(4), pages 617-646.
    18. Qinghu Liao & Wenwen Dong & Boxin Zhao, 2023. "A New Strategy to Solve “the Tragedy of the Commons” in Sustainable Grassland Ecological Compensation: Experience from Inner Mongolia, China," Sustainability, MDPI, vol. 15(12), pages 1-24, June.
    19. Cao, Pengliang & Zheng, Yujing & Yuen, Kum Fai & Ji, Yuxiong, 2023. "Inter-terminal transportation for an offshore port integrating an inland container depot," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 178(C).
    20. Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.

    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:jmathe:v:12:y:2024:i:23:p:3670-:d:1527728. 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: 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.