Skip to main content

An Integer Linear Programming Formulation for Routing Problem of University Bus Service

  • Chapter
  • First Online:
New Trends in Emerging Complex Real Life Problems

Part of the book series: AIRO Springer Series ((AIROSS,volume 1))

Abstract

The initial phase of our work, concentrating on the formulation of a staff service bus routing problem (SSBRP), is motivated by a real life problem of a university at a multi-centric metropolitan city. In order to improve the overall cost efficiency of the existing staff service bus operation system of the Technical University of Istanbul (ITU) we ultimately aim to find a set of staff service bus routes that provides transportation to and from four campuses for its eligible academics and administrative staff currently using service buses. An integer linear programming formulation for the SSBRP for the single campus case is presented.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Angel, R.D., Caudle, W.L., Noonan, R., Whinston, A.: Computer-assisted school bus scheduling. Manage. Sci. 18(6), 279–288 (1972)

    Article  Google Scholar 

  2. Bektas, T., Elmastas, S.: Solving school bus routing problems through integer programming. J. Oper. Res. Soc. 58(12), 1599–1604 (2007)

    Article  Google Scholar 

  3. Bennett, B.T., Gazis, D.C.: School bus routing by computer. Transp. Res. 6, 317–325 (1972)

    Article  Google Scholar 

  4. Bodin, L.D., Berman, L.: Routing and scheduling of school buses by computer. Transportation Science 13(2), 113–129 (1979)

    Article  Google Scholar 

  5. Bodin, L.D., Golden, B., Assad, A., Ball, M.O.: Routing and scheduling of vehicles an crews: the state of the art. Comput. Oper. Res. 10, 63–211 (1983)

    Article  MathSciNet  Google Scholar 

  6. Bowerman, R., Hall, B., Calamai, P.: A multi-objective optimization approach to urban school bus routing: formulation and solution method. Transp. Res. Part A 29(2), 107–123 (1995)

    Google Scholar 

  7. Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)

    Article  Google Scholar 

  8. Desrosiers, J., Ferland, J.A., Rousseau, J.-M., Lapalme, G., Chapleau, L.: TRANSCOL: a multi-period school bus routing and scheduling system. TIMS Stud. Manage. Sci. 22, 47–71 (1986)

    Google Scholar 

  9. Desrosiers, J., Ferland, J.A., Rousseau, J.-M., Lapalme, G., Chapleau, L.: An overview of a school busing system. In: Jaiswal, N.K. (ed.) Scientific Management of Transport Systems, pp. 235–243. North-Holland, Amsterdam (1981)

    Google Scholar 

  10. Desrosiers, J., Soumis, F., Desrochers, M., Sauvé, M.: Methods for routing with time windows. Eur. J. Oper. Res. 23(2), 236–245 (1986)

    Article  MathSciNet  Google Scholar 

  11. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems. Part II: The rural postman problem. Oper. Res. 43, 399–414 (1995)

    Article  Google Scholar 

  12. Fügenschuh, A.: Solving a school bus scheduling problem with integer programming. Eur. J. Oper. Res. 193(3), 867–884 (2009)

    Article  MathSciNet  Google Scholar 

  13. Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2), 293–309 (2008)

    Article  MathSciNet  Google Scholar 

  14. Kara, I., Laporte, G., Bektas, T.: A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur. J. Oper. Res. 158(3), 793–795 (2004)

    Article  MathSciNet  Google Scholar 

  15. Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulations and traveling salesman problems. J. Assoc. Comput. Mach. 7, 326–329 (1960)

    Article  MathSciNet  Google Scholar 

  16. Newton, R.M., Thomas, W.H.: Design of school bus routes by computer. Socio-Econom. Plann. Sci. 3(1), 75–85 (1969)

    Article  Google Scholar 

  17. Park, J., Kim, B.-I.: The school bus routing problem: a review. Eur. J. Oper. Res. 202, 311–319 (2010)

    Article  MathSciNet  Google Scholar 

  18. Schittekat, P., Sevaux, M., Sörensen, K.: A mathematical formulation for a school bus routing problem. In: Proceedings of the IEEE 2006 International Conference on Service Systems and Service Management, Troyes, France (2006)

    Google Scholar 

  19. Spada, M., Bierlaire, M., Liebling, Th.M.: Decision-aiding methodology for the school bus routing and scheduling problem. Trans. Sci. 39, 477–490 (2005)

    Article  Google Scholar 

  20. Swersey, A.J., Ballard, W.: Scheduling school buses. Manage. Sci. 30(7), 844–853 (1984)

    Article  Google Scholar 

  21. Toth, P., Vigo, D.: Vehicle routing: problems, methods, and applications. MOS-SIAM series on optimization, vol. 18, 2nd ed. Philadelphia, SIAM (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hilmi Berk Celikoglu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Hulagu, S., Celikoglu, H.B. (2018). An Integer Linear Programming Formulation for Routing Problem of University Bus Service. In: Daniele, P., Scrimali, L. (eds) New Trends in Emerging Complex Real Life Problems. AIRO Springer Series, vol 1. Springer, Cham. https://doi.org/10.1007/978-3-030-00473-6_33

Download citation

Publish with us

Policies and ethics