Abstract
To collect and dispose growing amounts of municipal solid waste (MSW) changed to be a hot topic along with the rapid urbanization in past decades. Cities are more and more dependent on the incineration instead of landfilling due to the cost-efficiency and environmental concerns. Considering the limited number of incineration plants and complicated situation of transportation in both spatial and temporal dimensions in different cities, the optimal routing for waste collection turns to be meaningful research topic. In this research, the ant colony optimization (ACO)-based multi-objective routing model coupled with min-max model and Dijkstra’s algorithm is proposed to address the question of which route to take from these waste-generating points to the target incineration plant(s) considering travel time, accident probability (black spots), and population exposure, so as to support the routing decision-making. The model is successfully implemented in Singapore and the effectiveness of the model has also been justified. Besides, few limitations of this research have also been discussed, some of which would also be the future directions of our research, especially the design and integration of a web-based routing decision-making support system.
| Original language | English |
|---|---|
| Pages (from-to) | 554-572 |
| Number of pages | 19 |
| Journal | International Journal of Geographical Information Science |
| Volume | 30 |
| Issue number | 3 |
| DOIs | |
| State | Published - 3 Mar 2016 |
| Externally published | Yes |
Keywords
- Optimal routing
- Pareto-optimal solution
- Singapore
- ant colony optimization (ACO)