Scholarlink

Effective route planning, despite numerous studies, is still a great challenge. Given real-world data and demanding criteria, the problem can be even more complex, with no single optimal solution. In this paper, an interactive system with dedicated Dijkstra-based algorithm is proposed to tackle the problem of efficient bicycle route planning. With the presented web application framework, the user is able to generate a complete cycle of the desired length and surface quality, complementing the selected profile of the bicycle. The results indicate the reliability of the system. The routes adapt well to the chosen profile and fall within the provided acceptable total-length error (5%), reaching 3.24 MAPE for shorter and 2.74 MAPE for longer routes tested.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Interactive Bicycle Route Planning System Using an Efficient Dijkstra-Based Algorithm

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Antoni Jaszcz,
  • Szymon Hankus,
  • Michał Bober,
  • Bartosz Bugla

摘要

Effective route planning, despite numerous studies, is still a great challenge. Given real-world data and demanding criteria, the problem can be even more complex, with no single optimal solution. In this paper, an interactive system with dedicated Dijkstra-based algorithm is proposed to tackle the problem of efficient bicycle route planning. With the presented web application framework, the user is able to generate a complete cycle of the desired length and surface quality, complementing the selected profile of the bicycle. The results indicate the reliability of the system. The routes adapt well to the chosen profile and fall within the provided acceptable total-length error (5%), reaching 3.24 MAPE for shorter and 2.74 MAPE for longer routes tested.