Finding Optimal Routes in MaaS Framework using ParetoBFS
Poojarini Mitra, Zeenat Rehena, Nandini Mukherjee · 2022 6th International Conference on Intelligent Computing and Control Systems (ICICCS) · 2022
To offer Mobility as a Service (MaaS) to the consumers while handling time-dependent multi-modal transportation and maintaining multiple criteria is a complex task. The system needs to be intelligent enough to provide optimal routes within the least possible computation time. This paper proposes a simple method that seeks to provide a solution by using the ParetoBFS algorithm, a modified version of the traditional BFS algorithm, which uses Pareto constraints to prune the graph and find all Pareto-optimal paths in a network considering multiple criteria. Evaluations with different scenarios were performed using the proposed mechanism and its performance was compared with Weighted-Sum Dijkstra’s Algorithm. It can be observed that the proposed mechanism is achieving better results than Weighted-Sum Dijkstra’s Algorithm.