Multi-objective optimization of solid waste flows: Environmentally sustainable strategies for municipalities
By CostBenefit on Sep 12, 2008 | In Europe, Academic Study/Journal Article, Waste & Recycling, Regulatory Analysis, Computer Software/Database/Model, Costs and Benefits | Send feedback »
Link: http://dx.doi.org/10.1016/j.wasman.2007.10.003
Abstract: An approach to sustainable municipal solid waste (MSW) management is presented, with the aim of supporting the decision on the optimal flows of solid waste sent to landfill, recycling and different types of treatment plants, whose sizes are also decision variables. This problem is modeled with a non-linear, multi-objective formulation. Specifically, four objectives to be minimized have been taken into account, which are related to economic costs, unrecycled waste, sanitary landfill disposal and environmental impact (incinerator emissions). An interactive reference point procedure has been developed to support decision making; these methods are considered appropriate for multi-objective decision problems in environmental applications. In addition, interactive methods are generally preferred by decision makers as they can be directly involved in the various steps of the decision process. Some results deriving from the application of the proposed procedure are presented. The application of the procedure is exemplified by considering the interaction with two different decision makers who are assumed to be in charge of planning the MSW system in the municipality of Genova (Italy).
by Riccardo Minciardi 1 and 2 Massimo Paolucci 1 and 2 Michela Robba 1 and 2 and Roberto Sacile 1 and 2
1. DIST, Department of Communication, Computer and System Sciences, University of Genova, Via Opera Pia 13, 16145 Genova, Italy
2. CIMA, Interuniversity Center for Environmental Monitoring, Via Cadorna 7, 17100 Savona, Italy
Waste Management via Elsevier Science Direct www.ScienceDirect.com
Volume 28, Issue 11; November, 2008; Pages 2202-2212
http://dx.doi.org/10.1016/j.wasman.2007.10.003
