Skip to main content
SpringerLink
Log in

Offering a New Bus Route Between Campus and Bus Terminal Using Shortest Path Algorithm

  • Conference paper
  • First Online:
Logistics and Supply Chain Management (LSCM 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1458))

Included in the following conference series:

  • 738 Accesses

Abstract

More than 50 thousand students are studying at Gaziantep University. Most of these students reside around the campus of Gaziantep University, while their hometown is outside Gaziantep. Therefore, they use the intercity bus station in the southeast of Gaziantep very often. In this paper, it is aimed to detect the shortest route between Gaziantep University campus and Gaziantep intercity bus station. Within the aim of the study, the shortest path (SPP) problem was considered. The purpose of the shortest path algorithm is to find the shortest distance between the start and end points in a road network. In this problem, 11 different municipal bus routes operating on the route starting from Gaziantep University campus and ending point Gaziantep bus station were examined and a road network consisting of 46 points was obtained. Then, the distance between each point was calculated with the help of Google Earth and the data was entered to mathematical model developed for the shortest path algorithm. The model was solved by the GAMS 23.1 optimization package and the shortest distance between the two points (10.4 km) was found to be optimal. As a result, a new bus route including 18 destination stops with shorter distances than the existing 11 bus routes has been proposed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

1. References

  1. Ferone, D., Festa, P., Guerriero, F., Laganà, D.: The constrained shortest path tour problem. Comput. Oper. Res. 74, 64–77 (2016)

    Article  MathSciNet  Google Scholar 

  2. Yu, G., Yang, J.: On the robust shortest path problem. Comput. Oper. Res. 25(6), 457–468 (1998)

    Article  Google Scholar 

  3. Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 373–556 (1969)

    Article  Google Scholar 

  4. Taccari, L.: Integer programming formulations for the elementary shortest path problem. Eur. J. Oper. Res. 252(1), 122–130 (2016)

    Article  MathSciNet  Google Scholar 

  5. Orlin, J.B., Madduri, K., Subramani, K., Williamson, M.: A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. Discrete Algorithms 8(2), 189–198 (2010)

    Article  MathSciNet  Google Scholar 

  6. Hougardy, S.: The Floyd-Warshall algorithm on graphs with negative cycles. Inf. Process. Lett. 110(8–9), 279–281 (2010)

    Article  MathSciNet  Google Scholar 

  7. Rosen, J.B., Sun, Z.S., Xue, G.L.: Algorithms for the quickest path problem and the enumeration of quickest paths. Comput. Oper. Res. 18(6), 579–584 (1991)

    Article  MathSciNet  Google Scholar 

  8. Kumari, S.M., Geethanjali, N.: A survey on shortest path routing algorithms for public transport travel. Global J. Comp. Sci. Technol. 9(5), 73–76 (2010)

    Google Scholar 

  9. Wu, Q., Hartley, J.: Using K-shortest paths algorithms to accommodate user preferences in the optimization of public transport travel. In: 8th International Conference on Applications of Advanced Technologies in Transportation Engineering Proceedings, pp. 181–186, Beijing (2004)

    Google Scholar 

  10. Huang, B., Wu, Q., Zhan, F.B.: A shortest path algorithm with novel heuristics for dynamic transportation networks. Int. J. Geogr. Inf. Sci. 21(6), 625–644 (2007)

    Article  Google Scholar 

  11. Idri, A., Oukarfi, M., Boulmakoul, A., Zeitouni, K., Masri, A.: A new time-dependent shortest path algorithm for multimodal transportation network. Proc. Comput. Sci. 109, 692–697 (2017)

    Article  Google Scholar 

  12. Thapa, R., Shrestha, J.: Optimal route computation for public transport with minimum travelling time and travel cost: a case study of Pokhara city. Tech. J. 1(1), 79–86 (2019)

    Article  Google Scholar 

  13. Tu, Q., Cheng, L., Yuan, T., Cheng, Y., Li, M.: The constrained reliable shortest path problem for electric vehicles in the urban transportation network. J. Cleaner Prod. 261, 121130 (2020)

    Article  Google Scholar 

  14. Susilowati, E., Fitriani, F.: Determining the shortest path between terminal and airport in Yogyakarta using trans Jogja with min plus algorithm. J. Math. Educ., Sci. Technol. 4(2), 123–134 (2019)

    Google Scholar 

  15. Win, Y.Y., Hlaing, H.S., Thein, T.T.: Shortest path analysis based on Dijkstra’s algorithm in Myanmar road network. Int. J. Res. 6(10), 132–139 (2019)

    Google Scholar 

  16. Liu, Y., Liu, X.: Application of improved A* algorithm in customized bus path planning. Comput. Sci. Appl. 10(1), 21–28 (2020)

    Google Scholar 

  17. Raith, A., Ehrgott, M.: A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4), 1299–1331 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Gaziantep University, 27027, Gaziantep, Turkey

    Eren Özceylan

Authors
  1. Eren Özceylan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Kharazmi University, Tehran, Iran

    Zohreh Molamohamadi

  2. Istinye University, Istanbul, Turkey

    Erfan Babaee Tirkolaee

  3. Kharazmi University, Tehran, Iran

    Abolfazl Mirzazadeh

  4. Poznań University of Technology, Poznań, Poland

    Gerhard-Wilhelm Weber

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Özceylan, E. (2021). Offering a New Bus Route Between Campus and Bus Terminal Using Shortest Path Algorithm. In: Molamohamadi, Z., Babaee Tirkolaee, E., Mirzazadeh, A., Weber, GW. (eds) Logistics and Supply Chain Management. LSCM 2020. Communications in Computer and Information Science, vol 1458. Springer, Cham. https://doi.org/10.1007/978-3-030-89743-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-89743-7_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-89742-0

  • Online ISBN: 978-3-030-89743-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation