This report describes research on computer-based and manual techniques for the routing of solid waste collection vehicles. Algorithms are given for the routing of single vehicles under three conditions: (1) all streets are two way, (2) all streets are one way, and (3) some streets are two way and others are one way. In addition, a heuristic algorithm is provided for routing several vehicles in a larger area. Appendix A is a manual for use of the computer codes. Appendix B (separately bound) is a heuristic solution to the m-postmen's solution.
Routing of Solid Waste Collection Vehicles. Appendix A: Manual for Use of the Computer Codes
1974
68 pages
Report
Keine Angabe
Englisch
Solid Wastes Pollution & Control , Environmental Management & Planning , Solid waste disposal , Collection , Transportation , Routing , Management planning , Urban planning , Hauling , Trucks , Numerical analysis , Refuse disposal , Linear programming , Algorithms , Traffic regulations , Heuristic methods , Computer aided analysis , Chinese postman problem
Routing of Solid Waste Collection Vehicles
NTIS | 1974
Heuristic Routing for Solid Waste Collection Vehicles
NTIS | 1974
|DOAJ | 2023
|