Skip to main content
SpringerLink
Log in

Toward algorithms for multi-modal shortest path problem and their extension in urban transit network

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

This paper investigates the algorithms of the multi-modal shortest path problem (M-SPP) under static and certain environment and their extension in urban transit network (UTN). The related M-SPP is one of the important and practical problems in several fields such as urban transportation system and freight transportation. Existing algorithms of various M-SPP are usually based on building a new network in terms of the hypergraph or transfer graph and implemented by extending the label correcting algorithm and label setting algorithm (LSA) in such a new network. The UTN is composed of multiple modes (e.g., automobile, bus, subway, light rail, pedestrian and so on) and, to get their destination, the users can alternate between different modes. As a special demand, the time-window is usually correlated with the M-SPP. In contrast to the algorithms for the classical M-SPP, the algorithms for the M-SPP in UTN are much complicated, particularly, these for the M-SPP with the switching delay and arriving time-window. In this paper, we consider the M-SPP with switching delay and that with both of the switching delay and arriving time-window. Firstly, a new approach is adopted to simplify the mathematical formulas of thes M-SPP with switching delay and then an improved LSA for the M-SPP with switching delay in the UTN is proposed. Afterwards, a reverse LSA is given to solve the M-SPP with both of switching delay and arriving time-window in the UTN. Finally, some examples are given to illustrate the labeling process of the designed algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Ayed, H., Khadraoui, D., Habbas, Z., Bouvry, P., & Merche, J. F. (2008). Transfer graph approach for multimodal transport problems. In L. T. Hoai, P. Bouvry, & P. D. Tao (Eds.), Modelling, computation and optimization in information systems and management sciences, communications in computer and information science (Vol. 14, pp. 538–547). Berlin: Springer.

    Google Scholar 

  • Ayed, H., Galvez-Fernandez, C., Habbas, Z., & Khadraoui, D. (2011). Solving time-dependent multimodal transport problems using a transfer graph model. Computers & Industrial Engineering, 61, 391–401.

    Article  Google Scholar 

  • Ayfadopoulou, G., Ziliaskopoulos, E., & Chrysochoou, E. (2007). A multi-objective optimum path algorithm for passenger pre-trip planning in multimodal transportation networks. International Transaction in Operational Research, 2032, 26–34.

    Google Scholar 

  • Bandyopadhyay, S., & Bhattacharya, R. (2013). Finding optimum neighbor for routing based on multi-criteria, multi-agent and fuzzy approach. Journal of Intelligent Manufacturing, 24, 1–18.

    Article  Google Scholar 

  • Bellman, R. (1958). On a routing problem. Quarterly Journal of Applied Mathematics, 16, 87–90.

    Article  Google Scholar 

  • Beuthe, M., Jourquin, B., Geerts, G. F., & Ha, C. K. N. (2001). Freight transportation demand elasticities: A geographic multimodal transportation network analysis. Transportation Research Part E, 37, 253–266.

    Article  Google Scholar 

  • Bielli, M., Boulmakoul, A., & Mouncif, H. (2006). Object modeling and path computation for multimodal travel systems. European Journal of Operational Research, 175, 1705–1730.

    Article  Google Scholar 

  • Chang, E., Floros, E., & Ziliaskopoulos, A. (2007). An intermodal time-dependent minimum cost path algorithm with an application to hazmat routing. In V. Zeimpekis, C. D. Tarantilis, G. M. Giaglis, & I. Minis (Eds.), Dynamic fleet management, concepts, systems, algorithms & case studies, operations research/computer science interfaces series (Vol. 38, pp. 113–132). US: Springer.

    Google Scholar 

  • Crainic, T., & Rousseau, J. M. (1986). Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem. Transportation Research Part B, 20, 25–242.

    Article  Google Scholar 

  • Curtin, K. M., & Biba, S. (2011). The transit route arc-node service maximization problem. European Journal of Operational Research, 208, 46–56.

    Article  Google Scholar 

  • Dantzig, G. B. (1960). On the shortest route through a network. Management Science, 7, 187–190.

    Article  Google Scholar 

  • Deo, N., & Pang, C. (1984). Shortest path algorithms: Taxonomy and annotation. Networks, 14, 275–323.

    Article  Google Scholar 

  • Dijkstra, E. W. (1959). A note on two problems in connection with graphs. Numerical Mathematics, 1, 269–271.

    Article  Google Scholar 

  • Galvez-Fernandez, C., Khadraoui, D., Ayed, H., Habbas, Z., & Alba, E. (2009). Distributed approach for solving time-dependent problems in multimodal transport networks. Advances in Operations Research, 2009, 1–15.

    Article  Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.

    Google Scholar 

  • Gen, M., & Cheng, R. (2000). Genetic algorithms & engineering optimization. New York: Wiley.

    Google Scholar 

  • Horn, M. E. T. (2003). An extended model and procedural framework for planning multi-modal passenger journeys. Transportation Research Part B, 37, 641–660.

  • Lozano, A., & Storchi, G. (2001). Shortest viable path in multimodal networks. Transportation Research Part A, 35, 225–241.

    Google Scholar 

  • Mandow, L., & Perez de la Cruz, J. L. (2010). Path recovery in frontier search for multiobjective shortest path problems. Journal of Intelligent Manufacturing, 21, 89–99.

    Article  Google Scholar 

  • Modesti, P., & Sciomachen, A. (1998). A utility measure for finding multi-objective shortest paths in urban multimodal transportation networks. European Journal of Operational Research, 111, 495–508.

  • Nguyen, S., Morello, E., & Pallotino, S. (1988). Discrete time dynamic estimation model for passenger origin/destination matrices on transit networks. Transportation Research Part B, 22, 251–260.

    Article  Google Scholar 

  • Nguyen, S., Pallotino, S., & Malucelli, F. (2001). A modeling framework for the passenger assignment on a transport network with timetables. Transportation Science, 35, 238–249.

    Article  Google Scholar 

  • Pallottino, S., & Scutella, M. G. (1998). Shortest path algorithms in transportation models: Classical and innovative aspects. In P. Marcotte & S. Nguyen (Eds.), Equilibrium and advanced transportation modelling (pp. 245–281). the Netherlands: Kluwer.

    Chapter  Google Scholar 

  • Rahim, A. A., & Farhad, S. (2010). An evolutionary solution for multimodal shortest path problem in metropolises. ComSIS, 7, 789–811.

    Article  Google Scholar 

  • Spiess, H., & Florian, M. (1989). Optimal strategies: A new assignment model for transit networks. Transportation Research Part B, 23, 83–102.

    Article  Google Scholar 

  • Xie, Y. C., Lu, W., Wang, W., & Quadrifoglio, L. (2012). A multimodal location and routing model for hazardous materials transportation. Journal of Hazardous Materials, 227–228, 135–141.

    Article  Google Scholar 

  • Yang, L., & Zhou, X. (2014). Constraint reformulation and lagrangian relaxation-based solution algorithm for a least expected time path problem. Transportation Research Part B, 59, 22–44.

    Article  Google Scholar 

  • Ziliaskopoulos, A. K., & Wardell, W. (2000). An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays. European Journal of Operational Research, 125, 486–502.

    Article  Google Scholar 

  • Zografos, K. G., & Androutsopoulos, K. N. (2008). Algorithms for itinerary planning in multimodal transportation networks. Transportation System, 9, 175–184.

    Google Scholar 

Download references

Acknowledgments

This research is supported by National Natural Science Foundation of China (No. 71361018).

Author information

Authors and Affiliations

  1. School of Traffic & Transportation, Lanzhou Jiaotong University, Lanzhou, 730070, China

    Linzhong Liu, Haibo Mu & Juhua Yang

Authors
  1. Linzhong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haibo Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Juhua Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Linzhong Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, L., Mu, H. & Yang, J. Toward algorithms for multi-modal shortest path problem and their extension in urban transit network. J Intell Manuf 28, 767–781 (2017). https://doi.org/10.1007/s10845-014-1018-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-014-1018-0

Keywords

Search

Navigation