An efficient multimodal path computation integrated within Location Based Service for transportation networks system (multimodal path computation within LBS)

Abstract

This study focuses on the problem of multimodal shortest path in the transportation networks system, where users have several modes to travel from an origin to a destination. To extend the traditional shortest path problem an innovative framework is presented, which integrates a set of constraints on the sequence of the used modes on the multimodal path. The aim is to deal with an efficient design for the multimodal shortest path computation taking into accounts not only the expected travel time, but also additional constraints such as: delays at mode and arc switching points, viability of the sequence of the used modes and the number of modal transfers. The computational complexity and the correctness of the algorithm are proved. Attention is also devoted to the multimodal path operator developed on the base of the proposed algorithm. A Location Based Service (LBS) integrating our transit path planning computation is developed. © 2011 Asian Network for Scientific Information.