Modification of path-finding algorithms introducing time and distance limitations

Main Article Content

DOI

Mateusz Wolanin

mat.wol20@outlook.com

Klaudia Korniszuk

klaudia714@gmail.com

Jakub Smołka

jakub.smolka@pollub.pl

Abstract

This paper describes modifications of path-finding algorithms. The modifications add time and distance constraints to generated paths. A* and BFS algorithms are modified. Additionally, A* algorithm modification which combines the advantages (generating the shortest routes with the smallest number of vertices) of A* and BFS is presented.. This allows for creating a route planning app that enables users of bike sharing services to travel more easily and economically.

Keywords:

route planning; bike sharing system; algorithm A*; algorithm BFS

References

Article Details

Wolanin, M., Korniszuk, K., & Smołka, J. (2019). Modification of path-finding algorithms introducing time and distance limitations . Journal of Computer Sciences Institute, 10, 18–23. https://doi.org/10.35784/jcsi.188