ROUTING OF SOLID WASTE COLLECTION VEHICLES. APPENDIX B: OPTIMAL ROUTING OF SOLID WASTE COLLECTION VEHICLES
This study is applying network theory to the problem of routing a solid waste collection vehicle through a street network. It is centered on the development of an algorithm to find the minimum tour of a vehicle which has to complete a round trip through a network consisting of both one-way and two-way streets. It is the total length of the tour which is sought rather than the detailed and chronologic schedule of the vehicle. This tour is found by minimizing the total length of street segments which have to be retraced. The problem can be described mathematically as a linear program whose optimal solution is guaranteed to be integer.
- Paper copy also available in set of 4 reports as PB-239 895-SET, PC$16.00.
University of Illinois, Urbana-ChampaignUrbana, IL United States 61801
National Environmental Research CenterSolid and Hazardous Waste Research Laboratory
Cincinnati, OH United States
- Liebman, J C
- WATHNE, M
- Publication Date: 1974-12
- Pagination: 108 p.
- TRT Terms: Algorithms; City planning; Freight handling; Heuristic methods; Linear programming; Management; Numerical analysis; Planning; Routing; Solid waste disposal; Traffic regulations; Transportation; Trucks; Waste disposal
- Identifier Terms: Chinese postman problem
- Uncontrolled Terms: Hauling
- Old TRIS Terms: Collection; Management planning
- Subject Areas: Administration and Management; Economics; Maintenance and Preservation; Planning and Forecasting; Society; Transportation (General);
- Accession Number: 00090942
- Record Type: Publication
- Source Agency: National Technical Information Service
- Report/Paper Numbers: #1 Ann. Rpt.
- Contract Numbers: EPA-R-801289
- Files: TRIS
- Created Date: Jun 26 1975 12:00AM