Garbage Truck Collection Area Layout- A Case Study of the Nantun District in Taichung City
碩士 === 朝陽科技大學 === 建築及都市設計研究所 === 94 === Garbage collection has been an important aspect of urban sanitary and health issues. Most cities have set up some type of garbage collection plan using the combination of collection points and collection routes. However, in lacking of real time and reasonable...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/ff2def |
id |
ndltd-TW-094CYUT5224020 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094CYUT52240202019-05-15T19:17:50Z http://ndltd.ncl.edu.tw/handle/ff2def Garbage Truck Collection Area Layout- A Case Study of the Nantun District in Taichung City 垃圾車收運範圍劃設之研究-以台中市南屯區為例 Kuan-Yu Lin 林冠宇 碩士 朝陽科技大學 建築及都市設計研究所 94 Garbage collection has been an important aspect of urban sanitary and health issues. Most cities have set up some type of garbage collection plan using the combination of collection points and collection routes. However, in lacking of real time and reasonable approach the collection plan causes the route distribution crowded, working hours unbalanced and service boundary blurred. In garbage collection route planning, planner should not only consider the distance or cost, instead, work load balance and garbage load balance should also be considered. Therefore, how to redistribute exist routes using the same collection points to fulfill the desired objectives is the prime goal of this study. Garbage collection route planning belongs to Vehicle Routing Problems (VRP). In this study, we tried to balance working hours load first, at the same time considering the 3 times of standard deviation of garbage load, collection points and collection distance as constraints. This study applys the Geographic Information System technique and uses VRP’s Cluster First Route Second algorithm along with Voronoi Diagram and Floating Catchments Method to cluster all the collection points and generate service area of each route. Once the area of each route can be generated, we then use Nearest Neighbor Method to construct the final route and calculate the daily garbage load and travel distance. By this approach, we wish to minimize the total operation cost and give a systematic procedure to plan the future garbage collection routes in the study area. This study shows that in Nantun District we can layout 14 sub-districts and 8 of them are within the requirements of this study. However, 6 of them are unable satisfy the requirements due to the population distribution and current road structure. As a whole, this study proves that only 7 garbage trucks needed verses currently 10 trucks after using the new approach, the total trips of collection drops from 21 to 14 and the total travel distance reduced dramatically from 471 Km. to 160 Km. which are few significant improvements generated from this study. We hope that the results from this study can serve as an important role of planning the future garbage collection points by following the dynamically changing of urban development and population distribution. Further, by establishing a systematic and informatic operation the city government can adjust garbage collection routes in shortest period of time so that conflicts can be reduced. Yung-Tang Shen 沈永堂 2006 學位論文 ; thesis 133 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 朝陽科技大學 === 建築及都市設計研究所 === 94 === Garbage collection has been an important aspect of urban sanitary and health issues. Most cities have set up some type of garbage collection plan using the combination of collection points and collection routes. However, in lacking of real time and reasonable approach the collection plan causes the route distribution crowded, working hours unbalanced and service boundary blurred. In garbage collection route planning, planner should not only consider the distance or cost, instead, work load balance and garbage load balance should also be considered. Therefore, how to redistribute exist routes using the same collection points to fulfill the desired objectives is the prime goal of this study.
Garbage collection route planning belongs to Vehicle Routing Problems (VRP). In this study, we tried to balance working hours load first, at the same time considering the 3 times of standard deviation of garbage load, collection points and collection distance as constraints. This study applys the Geographic Information System technique and uses VRP’s Cluster First Route Second algorithm along with Voronoi Diagram and Floating Catchments Method to cluster all the collection points and generate service area of each route. Once the area of each route can be generated, we then use Nearest Neighbor Method to construct the final route and calculate the daily garbage load and travel distance. By this approach, we wish to minimize the total operation cost and give a systematic procedure to plan the future garbage collection routes in the study area.
This study shows that in Nantun District we can layout 14 sub-districts and 8 of them are within the requirements of this study. However, 6 of them are unable satisfy the requirements due to the population distribution and current road structure. As a whole, this study proves that only 7 garbage trucks needed verses currently 10 trucks after using the new approach, the total trips of collection drops from 21 to 14 and the total travel distance reduced dramatically from 471 Km. to 160 Km. which are few significant improvements generated from this study. We hope that the results from this study can serve as an important role of planning the future garbage collection points by following the dynamically changing of urban development and population distribution. Further, by establishing a systematic and informatic operation the city government can adjust garbage collection routes in shortest period of time so that conflicts can be reduced.
|
author2 |
Yung-Tang Shen |
author_facet |
Yung-Tang Shen Kuan-Yu Lin 林冠宇 |
author |
Kuan-Yu Lin 林冠宇 |
spellingShingle |
Kuan-Yu Lin 林冠宇 Garbage Truck Collection Area Layout- A Case Study of the Nantun District in Taichung City |
author_sort |
Kuan-Yu Lin |
title |
Garbage Truck Collection Area Layout- A Case Study of the Nantun District in Taichung City |
title_short |
Garbage Truck Collection Area Layout- A Case Study of the Nantun District in Taichung City |
title_full |
Garbage Truck Collection Area Layout- A Case Study of the Nantun District in Taichung City |
title_fullStr |
Garbage Truck Collection Area Layout- A Case Study of the Nantun District in Taichung City |
title_full_unstemmed |
Garbage Truck Collection Area Layout- A Case Study of the Nantun District in Taichung City |
title_sort |
garbage truck collection area layout- a case study of the nantun district in taichung city |
publishDate |
2006 |
url |
http://ndltd.ncl.edu.tw/handle/ff2def |
work_keys_str_mv |
AT kuanyulin garbagetruckcollectionarealayoutacasestudyofthenantundistrictintaichungcity AT línguānyǔ garbagetruckcollectionarealayoutacasestudyofthenantundistrictintaichungcity AT kuanyulin lājīchēshōuyùnfànwéihuàshèzhīyánjiūyǐtáizhōngshìnántúnqūwèilì AT línguānyǔ lājīchēshōuyùnfànwéihuàshèzhīyánjiūyǐtáizhōngshìnántúnqūwèilì |
_version_ |
1719086564093460480 |