DESIGN OF SCHOOL BUS ROUTES BY COMPUTER

被引:86
作者
NEWTON, RM [1 ]
THOMAS, WH [1 ]
机构
[1] SUNY Buffalo, DEPT IND ENGN, BUFFALO, NY 14214 USA
关键词
D O I
10.1016/0038-0121(69)90051-2
中图分类号
F [经济];
学科分类号
02 ;
摘要
A practical method for generating school bus routes and schedules on a digital computer has been developed. Routing is accomplished by a two step procedure. First, the shortest route a bus of infinite capacity traverses in order to visit all of the stops is determined. This route, the solution of the traveling-salesman problem associated with the set of bus stops, is obtained by an efficient heuristic procedure which yields near-optimal solutions to problems of a realistic size. This single route is then partitioned to provide individual bus routes and schedules which satisfy bus capacity, bus loading policy, and passenger riding time constraints. © 1969.
引用
收藏
页码:75 / 85
页数:11
相关论文
共 5 条
[1]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[2]   THE TRUCK DISPATCHING PROBLEM [J].
DANTZIG, GB ;
RAMSER, JH .
MANAGEMENT SCIENCE, 1959, 6 (01) :80-91
[3]  
HAYES RL, 1967, 31ST NAT M ORSA NEW
[4]   A HEURISTIC APPROACH TO SOLVING TRAVELING SALESMAN PROBLEMS [J].
KARG, RL ;
THOMPSON, GL .
MANAGEMENT SCIENCE, 1964, 10 (02) :225-248
[5]  
NEWTON R, 1967, THESIS STATE U NEW Y