A bi-objective integer programming model for locating garbage accumulation points: a case study

被引:5
|
作者
Gabriel Rossit, Diego [1 ]
Nesmachnow, Sergio [2 ]
Toutouh, Jamal [3 ]
机构
[1] Univ Nacl Sur, CONICET, INMABB, Dept Ingn, 1253 Alem Av CP B8000CPB, Bahia Blanca, Buenos Aires, Argentina
[2] Univ Republica, Fac Ingn, 565 Julio Herrera & Reissig Av, Montevideo 11300, Uruguay
[3] MIT, MIT Comp Sci & Artificial Intelligence Lab, 32 Vassar St, Cambridge, MA 02139 USA
基金
欧盟地平线“2020”;
关键词
Smart cities; municipal solid waste; multiobjetive optimization; MUNICIPAL SOLID-WASTE; EPSILON-CONSTRAINT METHOD; COLLECTION SITES; MANAGEMENT; IMPLEMENTATION; ALLOCATION;
D O I
10.17533/udea.redin.20190509
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Enhancing efficiency in Municipal Solid Waste (MSW) management is crucial for local governments, which are generally in charge of collection, since this activity explains a large proportion of their budgetary expenses. The incorporation of decision support tools can contribute to improve the MSW system, specially by reducing the required investment of funds. This article proposes a mathematical formulation, based on integer programming, to determine the location of garbage accumulation points while minimizing the expenses of the system, i.e., the installment cost of bins and the required number of visits the collection vehicle which is related with the routing cost of the collection. The model was tested in some scenarios of an important Argentinian city that stilts has a door-to-door system, including instances with unsorted waste, which is the current situation of the city, and also instances with source classified waste. Although the scenarios with classified waste evidenced to be more challenging for the proposed resolution approach, a set of solutions was provided in all scenarios. These solutions can be used as a starting point for migrating from the current door-to-door system to a community bins system.
引用
收藏
页码:70 / 81
页数:12
相关论文
共 50 条
  • [1] An Algorithm for Bi-Objective Integer Linear Programming Problem
    Prerna
    Sharma, Vikas
    FILOMAT, 2022, 36 (16) : 5641 - 5651
  • [2] Solving the Bi-Objective Integer Programming: A DEA Methodology
    Keshavarz, Esmaiel
    Toloo, Mehdi
    2014 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2014, : 60 - 64
  • [3] Branch-and-Bound for Bi-objective Integer Programming
    Parragh, Sophie N.
    Tricoire, Fabien
    INFORMS JOURNAL ON COMPUTING, 2019, 31 (04) : 805 - 822
  • [4] Bi-objective integer programming analysis based on the characteristic equation
    Al-Rabeeah, Masar
    Kumar, Santosh
    Al-Hasani, Ali
    Munapo, Elias
    Eberhard, Andrew
    INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT, 2019, 10 (05) : 937 - 944
  • [5] Bi-objective integer programming analysis based on the characteristic equation
    Masar Al-Rabeeah
    Santosh Kumar
    Ali Al-Hasani
    Elias Munapo
    Andrew Eberhard
    International Journal of System Assurance Engineering and Management, 2019, 10 : 937 - 944
  • [6] A bi-objective integer programming model for partly-restricted flight departure scheduling
    Zhong, Han
    Guan, Wei
    Zhang, Wenyi
    Jiang, Shixiong
    Fan, Lingling
    PLOS ONE, 2018, 13 (05):
  • [7] Bi-Objective Integer Programming of Hospitals Under Dynamic Electricity Price
    Vaziri, Shabnam Mahmoudzadeh
    Rezaee, Babak
    Monirian, Masoud Amel
    PROCEEDINGS OF THE TENTH INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2017, 502 : 409 - 417
  • [8] A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
    Rong, Aiying
    Figueira, Jose Rui
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 231 (02) : 299 - 313
  • [9] Bi-objective integer programming for RNA secondary structure prediction with pseudoknots
    Audrey Legendre
    Eric Angel
    Fariza Tahi
    BMC Bioinformatics, 19
  • [10] A ranking algorithm for bi-objective quadratic fractional integer programming problems
    Sharma, Vikas
    Dahiya, Kalpana
    Verma, Vanita
    OPTIMIZATION, 2017, 66 (11) : 1913 - 1929