Garbage Collection in Chicago: A Dynamic Scheduling Model

We investigate the scheduling of garbage trucks in the city of Chicago. Analysis of data collected from the system shows that city blocks differ in the rate at which garbage is collected. However, in the current system, each truck visits the dumpsite two times each day. Our approach is to devise a flexible routing scheme in which some routes visit the dumpsite only once per day, while others visit the dumpsite twice per day depending on the blocks assigned to the route. We use a Markov decision process to model the impact on capacity of using flexible routes. This provides a dynamic scheduling algorithm that adjusts the number of dumpsite visits throughout the week to maximize service level. Results of the model suggest a potential reduction in truck capacity of 12–16% for a set of five pilot wards. This paper shows that flexible schedules can significantly reduce the capacity required to operate a system in the presence of variability.

• 저널Management Science · 43(7) · 922–933
• 토픽Vehicle Routing Optimization Methods · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.43.7.922
• 저자Donald D. Eisenstein, Ananth V. Iyer