Show simple item record

contributor authorHung-Yueh Lin
contributor authorJehng-Jung Kao
date accessioned2017-05-08T21:13:12Z
date available2017-05-08T21:13:12Z
date copyrightOctober 2005
date issued2005
identifier other%28asce%290887-3801%282005%2919%3A4%28369%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/43238
description abstractSiting 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.
publisherAmerican Society of Civil Engineers
titleGrid-Based Heuristic Method for Multifactor Landfill Siting
typeJournal Paper
journal volume19
journal issue4
journal titleJournal of Computing in Civil Engineering
identifier doi10.1061/(ASCE)0887-3801(2005)19:4(369)
treeJournal of Computing in Civil Engineering:;2005:;Volume ( 019 ):;issue: 004
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record