Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, Hung-Yuehen_US
dc.contributor.authorTsai, Zong-Peien_US
dc.contributor.authorChen, Guan-Hwaen_US
dc.contributor.authorKao, Jehng-Jungen_US
dc.date.accessioned2014-12-08T15:37:52Z-
dc.date.available2014-12-08T15:37:52Z-
dc.date.issued2011-01-01en_US
dc.identifier.issn1047-3289en_US
dc.identifier.urihttp://dx.doi.org/10.3155/1047-3289.61.1.55en_US
dc.identifier.urihttp://hdl.handle.net/11536/26045-
dc.description.abstractSeparating recyclables from municipal solid waste (MSW) before collection reduces not only the quantity of MSW that needs to be treated but also the depletion of resources. However, the participation of residents is essential for a successful recycling program, and the level of participation usually depends on the degree of convenience associated with accessing recycling collection points. The residential accessing convenience (RAC) of a collection plan is determined by the proximity of its collection points to all residents and its temporal flexibility in response to resident requirements. The degree of proximity to all residents is determined by using a coverage radius that represents the maximum distance residents need to travel to access a recycling point. The temporal flexibility is assessed by the availability of proximal recycling points at times suitable to the lifestyles of all residents concerned. In Taiwan, the MSW collection is implemented at fixed locations and at fixed times. Residents must deposit their garbage directly into the collection vehicle. To facilitate the assignment of collection vehicles and to encourage residents to thoroughly separate their recyclables, in Taiwan MSW and recyclable materials are usually collected at the same time by different vehicles. A heuristic procedure including an integer programming (IP) model and ant colony optimization (ACO) is explored in this study to determine an efficient two-shift collection plan that takes into account RAC factors. The IP model has been developed to determine convenient collection points in each shift on the basis of proximity, and then the AGO algorithm is applied to determine the most effective routing plan of each shift. With the use of a case study involving a city in Taiwan, this study has demonstrated that collection plans generated using the above procedure are superior to current collection plans on the basis of proximity and total collection distance.en_US
dc.language.isoen_USen_US
dc.titleA Model for the Implementation of a Two-Shift Municipal Solid Waste and Recyclable Material Collection Plan that Offers Greater Convenience to Residentsen_US
dc.typeArticleen_US
dc.identifier.doi10.3155/1047-3289.61.1.55en_US
dc.identifier.journalJOURNAL OF THE AIR & WASTE MANAGEMENT ASSOCIATIONen_US
dc.citation.volume61en_US
dc.citation.issue1en_US
dc.citation.spage55en_US
dc.citation.epage62en_US
dc.contributor.department環境工程研究所zh_TW
dc.contributor.departmentInstitute of Environmental Engineeringen_US
dc.identifier.wosnumberWOS:000286448600007-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000286448600007.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.