Vehicle routing problem in waste collection: a case study in Son Tra, Da Nang

This study investigates the application of network analysis to optimize solid waste collection routes in Son Tra District, Da Nang City. Twelve collection routes, encompassing 30 collection points, were tracked using GPS equipment and digitized in QGIS. Key parameters such as length, velocity, and time were analyzed. By employing the Dijkstra algorithm, route optimization resulted in a significant reduction in average route length, from 12.94 ± 3.5 km to 9.42 ± 2.67 km, representing a 9-42% improvement. A paired sample t-test confirmed the statistical significance of this reduction (p<0.001). These findings demonstrate the potential of network analysis to optimize waste collection routes and reduce operational costs. However, the model's limitations, such as its focus on static, point-based collection routes and the exclusion of dynamic factors like traffic conditions and residential habits, should be considered for future research.

Authors

Institutions

Publication Details

Journal
The University of Danang - Journal of Science and Technology
Published
2024-11-30
DOI
https://doi.org/10.31130/ud-jst.2024.569e
Primary Topic
Municipal Solid Waste Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Vehicle routing problem in waste collection: a case study in Son Tra, Da Nang

Lê Hoàng Sơn, Truong Nguyen Song Ha, Nguyen Ngoc Phuong, Phan Bao An
The University of Danang - Journal of Science and Technology
Municipal Solid Waste Management
article

Vehicle routing problem in waste collection: a case study in Son Tra, Da Nang

Lê Hoàng Sơn, Truong Nguyen Song Ha, Nguyen Ngoc Phuong, Phan Bao An
article en

Abstract

This study investigates the application of network analysis to optimize solid waste collection routes in Son Tra District, Da Nang City. Twelve collection routes, encompassing 30 collection points, were tracked using GPS equipment and digitized in QGIS. Key parameters such as length, velocity, and time were analyzed. By employing the Dijkstra algorithm, route optimization resulted in a significant reduction in average route length, from 12.94 ± 3.5 km to 9.42 ± 2.67 km, representing a 9-42% improvement. A paired sample t-test confirmed the statistical significance of this reduction (p<0.001). These findings demonstrate the potential of network analysis to optimize waste collection routes and reduce operational costs. However, the model's limitations, such as its focus on static, point-based collection routes and the exclusion of dynamic factors like traffic conditions and residential habits, should be considered for future research.

The University of Danang - Journal of Science and Technology
University of Da Nang (VN)
Openalex Percentile: Top 71%
Municipal Solid Waste Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.