Main Title |
Routing of Solid Waste Collection Vehicles. Appendix A: A Linear Programming Approach for the Traveling Salesman Problem. |
Author |
Liebman, Jon C. ;
Hong., Saman ;
|
CORP Author |
Illinois Univ., Urbana.;National Environmental Research Center, Cincinnati, Ohio. Solid and Hazardous Waste Research Lab. |
Year Published |
1974 |
Report Number |
EPA-R-801289; EPA-ROAP-02AAE-04; EPA/670/2-74-035a; |
Stock Number |
PB-239 896 |
Additional Subjects |
Solid waste disposal ;
Collection ;
Transportation ;
Routing ;
Management planning ;
Hauling ;
Urban planning ;
Linear programming ;
Numerical analysis ;
Trucks ;
Refuse disposal ;
Mathematical models ;
Traffic regulations ;
Traveling salesman problem ;
Chinese postman problem ;
Computer aided analysis
|
Holdings |
Library |
Call Number |
Additional Info |
Location |
Last Modified |
Checkout Status |
NTIS |
PB-239 896 |
Some EPA libraries have a fiche copy filed under the call number shown. |
|
07/26/2022 |
|
Collation |
66p |
Abstract |
The first report provides the background for routing solid waste collection vehicles. Problems encountered with existing methods and possible solutions are given. Appendixes A and B are solutions to two classic routing problems. Appendix A takes the integer programming formulation of Dantzig, Fulkerson, and Johnson which is relaxed to a linear program and a column generation scheme found for its dual. Appendix B (separately bound) is a study applying network theory to the problem of routing a solid waste collection vehicle through a street network. The problem can be described mathematically as a linear program whose optimal solution is guaranteed to be integer. |