The school bus routing problem traditionally has been defined in an urban context. However, because of the unique attributes of the problem in rural areas, traditional heuristic methods for solving the problem may produce impractical results. In many cases, these characteristics also provide the opportunity to investigate what size and mix of vehicles, whether large or small buses, conforming vans, or other modes, are most efficient. In addition, these vehicles may be further differentiated by the presence of equipment for transporting students with special needs. To address this situation, a mathematical model of the problem was constructed and a new heuristic was developed. This heuristic consists of two parts: constructing the initial route and then improving it by using a fixed tenure tabu search algorithm. This rural routing heuristic, in addition to several existing ones, is then applied to a randomly generated school district with rural characteristics. For the relevant measure, a function of stude...
[1]
Ibrahim H. Osman,et al.
Tabu search variants for the mix fleet vehicle routing problem
,
2002,
J. Oper. Res. Soc..
[2]
Warren H. Thomas,et al.
Design of school bus routes by computer
,
1969
.
[3]
Paul H. Calamai,et al.
A multi-objective optimization approach to urban school bus routing: Formulation and solution method
,
1995
.
[4]
Brian T. Bennett,et al.
SCHOOL BUS ROUTING BY COMPUTER
,
1972
.
[5]
David Simchi-Levi,et al.
A computerized approach to the New York City school bus routing problem
,
1997
.
[6]
Lawrence Bodin,et al.
Routing and Scheduling of School Buses by Computer
,
1979
.
[7]
Shen Lin.
Computer solutions of the traveling salesman problem
,
1965
.
[8]
Bruce L. Golden,et al.
The fleet size and mix vehicle routing problem
,
1984,
Comput. Oper. Res..
[9]
Michel Bierlaire,et al.
School Bus Routing and Scheduling Problem
,
2002,
OR.