Waste Collection Area Generation Using a 2 Stage Cluster Optimization Process and GIS Data

The division of a city into several waste collection areas can have a large influence on the workload distribution put in place for the waste collection personnel. Additionally, areas with rapid urban development can benefit from a systematic way to automate the collection area division given that t...

Full description

Bibliographic Details
Main Authors: Tyler Parsons, Jaho Seo, Dan Livesey
Format: Article
Language:English
Published: IEEE 2023-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/10035024/
_version_ 1811167521188872192
author Tyler Parsons
Jaho Seo
Dan Livesey
author_facet Tyler Parsons
Jaho Seo
Dan Livesey
author_sort Tyler Parsons
collection DOAJ
description The division of a city into several waste collection areas can have a large influence on the workload distribution put in place for the waste collection personnel. Additionally, areas with rapid urban development can benefit from a systematic way to automate the collection area division given that there is geographical information containing stop locations with an approximate number of dwelling units. This paper proposes a 2-stage collection area optimization process using the weighted K-means algorithm paired with differential evolution to minimize the standard deviation of dwelling units across each collection area. Results from a case study in The City of Oshawa, Canada prove that the proposed clustering techniques can yield a set of collection areas with 87.75% improvement compared to the current arrangement in terms of balancing the dwelling units. Additionally, the same clustering techniques can be used to assign collection routes for the vehicles in each area. A combination of Dijkstra’s and Hierholzer’s algorithms is applied to generate a route simulation with accompanying statistics regarding the total distance travelled, collection time, travel time, and fuel consumed. Specific to the case study in The City of Oshawa, each day of the week has 2 collection areas, and a genetic algorithm is used to find the optimal collection area pairs. Results from the collection area pairing show that there is a 38.04% and 37.54% improvement of simulated statistics for Week 1 and 2 collections, respectively.
first_indexed 2024-04-10T16:11:52Z
format Article
id doaj.art-b9a38535f0f444b38a7239fdfb9b0010
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-04-10T16:11:52Z
publishDate 2023-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-b9a38535f0f444b38a7239fdfb9b00102023-02-10T00:00:28ZengIEEEIEEE Access2169-35362023-01-0111118491185910.1109/ACCESS.2023.324162610035024Waste Collection Area Generation Using a 2 Stage Cluster Optimization Process and GIS DataTyler Parsons0https://orcid.org/0000-0003-4475-8748Jaho Seo1https://orcid.org/0000-0002-1045-719XDan Livesey2Department of Automotive and Mechatronics Engineering, Ontario Tech University, Oshawa, CanadaDepartment of Automotive and Mechatronics Engineering, Ontario Tech University, Oshawa, CanadaOperations Policy and Research Analyst, City of Oshawa, Oshawa, CanadaThe division of a city into several waste collection areas can have a large influence on the workload distribution put in place for the waste collection personnel. Additionally, areas with rapid urban development can benefit from a systematic way to automate the collection area division given that there is geographical information containing stop locations with an approximate number of dwelling units. This paper proposes a 2-stage collection area optimization process using the weighted K-means algorithm paired with differential evolution to minimize the standard deviation of dwelling units across each collection area. Results from a case study in The City of Oshawa, Canada prove that the proposed clustering techniques can yield a set of collection areas with 87.75% improvement compared to the current arrangement in terms of balancing the dwelling units. Additionally, the same clustering techniques can be used to assign collection routes for the vehicles in each area. A combination of Dijkstra’s and Hierholzer’s algorithms is applied to generate a route simulation with accompanying statistics regarding the total distance travelled, collection time, travel time, and fuel consumed. Specific to the case study in The City of Oshawa, each day of the week has 2 collection areas, and a genetic algorithm is used to find the optimal collection area pairs. Results from the collection area pairing show that there is a 38.04% and 37.54% improvement of simulated statistics for Week 1 and 2 collections, respectively.https://ieeexplore.ieee.org/document/10035024/ClusteringGIS dataoptimizationsimulationwaste collection routes
spellingShingle Tyler Parsons
Jaho Seo
Dan Livesey
Waste Collection Area Generation Using a 2 Stage Cluster Optimization Process and GIS Data
IEEE Access
Clustering
GIS data
optimization
simulation
waste collection routes
title Waste Collection Area Generation Using a 2 Stage Cluster Optimization Process and GIS Data
title_full Waste Collection Area Generation Using a 2 Stage Cluster Optimization Process and GIS Data
title_fullStr Waste Collection Area Generation Using a 2 Stage Cluster Optimization Process and GIS Data
title_full_unstemmed Waste Collection Area Generation Using a 2 Stage Cluster Optimization Process and GIS Data
title_short Waste Collection Area Generation Using a 2 Stage Cluster Optimization Process and GIS Data
title_sort waste collection area generation using a 2 stage cluster optimization process and gis data
topic Clustering
GIS data
optimization
simulation
waste collection routes
url https://ieeexplore.ieee.org/document/10035024/
work_keys_str_mv AT tylerparsons wastecollectionareagenerationusinga2stageclusteroptimizationprocessandgisdata
AT jahoseo wastecollectionareagenerationusinga2stageclusteroptimizationprocessandgisdata
AT danlivesey wastecollectionareagenerationusinga2stageclusteroptimizationprocessandgisdata