论文信息 - Minimizing Deadhead Distance in Routing School Buses

Minimizing Deadhead Distance in Routing School Buses

AbstractA microcomputer based system that can be used to minimize the total distance that a fleet of school buses travels while not transporting passengers (“deadhead” distance) is presented. The system may be implemented on an MS-DOS compatible microcomputer, can be run quite quickly, and does not require a great deal of data preparation. Model development, data requirements, a review of the system, applications, and conclusion serve as major components in the presentation.

Frank K. Nagurney

[1] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[2] Samuel J. Raff,et al. Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[3] Porter Sexton. The Use of Geoprocessing in Educational Research and Decision Support , 1982 .

[4] Warren H. Thomas,et al. Design of school bus routes by computer , 1969 .

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

[6] Billy E. Gillett,et al. A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[7] Lawrence Bodin,et al. Routing and Scheduling of School Buses by Computer , 1979 .

[8] Katta G. Murty,et al. Linear and combinatorial programming , 1976 .

[9] Wayne Walcott. School Bus Routing and Scheduling: When to Use Computer-Assisted Methods and Programs. , 1986 .

[10] Kendall E. Nygard,et al. Computer-Aided School Bus Routing for Rural Districts , 1982 .

[11] Jean-Marc Rousseau,et al. Clustering for routing in densely populated areas , 1985 .

[12] Arthur J. Swersey,et al. Scheduling School Buses , 1984 .

[13] Amedeo R. Odoni,et al. Locating new passenger facilities on a transportation network , 1979 .