Subscribe Now Subscribe Today
Science Alert
Curve Top
Journal of Applied Sciences
  Year: 2009 | Volume: 9 | Issue: 12 | Page No.: 2228-2237
DOI: 10.3923/jas.2009.2228.2237
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Development of a Shared Ride Constrained Path Finding System

M. Teimouri, M.R. Delavar and M.R. Malek

This study introduces a novel idea of shared riding constrained path finding developed using a geospatial information system. The idea is to use more efficiently the available (volunteering to pick up passenger) vehicles with free capacity on the street network. The travel path of available means on the street network formed a time-dependent network called transportation network. The space-time network concept utilized in this study in order to abstract the transportation network. The chronological-shortest path tree algorithm with the proposed modifications presents all reasonable shared ride constrained paths on the kind of transportation network. The paths may not coincide with the shortest path of origin to destination locations based on the street network. The traveler’s origin and destination locations with arbitrary latest arrival time provide the input of the algorithm. The algorithm results provide the paths with the in-vehicle time, walking time, waiting time and length of each path as the fare with passenger. Then, passenger can select the best trip regarding his preferences. Finally, improving the proposed solution with incorporating travel time reliability through the model description as a possible extension is discussed.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

M. Teimouri, M.R. Delavar and M.R. Malek, 2009. Development of a Shared Ride Constrained Path Finding System. Journal of Applied Sciences, 9: 2228-2237.

DOI: 10.3923/jas.2009.2228.2237






Curve Bottom