Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Soft computing methods for multiobjective location of garbage accumulation points in smart cities

Soft computing methods for multiobjective location of garbage accumulation points in smart cities

Thumbnail Image
Download
Name

10472_2019_9647_ReferencePDF.pdf

Size

8.47 MB

Format

Adobe PDF

Checksum (MD5)

7c91a1bb938179a308000b6eaec084d4

Download all files submitted through automated deposit
art_6960334468606145260.zip (8.15 MB)
Author(s)
Toutouh, Jamal
•
Rossit, Diego
•
Nesmachnow, Sergio
Date Issued
June 20, 2019
Publisher
Springer International Publishing
Version
Author's final manuscript
Abstract
Abstract This article describes the application of soft computing methods for solving the problem of locating garbage accumulation points in urban scenarios. This is a relevant problem in modern smart cities, in order to reduce negative environmental and social impacts in the waste management process, and also to optimize the available budget from the city administration to install waste bins. A specific problem model is presented, which accounts for reducing the investment costs, enhance the number of citizens served by the installed bins, and the accessibility to the system. A family of single- and multi-objective heuristics based on the PageRank method and two mutiobjective evolutionary algorithms are proposed. Experimental evaluation performed on real scenarios on the cities of Montevideo (Uruguay) and Bahía Blanca (Argentina) demonstrates the effectiveness of the proposed approaches. The methods allow computing plannings with different trade-off between the problem objectives. The computed results improve over the current planning in Montevideo and provide a reasonable budget cost and quality of service for Bahía Blanca.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/131458
DOI of Published Version
https://doi.org/10.1007/s10472-019-09647-5
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.