A case study in school transportation logistics

• Autorzy: Worwa K.
• Języki publikacji: EN

Abstrakty

EN

In the paper, a school bus routing problem, its mathematical models and solution methods are investigated. The aim of the study is to search for school bus routing problem and its solution method and to apply them for a sample case study. The case study concerns the routing and scheduling of school buses in an exemplary, well-recognized school located in one of Polish community. The problem is to find a series of school bus routes that ensure the service is provided equitably to all eligible students. Because of the NP-hardness of the school bus routing problem, it is solved using some heuristic optimization method using real data from the considered exemplary school. The aim is to increase bus utilization and to reduce transportation times for students, while maintaining on-time delivery of students to the school. Although the problem under consideration is one of the earliest logistics problems solved using methods of operations research, remains valid and is the subject of research, as evidenced by numerous contemporary publications, presenting new methods for the formal specification and solution of the problem.

Słowa kluczowe

EN

School bus routing problem; Scheduling; Heuristic; optimization

• Wydawca: Publishing House of Poznan University of Technology
• Czasopismo: Research in Logistics & Production
• Rocznik: 2014
• Tom: Vol. 4, No. 1
• Strony: 45--54
• Opis fizyczny: Bibliogr. 11poz., fig.

Twórcy

autor

Worwa K.

• Faculty of Cybernetics, Military Technical University, Warsaw, Poland

Bibliografia

• Bektas, T. & Elmastas, S., (2007), “Solving school bus routing problems through integer programming”. Journal of the Operational Research Society, Vol. 58, No. 12, pp. 1599–1604.
• Bodin, L.D. & Berman, L., (1979), “Routing and scheduling of school buses by computer”. Transportation Science, Vol. 13, No. 2, pp. 113–129.
• Clarke G. & Wright J.W., (1964) “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points”, Operations Research, Vol.12, pp. 568-581.
• Fisher, M.L., Jaikumar, R. & Van Wassenhove, L.N., (1986), “A multiplier adjust-ment method for the generalized assignment problem”. Management Science, Vol. 40, pp. 868–890.
• Junhyuk P. & Byung-In K., (2010), “The school bus routing problem: A review”, Euro-pean Journal of Operational Research, 202, pp. 311–319.
• Nagy, G. & Salhi, S., (2007), “Location-routing: issues, models and methods”. European Journal of Operational Research, Vol. 177, No. 2, pp. 649–672.
• Newton, R.M. & Thomas, W.H., (1969), “Design of school bus routes by computer”. Socio-Economic Planning Sciences Vol. 3, No. 1, pp.75–85.
• Park J. & Kim B.-I., (2010), “The school bus routing problem: A review”, European Journal of Operational Research, No. 202, pp. 311–319.
• Simchi-Levi D. & Chen X., Bramel J., (2005), “The Logic of Logistics. Theory, Algorithms, and Applications for Logistics and Supply Chain Management”, Springer Science+Business Media, Inc.
• Spada, M., Bierlaire, M. & Liebling, Th.M., (2005), “Decision-aiding methodology for the school bus routing and scheduling problem”. Transportation Science, Vol. 39, No. 3, pp. 477–490.
• Spasovic L., S. Chien, C. Kelnhofer- Feeley, Y.Wang and Q. Hu (2001), “A Methodology for Evaluating of School Bus Routing - A Case Study of Riverdale, New Jersey”, Transportation Research Board Paper No. 01-2088.