ROUTING OF SOLID WASTE COLLECTION VEHICLES. APPENDIX A: A LINEAR PROGRAMMING APPROACH FOR THE TRAVELING SALESMAN PROBLEM

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.

  • Supplemental Notes:
    • Paper copy also available in set of 4 reports as PB-239 895-SET, PC$16.00.
  • Corporate Authors:

    University of Illinois, Urbana-Champaign

    Urbana, IL  USA  61801

    National Environmental Research Center

    Solid and Hazardous Waste Research Laboroatory
    Cincinnati, OH  USA 
  • Authors:
    • Liebman, J C
    • HONG, S
  • Publication Date: 1974-12

Media Info

  • Pagination: 66 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00090943
  • 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