A Model for Municipal Street Sweeping Operations

  • A. C. Tucker
  • L. Bodin
Part of the Modules in Applied Mathematics book series


An enormous variety of human activities can be the subject of mathematical modeling. To optimize the performance of an auto assembly line, the process of putting two screws into an auto chassis may be broken into, say, 25 carefully defined steps and then an order and timing of these steps is determined to make the process as easy, error-free, and quick as possible. As another example, in a recent criminal trial in New York, the defense attorneys relied heavily on computer-generated profiles to pick a jury most favorably disposed towards the defendants.


Short Path Span Tree Directed Graph Undirected Graph Minimal Span Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    F. Busacker and T. Saaty, Finite Graphs and Their Applications. New York: McGraw-Hill, 1966. A good basic text in graph theory that covers a lot of ground; the second half is a survey of applications.Google Scholar
  2. [2]
    O. Ore, Graphs and Their Uses. New York: Random House, 1963. A short, introduction to graph theory written for able high school students (and lower division undergraduates); of the many interesting applications, the logical puzzles (Sections 2.4 and 6.1) are especially enjoyable.MATHGoogle Scholar
  3. [3]
    R. Wilson, Introduction to Graph Theory. New York: Academic Press, 1972. A concise, well-written undergraduate text.MATHGoogle Scholar
  4. [4]
    F. Hillier and G. Lieberman, Introduction to Operations Research. San Francisco:Holden-Day, 1967. The classic undergraduate operations research text; the algorithms used in this module are discussed in greater detail in Chapters 6 and 7.MATHGoogle Scholar
  5. [5]
    H. Wagner, Principles of Operations Research. Englewood Cliffs, NJ: Prentice- Hall, 1969. The other standard operations research text; is a bit more advanced than [4]; algorithms used in this module are in Chapter 6.MATHGoogle Scholar
  6. [6]
    L. Bodin, “A taxometric structure for vehicle routing and scheduling problems,” J. Computers and the Urban Society, vol. 1, pp. 11–29, 1975. This paper presents the cluster-first method and some node-covering problems (in this module we did edge covering) as well as a primitive version of the procedure presented in this module.CrossRefGoogle Scholar
  7. [7]
    E. Beltrami and L. Bodin, “Networks and vehicle routing for municipal waste collection,” Networks, vol. 4, pp. 65–94, 1973. This paper describes two other garbage routing problems as well as a primitive version of the procedure presented in this module.CrossRefGoogle Scholar
  8. [8]
    J. Meckling, “Chart day problem: A case study in successful innovation,” J. Urban Policy, vol. 2, no. 2, Nov. 1974. This paper, written by a New York City Sanitation Department administrator, describes some mathematical analysis which did not contain as interesting modeling as in this module but which resulted in an annual savings to the city of about $10,000,000. Google Scholar
  9. [9]
    J. Edmonds and E. Johnson, “Matching, Euler tours, and the Chinese postman,” Mathematical Programming, vol. 5, pp. 88–124, 1973. This paper presents a way to build a Euler circuit in a directed graph all at once (without first getting several circuits that must be joined together as we did in Theorem 1); their method is based on a directed spanning tree and is quite intuitive.CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1983

Authors and Affiliations

  • A. C. Tucker
    • 1
  • L. Bodin
    • 2
  1. 1.Department of Applied Mathematics and StatisticsState University of New YorkStony BrookUSA
  2. 2.School of BusinessUniversity of MarylandCollege ParkUSA

Personalised recommendations