An Analysis of Special Needs Student Busing

Population growth can lead to public school capacity issues as well as increased school bus utilization, which, in turn, can result in longer school bus transport times for regular and special needs students. Special needs or medically fragile students are children with special health care needs who are at increased health and safety risk. It is common practice to provide special needs students with specially-equipped buses and/or special classroom environments with specific facilities or services. However, the assignment of student services to schools is regularly made without regard to bus transportation considerations for special needs students. Considering the potentially negative impact of long school bus rides on these students, we present the first systematic, integrated analyses of special needs student busing and classroom assignments. The authors provide models and algorithms for maintaining administration-based transportation financial performance measures while simultaneously designing smarter transportation networks considering both student geographical location and service needs.

[1]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

[2]  Jack P. Shonkoff,et al.  A New Definition of Children With Special Health Care Needs , 1998, Pediatrics.

[3]  David Simchi-Levi,et al.  A computerized approach to the New York City school bus routing problem , 1997 .

[4]  Luigi dell’Olio,et al.  Planning school transport: design of routes with flexible school opening times , 2009 .

[5]  Angel Ibeas,et al.  Costing School Transport in Spain , 2006 .

[6]  Saïd Salhi,et al.  Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..

[7]  Jan Karel Lenstra,et al.  Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows , 1993, Transp. Sci..

[8]  Jacques A. Ferland,et al.  Decision Support System for the School Districting Problem , 1990, Oper. Res..

[9]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[10]  Jacques Desrosiers,et al.  A Request Clustering Algorithm for Door-to-Door Handicapped Transportation , 1991, Transp. Sci..

[11]  Robert A. Russell,et al.  Routing Special-Education School Buses , 1986 .

[12]  Gilbert Laporte,et al.  Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004, Parallel Comput..

[13]  David Ripplinger Rural School Vehicle Routing Problem , 2005 .

[14]  Marc J. Schniederjans,et al.  A Multicriteria Assignment Problem: A Goal Programming Approach , 1983 .

[15]  CordeauJean-François,et al.  Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004 .

[16]  David W. Pentico,et al.  Assignment problems: A golden anniversary survey , 2007, Eur. J. Oper. Res..