DETAILED DESCRIPTION OF A COMPUTER-SYSTEM FOR THE ROUTING AND SCHEDULING OF STREET SWEEPERS

被引：26

作者：

BODIN, LD

KURSH, SJ

机构：

[1] College of Business and Management, University of Maryland, College Park, MD

[2] Bell's Supply, Wilmington, DE

来源：

COMPUTERS & OPERATIONS RESEARCH | 1979年 / 6卷 / 04期

关键词：

D O I：

10.1016/0305-0548(79)90002-9

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In [3], the basic street sweeper routing and scheduling problem was described. In this paper, a detailed examination of the first nine steps in the computerized street sweeper routing system (disregarding the final output step) is given. To further illustrate these ideas, an example is worked out in detail. © 1979.

引用

页码：181 / 198

页数：18

共 9 条

[1]

Beltrami, Bodin, Networks and vehicle routing for municipal waste collection, J. Networks, 4, 1, pp. 65-94, (1974)

[2]

Bodin, A taxonomic structure for vehicle routing and scheduling problems, J. Comp. Urban Soc., 1, 1, (1975)

[3]

Bodin, Kursh, A computer-assisted system for the routing and scheduling of street sweepers, Operations Research, 26, 4, pp. 525-537, (1978)

[4]

Edmonds, Johnson, Matching Euler tours and the Chinese postman problem, Mathematical Programming, 5, 1, (1973)

[5]

Ford, Fulkerson, Flows in Networks, (1962)

[6]

Garfinkle, An improved algorithm for the bottleneck assignment problem, Working Paper No. 7003, (1970)

[7]

Kursh, Implementing operations research: A general strategy based on case studies, Doctoral dissertation at George Washington University, (1973)

[8]

Liittschwager, The Iowa redistricting plan, Proc. Meeting on Democratic Representation and Apportionment, (1972)

[9]

Stricker, Public sector vehicle routing: The Chinese postman problem, doctoral thesis at M.I.T., (1970)

← 1 →