Please use this identifier to cite or link to this item:
logo share SHARE logo core CORE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE

Approximate dynamic programming for automated vacuum waste collection systems

AuthorsFernandez, Cesar; Manyà, Felip CSIC ORCID ; Mateu, Carles; Sole-Mauri, Francina
KeywordsMarkov processes
Smart cities
Cost effectiveness
Automated Vacuum Waste Collection (AVWC)
Quality of service
Waste treatment
Urban wastes
Energy utilization
Issue Date2015
CitationEnvironmental Modelling and Software 67: 128- 137 (2015)
AbstractThe collection and treatment of waste poses a major challenge to modern urban planning, particularly to smart cities. To cope with this problem, a cost-effective alternative to conventional methods is the use of Automated Vacuum Waste Collection (AVWC) systems, using air suction on a closed network of underground pipes to transport waste from the drop off points scattered throughout the city to a central collection point. This paper describes and empirically evaluates a novel approach to defining daily operation plans for AVWC systems to improve quality of service, and reduce energy consumption, which represents about 60% of the total operation cost. We model a daily AVWC operation as a Markov decision process, and use Approximate Dynamic Programming techniques (ADP) to obtain optimal operation plans. The experiments, comparing our approach with the current approach implemented in some real-world AVWC systems, show that ADP techniques significantly improve the quality of AVWC operation plans. © 2015 Elsevier Ltd.
Identifiersdoi: 10.1016/j.envsoft.2015.01.013
issn: 1364-8152
Appears in Collections:(IIIA) Artículos

Files in This Item:
File Description SizeFormat
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

Google ScholarTM




WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.