Journal of Applied Sciences1812-56541812-5662Asian Network for Scientific Information10.3923/jas.2009.2532.2543KolyaieS.DelavarM.R.MalekM.R.122009914This study presents a new geospatial information system-based solution that assists people in trip planning to reach multiple destinations considering opening hours of points of interest and duration needed to perform multiple activities using multimodel public transportation media. People encounter with complexities in finding optimum paths in a multimodel public transportation system as they need to consider interactions of different modes of transportations in a more specific and constrained spatio-temporal structure. In this situation people’s context in the form of their activities diary becomes an important issue affecting trip planning and selecting mode of transportation. Activities diary constrains the spatio-temporal order of activities and enables us to study the effect of activities in transportation planning. In this study, the impact of activity diaries and spatio-temporal dimensions of activities in trip planning and optimum path findings are discussed. A new algorithm is proposed for planning itinerary considering network, time and duration constraints. The algorithm assumes that the activities are mandatory and the locations and duration of each activity are fixed. The travelers’ destinations, time and duration constraints provide the input of the algorithm. Using connectivity rules and policies, Dijkstra algorithm for finding the shortest paths is selected. The results determine the possible order of activities and their start and end time. The possible sequences of activities optimized based on minimizing waiting time during the activities i.e., time that person neither is doing an activity nor is traveling between activity locations and must wait till activity can be undertaken according to the time constraints. Finally, efficiency of the algorithm is determined according to the time complexity as a function of number of activity locations in the worst and normal cases. It has been proved that the time complexity of the algorithm depends on the third power of number of activity locations.]]>Kolyaie, S., M.R. Delavar and M.R. Malek,2008Battista, M.G., M. Lucertini and B. Simeone,1995Bonsall, P., P. Firmin, M. Anderson, I. Palmer and P. Balmforth,1997Bowman, J.L.,1998Burns, L.D.,1979Casas, I.,2003Dorigo, M. and L.M. Gambardella,1997Duker, K. and T. Ton,2001Fernandez, E., J. Cea, M. Floria and E. Cabrera,1994Freisleben, B. and P. Merz,1996Huang, Z.,2003Kolyaie, S., M.R. Delavar and M.R. Malek,2008Kolyaie, S., M.R. Delavar and M.R. Malek,2008Krygsman, S.,2004Kwan, M.P.,1997Kwan, M.P.,2003Kwan, M.P.,2006Lozano, A. and G. Storchi,2001Miller, H.J.,1999Miller, H.J.,2004Ohmori, N., N. Harata and K. Ohta,2005Pallottino, S. and M.G. Scutella,1997Tan, M.C., C.O. Tong and J.M. Xu,2004Thill, J.C.,2000Vaughna, K.M., M.A. Abdel-Aty and R. Kitamura,1999Wang, D. and T. Cheng,2001Wu, Y.H. and H.J. Miller,2001Ying, W. and X. Jianying,2000