A novel methodology for determining low-cost fine particulate matter street sweeping routes

This paper addresses the problem of low-cost PM10 (particulate matter with aerodynamic diameter <10 μm) street sweeping route. In order to do so, only a subset of the streets of the urban area to be swept is selected for sweeping, based on their PM10 emission factor values. Subsequently, a low-cost route that visits each street in the set is computed. Unlike related problems of waste collection where streets must be visited once (Chinese or Rural Postman Problem, respectively), in this case, the sweeping vehicle route must visit each selected street exactly as many times as its number of street sides, since the vehicle can sweep only one street side at a time. Additionally, the route must comply with traffic flow and turn constraints. A novel transformation of the original arc routing problem into a node routing problem is proposed in this paper. This is accomplished by building a graph that represents the area to sweep in such a way that the problem can be solved by applying any known solution to the Traveling Salesman Problem (TSP). As a way of illustration, the proposed method was applied to the northeast area of the Municipality of Santiago (Chile). Results show that the proposed methodology achieved up to 37% savings in kilometers traveled by the sweeping vehicle when compared to the solution obtained by solving the TSP problem with Geographic Information Systems (GIS) - aware tools. Implications The exposure to PM10 has been shown to be harmful to human health. Street sweeping is an effective mitigating measure used to reduce the amount of PM10. This paper proposes a generic method to determine a low-cost PM10 sweeping route. This problem has seldom been studied in the literature, with only two previous papers focusing on solving it under very specific circumstances, which makes them not applicable to generic scenarios. By providing a generic method that solves the problem under different scenarios, it is expected to facilitate the decision-making process of environmental and other public agencies regarding the implementation of sweeping routes.

[1]  C. Johansson,et al.  A review on the effectiveness of street sweeping, washing and dust suppressants as urban PM control methods. , 2010, Science of the Total Environment.

[2]  Pierre F. Lemieux,et al.  The snow ploughing problem solved by a graph theory algorithm , 1984 .

[3]  Michel Gendreau,et al.  Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..

[4]  Bart Sanchez Jose Miguel Aranda Carlos Eskeland Gunnar Ostr,et al.  Air Pollution and Mortality: Results from Santiago, Chile , 1999 .

[5]  Temel Öncan,et al.  A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..

[6]  Nathalie Perrier,et al.  A survey of models and algorithms for winter road maintenance. Part II: system design for snow disposal , 2006, Comput. Oper. Res..

[7]  Mar Viana,et al.  Spatial and chemical patterns of PM10 in road dust deposited in urban environment , 2009 .

[8]  J. Sarnat,et al.  Analysis of PM10, PM2.5, and PM2.5–10Concentrations in Santiago, Chile, from 1989 to 2001 , 2005, Journal of the Air & Waste Management Association.

[9]  William J. Cook,et al.  Certification of an optimal TSP tour through 85, 900 cities , 2009, Oper. Res. Lett..

[10]  D. Fitz,et al.  Measurement of PM 10 Emission Factors from Paved Roads Using On-Board Particle Sensors , 2002 .

[11]  J. Schwartz,et al.  Is Daily Mortality Associated Specifically with Fine Particles? , 1996, Journal of the Air & Waste Management Association.

[12]  Scott L. Zeger,et al.  Air Pollution and Mortality , 2002 .

[13]  Gilbert Laporte,et al.  Modeling and solving several classes of arc routing problems as traveling salesman problems , 1997, Comput. Oper. Res..

[14]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

[15]  André Langevin,et al.  A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal , 2005, Comput. Oper. Res..

[16]  David H. Marks,et al.  ROUTING FOR PUBLIC SERVICE VEHICLES , 1971 .

[17]  H. Jorquera Air quality at Santiago, Chile: a box modeling approach II. PM2.5, coarse and PM10 particulate matter fractions , 2002 .

[18]  Yu-min Chang,et al.  Effectiveness of street sweeping and washing for controlling ambient TSP , 2005 .

[19]  D. Dockery,et al.  Health Effects of Fine Particulate Air Pollution: Lines that Connect , 2006, Journal of the Air & Waste Management Association.

[20]  J. D. Whyatt,et al.  Regional scale modelling of particulate matter in the UK, source attribution and an assessment of uncertainties , 2007 .

[21]  I. Romieu,et al.  Association between levels of fine particulate and emergency visits for pneumonia and other respiratory illnesses among children in Santiago, Chile. , 1999, Journal of the Air and Waste Management Association.

[22]  E. Furusjö,et al.  PM(10) source characterization at urban and highway roadside locations. , 2007, The Science of the total environment.

[23]  L. Lave,et al.  Effect of the Fine Fraction of Particulate Matter versus the Coarse Mass and Other Pollutants on Daily Mortality in Santiago, Chile , 2000, Journal of the Air & Waste Management Association.

[24]  R. Jonker,et al.  Transforming asymmetric into symmetric traveling salesman problems , 1983 .

[25]  R. Eglese,et al.  Routeing Road Sweepers in a Rural Area , 1991 .

[26]  William M. Springer Review of the traveling salesman problem: a computational study by Applegate, Bixby, Chvátal, and Cook (Princeton University Press) , 2009, SIGA.

[27]  Chung-Shin Yuan,et al.  Influence of Operating Parameters on the Collection Efficiency and Size Distribution of Street Dust during Street Scrubbing , 2003 .

[28]  Leena Jain,et al.  Traveling Salesman Problem: A Case Study , 2012, BIOINFORMATICS 2012.

[29]  Khairuddin Omar,et al.  Vehicle routing problem: models and solutions , 2008 .

[30]  C R Moss ROUTING METHODOLOGY FOR SNOW PLOWS AND CINDERING TRUCKS , 1970 .

[31]  Michael Hahsler,et al.  TSPInfrastructure for the Traveling Salesperson Problem , 2007 .

[32]  Roberto Baldacci,et al.  Exact methods based on node‐routing formulations for undirected arc‐routing problems , 2006, Networks.

[33]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[34]  Hampden D. Kuhns,et al.  Vehicle-based road dust emission measurement—Part II: Effect of precipitation, wintertime road sanding, and street sweepers on inferred PM10 emission potentials from paved and unpaved roads , 2003 .

[35]  I. Romieu,et al.  Association between Levels of Fine Particulate and Emergency Visits for Pneumonia and other Respiratory Illnesses among Children in Santiago, Chile. , 1999, Journal of the Air & Waste Management Association.

[36]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[37]  Lawrence Bodin,et al.  A Computer-Assisted System for the Routing and Scheduling of Street Sweepers , 1978, Oper. Res..

[38]  R. Burnett,et al.  Lung cancer, cardiopulmonary mortality, and long-term exposure to fine particulate air pollution. , 2002, JAMA.