Title 



A mathematical formulation for a school bus routing problem
 
Author 



 
Abstract 



The school bus routing problem discussed in this paper, is similar to the standard vehicle routing problem, but has several interesting additional features. In the standard VRP all stops to visit are given. In our school bus routing problem, we assume that a set of potential stops is given, as well as a set of students that can walk to one or more of these potential stops. The school buses used to pick up the students and transport them to their schools have a finite capacity. The goal of this routing problem is to select a subset of stops that will actually be visited by the buses, determine which stop each student should walk to and develop a set of tours that minimize the total distance travelled by all buses. We develop an integer programming formulation for this problem, as well as a problem instance generator. We then show how the problem can be solved using a commercial integer programming solver and discuss some of our results on small instances.   
Language 



English
 
Source (book) 



International Conference on Service Systems and Service Management, October 2527, 2006, Troyes, France  
Publication 



Los Alamitos, Calif. : IEEE, 2006
 
ISBN 



1424404509
 
Volume/pages 



p. 15521557
 
ISI 



000242559100266
 
Full text (Publisher's DOI) 


  
