摘要
Siting a landfill requires the processing of a large amount of spatial data. However, the manual processing of spatial data is tedious. A geographical information system (GIS), although capable of handling spatial data in siting analyses, generally lacks an optimization function. Optimization models are available for use with a GIS, but they usually have difficulties finding the optimal site from a large area within an acceptable computational time, and not easily directly available with a raster-based GIS. To overcome this difficulty, this study developed a two stage heuristic method. Multiple factors for landfill siting are considered and a weighted sum is computed for evaluating the suitability of a candidate site. The method first finds areas with significantly high potentialities and then applies a previously developed mixed-integer programming model to locate the optimal site within the potential areas, and can significantly reduce the computational time required for resolving a large siting problem. A case study was implemented to demonstrate the effectiveness of the proposed method, and a comparison with the previously developed model was provided and discussed.
原文 | English |
---|---|
頁(從 - 到) | 369-376 |
頁數 | 8 |
期刊 | Journal of Computing in Civil Engineering |
卷 | 19 |
發行號 | 4 |
DOIs | |
出版狀態 | Published - 10月 2005 |