Abstract
This paper addresses the school bus routing problem with bus stop selection, which jointly handles the problems of determining the set of bus stops to visit, allocating each student to one of these bus stops and computing the routes that visit the selected bus stops, so that the total routing cost is minimized and the walking distance of the students is limited by a given value. A fast and efficient matheuristic is developed based on an innovative approach that first partially allocates the students to a set of active stops that they can reach, and computes a set of routes that minimizes the routing cost. Then, a refining process is performed to complete the allocation and to adapt the routes until a feasible solution is obtained. The algorithm is tested on a set of benchmark instances. The computational results show the efficiency of the algorithm in terms of the quality of the solutions yielded and the computing time.
Highlights
The school bus routing problem (SBRP) basically consists of designing a set of routes for transporting students to schools
They emphasize three issues that are relevant to this problem: Are the bus stops fixed a priori or not? Is there a single objective or are there multiple objectives? Which constraints are taken into account? As pointed out by Park and Kim, most studies assume that the bus stop locations as well as the number of students at each stop are given and concentrate on designing the bus routes, aiming to minimize the number of buses used, the total bus travel distance or time, or the total cost
This paper addresses the School Bus Routing Problem with bus Stop Selection and a Maximum walking Distance constraint (SBRP-SS-MD) as defined by Schittekat et al [16] and usually associated with urban areas
Summary
The school bus routing problem (SBRP) basically consists of designing a set of routes for transporting students to schools. This paper addresses the School Bus Routing Problem with bus Stop Selection and a Maximum walking Distance constraint (SBRP-SS-MD) as defined by Schittekat et al [16] and usually associated with urban areas This problem deals simultaneously with selecting the bus stops among a set of potential locations, allocating the students to the bus stops and designing the bus routes, while minimizing the total distance traveled by all the buses and taking into account that there is an upper bound on the distance that the students can walk to reach their assigned bus stop. Compared to traditional CVRPs, the possibility to assign students to different stops offers the possibility to incur potential savings; at the same time, it introduces an extra decision level that makes the problem much more difficult to solve” They propose a location-routing-allocation approach and develop a GRASP+VND matheuristic that integrates the bus stop selection and the bus route construction sub-problems.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
