完整後設資料紀錄
DC 欄位語言
dc.contributor.authorKao, JJen_US
dc.date.accessioned2019-04-02T06:00:53Z-
dc.date.available2019-04-02T06:00:53Z-
dc.date.issued1996-10-01en_US
dc.identifier.issn0098-3004en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0098-3004(96)00022-2en_US
dc.identifier.urihttp://hdl.handle.net/11536/149392-
dc.description.abstractLandfill siting requires performing spatial analyses for various factors to evaluate site suitability. A geographical information system, although capable of effectively manipulating spatial data, lacks the capability to locate an optimal site when compactness and other factors are considered simultaneously. In our previous work, a mixed-integer compactness model was proposed to overcome this difficulty. However, computational time with a conventional mixed-integer programming package for solving the model is time consuming and impractical. Therefore, in this work, a C program is developed, based on a proposed raster-based branch-and-bound algorithm. The program can implement multi-factor analyses for compactness and other siting factors with weights prespecified by the user. An example is provided to demonstrate the effectiveness of the program. Copyright (C) 1996 Elsevier Science Ltden_US
dc.language.isoen_USen_US
dc.subjectcompactnessen_US
dc.subjectspatial analysisen_US
dc.subjectlandfill sitingen_US
dc.subjectgeographic information systemen_US
dc.subjectoptimizationen_US
dc.subjectrasteren_US
dc.subjectCen_US
dc.titleA raster-based C program for siting a landfill with optimal compactnessen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0098-3004(96)00022-2en_US
dc.identifier.journalCOMPUTERS & GEOSCIENCESen_US
dc.citation.volume22en_US
dc.citation.spage837en_US
dc.citation.epage847en_US
dc.contributor.department環境工程研究所zh_TW
dc.contributor.departmentInstitute of Environmental Engineeringen_US
dc.identifier.wosnumberWOS:A1996VY61200001en_US
dc.citation.woscount15en_US
顯示於類別:期刊論文