| Main Title |
Routing of Solid Waste Collection Vehicles. Appendix B: A Heuristic Solution to the M-Postmen's Problem. |
| Author |
Liebman, Jon C. ;
Male., James W. ;
|
| 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-036b; |
| Stock Number |
PB-239 899 |
| Additional Subjects |
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
|
| Holdings |
| Library |
Call Number |
Additional Info |
Location |
Last
Modified |
Checkout
Status |
| NTIS |
PB-239 899 |
Some EPA libraries have a fiche copy filed under the call number shown. |
|
07/26/2022 |
|
| Collation |
130p |
| Abstract |
This paper presents the theory and procedure of an algorithm which routes a known number of solid waste collection vehicles on a city street network. The network is assumed to be planar and connected and consists of only undirected edges (two-way streets). Each edge has a cost and load associated with it. The purpose of the procedure is to route the vehicles from a depot to a collection area (district), through the district and back to the depot. The algorithm determines districts and tours simultaneously. For each tour it lists a sequence of nodes and specifies whether the edge leading to each node is traveled or serviced. Computational experience shows that the algorithm is feasible for a network with as many as 90 nodes. |
