10.2190/GVNH-4F26-6E3T-WKJJ GVNH4F266E3TWKJJ 6 Balancing Waste Collection Routes 367 373 20020509 20020509 20020509 20020509 GVNH4F266E3TWKJJ.pdf http://baywood.metapress.com/link.asp?target=contribution&id=GVNH4F266E3TWKJJ 4 Dean S. Shupe Richard L. Shell University of Cincinnati Approximately 10 per cent of every American community's budget is spent to collect and dispose of its solid waste. This paper examines the collection of residential waste using the team approach with load packer trucks. Utilizing the variables number of collection trucks, helpers, families serviced, stops, tons of waste collected, and total haul mileage to the incinerator, a stepwise multiple linear regression analysis was performed to predict the work content of 40 collection areas in the City of Cincinnati, Ohio. The multiple coefficients of correlation and determination are 0.88 and 0.77, respectively, with a standard error of 4 per cent of the average daily work time. The results are valuable for evaluating present collection operations. "A Study of Solid Waste Collection Systems Comparing One-Man with Multi-Man Crews," Ralph Stone and Company, Inc., USPHS Publication No. 1892, p. iii, 1969. Balinski, M. L., and R. E. Quandt, On an integer program for a delivery problem, <i>Operations Research, 12</i>, 300-304, 1964. Bellmore, M., and G. Nemhauser, The traveling salesman problem-a survey, <i>Operations Research, 16</i>, May-June 1968. Clarke, G., and J. W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, <i>Operations Research Society of America, 12</i>, 568-581, 1964. Dantzig, G. B., and J. H. Ramser, The truck dispatching problem, <i>Management Science, 6</i>, 81-91, October 1959. Garvin, W. W., H. W. Crandall, J. B. John, and R. A. Spellman, Application of linear programming in the oil industry, <i>Management Science, 3</i>, 407-430, 1957. Held, M., and R. M. Karp, A dynamic programming approach to sequencing problems, <i>Journal of the Society for Industrial and Applied Mathematics, 10</i>, 196-210, 1962. Little, J. D. C, K. G. Murty, D. W. Sweeney, and C. Karel, An algorithm for the traveling salesman problems. <i>Operations Research, 11</i>, 972-989, 1963. Mills, G., A decomposition algorithm for the shortest-route problem, <i>Operations Research Society of America, 14</i>, 279-291, 1966. Szwarc, W., The truck assignment problem, <i>Naval Logistics Review Quarterly</i>, 529-557, 1967. Owen, E. H., "Computer Program Cuts Cost of Urban Solid Waste Collection," <i>Public Works</i>, Vol. 102, no. 1, 60-62, 1970. Rothgeb, W. L., "Computerized Refuse Collection," <i>Public Works</i>, Vol. 102, no. 4, 88-154, 1970. Quon, J. E., A. Charnes, and S. J. Wersan, "Simulation and Analysis of a Refuse Collection System," <i>Journal of the Sanitary Engineering Division, American Society of Civil Engineers, 95, SA3</i>, June 1969. Data for a sample ten week analysis period was provided by the Division of Waste Collection, City of Cincinnati, Ohio. The 43 time is recorded when the last can is collected in a district.