3rd North American International Conference on Industrial Engineering and Operations Management

Solving the School Bus Routing Problem at a Local School in Kuwait

Hajer Al-Shawaf
Publisher: IEOM Society International
0 Paper Citations
1 Views
1 Downloads
Track: Senior Capstone Design Competition / FYP Competition
Abstract

Abstract

The Kuwaiti government provides school busses for all public schools in Kuwait. Areas covered by a bus and the routing of the busses are random decisions made each school year. This had led to students staying up to one hour and sometimes more; going to or returning from schools, and in typical cases, large busses serving a handful of students. The effect of that on their performance is obvious. Further, traffic jams are familiar scenes at intersections near to schools or leading to schools. Depending on school busses in Kuwait is necessary as female students are more in numbers than male students and they are less likely to go to schools on foot. In addition, the weather in Kuwait (desert weather) can get too cold in days and too hot in others. We proposed and developed a spreadsheet model to solve the school bus routing problem at a public school in Kuwait. The application was built using the VBA tool in Microsoft Excel, providing a user-friendly interface and utilizing the Clark and Wright ‘saving algorithm. Data were collected at a public school for females, and experiments were conducted to decide on appropriate time window for picking students, the suitable travel time, and the number of busses. The results showed the potential of cutting the time to school by around 30%, while reducing the cost of busses by 10%. The application is simply usable to any other school.     

Keywords 

Spreadsheet modeling, School bus routing problem, Clark and Wright’ saving algorithm, Heuristic algorithm

Published in: 3rd North American International Conference on Industrial Engineering and Operations Management, Washington D.C., USA

Publisher: IEOM Society International
Date of Conference: September 27-29, 2018

ISBN: 978-1-5323-5946-0
ISSN/E-ISSN: 2169-8767