Optimizing Schedules for School Bus Routing Problem: the case of Dar Es Salaam Schools
Main Article Content
Abstract
The School Bus Routing Problem (SBRP) deals with transportation of students to and from their schools. Given a set of fleet of buses of a school, a set of bus stops, the time matrix and the number of students at each stop, the task is to determine the schedule of buses that minimizes amount of time students spend in the buses on the way to and from school. The school bus routing problem is a special case of the Vehicle Routing Problem (VRP) and is known to be NP-hard. This NP-hardness implies that it is very unlikely that the problem can be solved in polynomial time. The common methods used to solve NP-hard problems are heuristic algorithms which gives quick and good solutions without guarantee that the solution obtained is optimal. In this paper a Tabu search based heuristic for SBRP is developed. The algorithm has been implemented using Borland C++ 4.5 programming language and tested using data from Tusiime Nursery and Primary School in Dar es salaam, Tanzania. The proposed implementation results in reduction of students’ travelling time by 19.24%.
Â
Keywords: Optimization, Bus Scheduling, Routing Problems, Tabu Search, Vehicle Routing
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.