See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/331225632

Municipal Solid Waste Management in Smart Cities: Facility Location of

Community Bins

Article  in  Communications in Computer and Information Science · February 2019

DOI: 10.1007/978-3-030-12804-3_9

CITATIONS READS
5 1,334

3 authors:

Diego Gabriel Rossit Sergio Nesmachnow

Universidad Nacional del Sur Universidad de la República de Uruguay
49 PUBLICATIONS   146 CITATIONS    229 PUBLICATIONS   1,919 CITATIONS   

SEE PROFILE SEE PROFILE

Jamal Toutouh
Massachusetts Institute of Technology
97 PUBLICATIONS   768 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

moveON View project

Forestry logistics View project

All content following this page was uploaded by Jamal Toutouh on 03 June 2019.

The user has requested enhancement of the downloaded file.

 Municipal solid waste in smart cities: facility
location of community bins

Diego G. Rossit1 , Sergio Nesmachnow2 , and Jamal Toutouh3

1
DI, Universidad Nacional del Sur and CONICET, Argentina
diego.rossit@uns.edu.ar
2
Universidad de la República, Uruguay
sergion@fing.edu.uy
3
Universidad de Málaga, Spain
jamal@lcc.uma.es

Abstract. Under the smart cities paradigm there are several urban ac-
tivities that can be addressed. Among them, residential garbage collec-
tion. This is a key activity that explains a large proportion of budget
expenses for local governments. The usage of community bins instead
of a door-to-door system can help to reduce logistic costs. This paper
focuses on the selection of community bins location in a medium size
Argentinian city, that stills uses a door-to-door system. An Integer pro-
gramming model is presented to locate community bins that minimize
the installment cost while also maximize the days between two consecu-
tive visit of the collection vehicle.

Keywords: Smart cities · Municipal solid waste · Multiobjetive opti-

mization

1 Introduction

In a context of increasingly population concentration in limited areas the pres-

sure over governments to find intelligent and efficient solutions to provide good
quality services is at its peak. In this sense the Smart cities paradigm are known
for using Information and Communication Technologies (ICT) to enhance the
life quality of citizens. Therefore, several urban activities have been addressed
with ICTs (see Neirotti et al. [24]). We can find examples in public transport
scheduling using intelligent transport systems (Massobrio et al. [21] and Pena
et al. [27]), health services (Solanas et al.[34]), and energy management (Orsi
and Nesmachnow [26]) but also in other non-traditional fields, such as educa-
tion (Gómez et al. [14]). Another field were ICT technologies can be applied is
Municipal Solid Waste (MSW) management (see, e.g., Nesmachnow et al. [25]
and Toutouh et al. [35]), where ICT can help to mitigate the environmental and
economic problems associated with MSW management (Hoornweg and Bhada-
Tata [17]). These problems are more serious in developing countries, such as
Argentina, due to budgetary and technological restrictions (Kinobe et al. [19]).
2 D. Rossit, S. Nesmachnow, J. Toutouh

In this paper we focus on the problem of selecting the proper location of

garbage community bins for a city with the aim of migrating from a door-to-
door collection to a community bins system that is expected to be more efficient
in terms of logistic costs (Bonomo et al. [2]). Solutions that help to reduce
logistics cost are of particular interest for Argentinian cities since transportation
cost in this country are extremely high in comparison to neighboring countries
(Broz et al. [4]). Bahı́a Blanca, an important medium size city in the South
of Argentina, has a door-to-door collection system. The objective of migrating
from this system to a community bin system, where the citizens have to carry
their waste to certain bins, is usually among the plans of the local authorities
for reducing the collection complexity. This is the reason why other important
cities in the country have taken in the community bins system, such as Buenos
Aires, Rosario and Neuquén.
As stated, using a community bins system has certain advantages over the
door-to-door system. However, the location of bins in an urban area is not a
trivial problem if it is supposed to be efficient (Toutouth et al. [?]). Firstly,
because the underlying problem is quite complex since it is a variation of the
Capacitated Facility Location Problem (CFLP), which has been proven to be
NP-hard through a reduction to a 3-dimensional matching problem (3DM) (see
Cornuejols et al. [5]). Besides this inherited computational complexity, finding
the ubity of garbage accumulation points have also an extra difficulty associated
with the several criteria that are expected to be taken into account during the
process. For example, containers should not be very far from the generators
since this would provoke its misuse. On the other hand, a proper scheduling
of collection vehicles should be established to avoid bins overflowing. Moreover,
the frequency of garbage collection will have an impact on the necessary bin
capacity.
This article is structured as follows. In Section 2 we present the mathematical
formulation of the target problem and the main related work. In Section 3 we
present the solution approach that is used for solving the previous model. In
Section 4, the scenarios that were used and the main results are presented.
Finally, in Section 5 the main conclusions and future research lines are proposed.

2 Problem description

We consider the problem of locating garbage accumulation points (hereafter

GAP) while optimizing two different criteria: the first criteria is to minimize the
total investment cost, that is composed by the cost of installing each individual
bin. The second criteria is to enhance the “autonomy” of the GAPs. “Autonomy”
is related to the number of days that a GAP can await between two consecutive
visits of the collection vehicle (to empty the bins). Naturally, the larger number
of bins a GAP has, the larger is the storage capacity of this GAP and the larger
is the period of “autonomy”. However, a large number of bins also implies a
large resources investment to purchase the bins.
 Facility location of solid waste community bins in smart cities 3

The problem can be modeled as a an Integer Programming (IP) model by

considering the following elements:

– A set I = {i1 , . . . , i|I| }} of potential GAPs for bins. Each GAP i has an
available space Esi for installing bins.

– A set P = {p1 , . . . , p|P | } of generators. Following a usual approach in the re-

lated literature, nearby generators are grouped in clusters, assuming a similar
behavior between elements in each cluster. The amount of waste produced
by generator p (in volumetric units) is bp . The distance from generator p to
GAP i is dp,i , and the maximum distance between any generator in P and
its assigned GAP (in meters) is D.

– A set J = {j1 , . . . , j|J| } of bin types. Each type has a given purchase price
cinj , capacity Cj , and required space for its installation ej . The maximum
number of bins of type j that is available is M Bj .

– A set Y = {y1 , . . . , y|Y | } of collection frequencies profiles. These profiles

are defined by parameter ay that indicates the number of days among two
consecutive visits of the collection vehicle.

The model is described in Equations 1-12, using the following variables: tj,i
is the number of bins of type j installed in GAP i, xp,i is 1 if dwelling p is
assigned to GAP i and 0 otherwise, and fi,y is 1 if frequency profile y (defined
by parameter ay ) is used for GAP i and 0 otherwise.
4 D. Rossit, S. Nesmachnow, J. Toutouh

 
P fi,y
i∈I ay
y∈Y
min (1)
|I|
X
min (tj,i cinj ) (2)
j∈J
i∈I
Subject to
X
(xp,i ) =1, ∀p ∈ P (3)
i∈I
X
(tj,i ej ) ≤ Esi , ∀i ∈ I (4)
j∈J
h∈H
X X

(bp xp,i fi,y ay ) ≤ capj tj,i , ∀ i ∈ I (5)
p∈P j∈J
y∈Y
X
fi,y ≤ 1, ∀ i ∈ I (6)
y∈Y
X X
|P | fi,y ≥ xp,i , ∀ i ∈ I (7)
y∈Y y∈Y
X
tj,i ≤ M Bj , ∀ j ∈ J (8)
i∈I
dp,i xp,i ≤ D, ∀ p ∈ P, i ∈ I (9)
xp,i ∈ [0, 1] , ∀ p ∈ P, i ∈ I (10)
fi,y ∈ [0, 1] , ∀ i ∈ I, y ∈ Y (11)
tj,i ∈ Z+
0 ,∀ j ∈ J, i ∈ I (12)

Eq. (1) considers the average collection frequency of the GAP. Eq. (2) reflects
the cost of the installed community bins. Eq. (3) establishes that each dwelling
should be assigned to a GAP. Eq. (4) ensures that the occupied space by the
bins is not larger than the available space in a GAP. Eq. (5) limits the garbage
assign to a GAP to the capacity of the installed bins in that GAP. Eq. (6)
forces that only one frequency profile is chosen for a GAP. Eq. (7) establishes
that if a dwelling is assigned to a GAP that GAP has a collection frequency
profile. Eq. (8) limits the total number of bins of each type. Eq. (9) restricts
the maximum distance between a dwelling and the assigned GAP to a certain
threshold distance. Eqs. (10) and (11) define the binary nature of the variables
xp,i and fi,y . Eq. (12) defines that tj,i is a non-negative integer variable.
The previous model formulation (Eqs. (1)-(12)) is not linear due to the pres-
ence of Eq. (5). Although linearization is a common practice to transform non-
linear problems into equivalent linear forms , the benefits of using linear forms
can be offset if the transformation increases the number of integer variables
since this is generally associated with the difficulty of the problem (Glover [12]).
 Facility location of solid waste community bins in smart cities 5

Therefore, the linearization technique proposed by Glover [12, 13], which main-
tains the number of integer variables, is applied and Eq. (5) is replaced with
Eqs. (13)-(17) trough the definition of the continuous variable up,i,y .Finally,
the linear equivalent formulation of the model is composed by Eqs. (1)-(4) and
(6)-(17).

X X

[bp ay (up,i,y + fi,y − 1 + xp,i )] ≤ capj tj,i , ∀ i ∈ I (13)
p∈P j∈J
y∈Y

up,i,y ≥ 1 − xp,i − fi,y , ∀ p ∈ P, i ∈ I, y ∈ Y (14)

up,i,y ≤ 1 − fi,y , ∀ p ∈ P, i ∈ I, y ∈ Y (15)
up,i,y ≤ 1 − xp,i , ∀ p ∈ P, i ∈ I, y ∈ Y (16)
up,i,y ≥ 0, ∀ p ∈ P, i ∈ I, y ∈ Y (17)

2.1 Related work

Among the main works that deal with this problem using exact algorithms, Tral-
hao et al. [36] solved the bins location problem in an area of Coimbra (Portugal)
considering four different objectives to minimize: the total cost of the system, the
average distance between a dwelling and its assigned container, and the number
of citizens within the “push” and “pull” thresholds of an open candidate site.
He used weighted sum and goal programming. Coutinho et al.[6] solved a similar
problem using the ε-constraint method, but only considering two objectives: the
total investment cost and a novel “dissatisfaction function” that takes into ac-
count the semi-obnoxiousness of the containers. Kao and Lin [18] presented three
different monobjective models to solve the GAP location problem in Hsinchu,
Taiwan. Hemmelmayr et al. [16] solved the GAP location problem with the aim
of minimizing the installment costs using CPLEX inside a more generic model
that also considers the routing scheduling of collection vehicle. Lin et al. [20] also
used CPLEX to define the locations of GAPs in a general framework that also
defines the routing plan. Ghiani et al. [10] presented an integer model that min-
imizes the total number of opened GAP. In Ghiani et al. [10] the GAP problem
is solved considering the minimization of the opened GAPs in different scenarios
of the city of Nardò, Italy. Related to this work, in Ghiani et al. [11] the authors
addressed a modified version of the model used in Ghiani et al. [10] that prevents
an opened GAP from having incompatible bins, i.e., bins that require a different
vehicle to be emptied. This is done for limiting the posterior routing cots.
In regard to Argentina although there are several works related to routing
planning in MSW management (see, e.g., Bonomo et al. [2] and Braier et al. [3]),
there are few applications of ICT technologies to establish correct positions for
the community bins. Some exceptions are Rossit et al. [30] who also used a similar
approach to optimize the bin location while considering the cost of the system
and minimizing the average distance to the generators. In Rossit et al. [31] a
similar problem was solved through a weighted sum approach.
6 D. Rossit, S. Nesmachnow, J. Toutouh

Our paper contributes with the consideration of the frequency objective.

Hemmelmayr et al. [16] considers it in the general approach (since they also
define the routing plan) but not in the specific GAP problem. Moreover, this
objective is considered jointly with the objective of minimizing the installment
cost. In Hemmelmayr et al. [16] the assignment of customers to GAPs is not
performed. Furthermore, a real case is solved in the Argentinian city of Bahı́a
Blanca.

3 Solution approach
The solution approach is the augmented -constraint method (AUGMECON)
that was firstly proposed in Mavrotas [22] and improved in Mavrotas and Flo-
rios [23]. This method successfully addressed some of the drawbacks of the tra-
ditional -constraint method initially developed by Haimes et al. [15], such as
reducing the necessary computing time through the avoidance of weakly efficient
or repeated solutions. The AUGMECON requires as an input the efficient range
of the objective functions, i.e., the nadir and ideal values that each objective
assumes within the Pareto Front. Since there are only two objectives involved,
mono-objective optimization was used to find the nadir and ideal value of each
objective as in Ehrgott and Ryan [8]. In the context of bicriteria optimization
problems, if there are no alternative solutions, the ranges obtained from the
monobjective optimization are the efficient ranges of the objectives (Beeson [1]).
In Mavrotas [22], the nadir and ideal values of the objectives over the efficient set
is obtained by lexicographic optimization. However, lexicographic optimization,
which basically consists in optimizing one of criteria in the first stage and then
optimizing the second criteria subjected to not deteriorating the first criteria,
was too time consuming for our problem since it was not possible to obtain a fea-
sible solution in for a computing time of several days when the second objective
was the enhancing the “autonomy” of collection bins. This may be associated
to the aforementioned computational complexity of the facility location prob-
lems. A much less computational expensive procedure is the one used in Rossit
et al. [32] and Rossit [33] where the results of plain monobjective optimization
are “filtered” in a second step through a multiobjective weighted sum method.
In this second step a largely unbalanced vector of weights is used: the function
is strongly biased towards the objective that will be optimized but the second
objective still has a positive weight in order to avoid weakly efficient solutions.
Moreover, in order to make this bias significant, we use the values of the monob-
jective optimization to normalize the objective function.

4 Experimental results
The scenario is based in a crowded place of the Argentinian city of Bahı́a Blanca,
called “Barrio Universitario” (Figure 1). The garbage generation rate (bp ) for
the city is retrieved from a report performed by a local research center [29].
The garbage density (to convert the weight of the generated waste to volume
 Facility location of solid waste community bins in smart cities 7

units) was estimated from a recent study in Argentina (Pettigiani et al. [28]).
The population density (per square block) was obtained after a joint analysis
performed with the local government analysis from the information recovered
from the Argentinian national census [7]. The generators were clustered in eighty-
eight groups. The spatial information was organized using QGIS 2.18.6 and the
urban distances (dp,i ) were calculated through an adapted version of the osmar
package of R developed by Eugster and Schlesinger [9]. This package is directly
link to the maps of the OpenStreetMap project4 . The parameter ay can be either
1,2 or 3 days. For example, ay = 1 establishes the visits occur every day, ay = 2
establishes the visits occur every two days and so on. Three different types of bins
are used. The associated parameters are: capj = 1, 2, or 3 m3 , ej = 1, 2or 3 m2
and cinj = 100, 180 or 250 monetary units, for types j1 , j2 , and j3 respectively.
Esi is equal to 5 m2 for all the potential GAPs.
We considered three different scenarios. One scenario with the normal waste
generation rate, another with an increased garbage generation rate (20% higher
than the normal waste generation rate), and another scenario with a reduced
waste generation rate (20% lower than the normal waste generation rate). These
values are in line with the practitioners experience in terms of variation along
the year.
The model was solved using the parallel mode of CPLEX 12.7.1 through Con-
cert Technology in a C++ environment. The runs were performed in a personal
computer with an Intel Core i7 processor and a 16 GB RAM memory.

Fig. 1. Studied area (“Barrio Universitario” in Bahı́a Blanca). Source: Google Earth
Pro 7.3.1

The results for the three studied scenarios are shown in Table 1. Results
analysis . . .

4
https://www.openstreetmap.org/
8 D. Rossit, S. Nesmachnow, J. Toutouh

Fig. 2. Location of potential GAPs in the studied area (“Barrio Universitario” in Bahı́a
Blanca). Source: QGIS 2.18.6 and OpenStreetMap

Table 1. Solutions of the case of Bahı́a Blanca.

Solution Id Obj1 Obj2 CPU Time (sec) Dominance

Normal scenario
1 0.107955 6300 28121.5 ND
2 0.104167 7500 27936.1 ND
3 0.108067 10250 27177.5 D
4 0.107955 10200 27177.5 D
5 0.107955 10200 27177.5 D
Demanding scenario
Undemanding scenario
1 0.100379 41000 4200.50 AUGMECON
2 0.0871212 44000 4204.91 AUGMECON
3 0.0909091 46000 4210.39 AUGMECON
4 0.0871212 47000 4208.70 AUGMECON
5 0.0871212 50000 4229.86 Dominated
6 0.0852273 53000 4206.56 Dominated
7 0.0833333 55000 4200.25
8 0.0871212 62000 4200.11
9 0.0833333 65000 4203.47
 Facility location of solid waste community bins in smart cities 9

5 Discussion and Conclusion

Urban waste management is a tricky issue for several local governments that
have to struggle with high logistic costs. In this paper, we focused on the initial
stage of the reverse logistic chain of municipal solid waste. Particularly, a mathe-
matical formulation for the defining the location of garbage accumulation points
(GAPs) in a densely populated urban area while considering the minimization
of both installment cost and the required frequency of visits of the collection
vehicle to empty the bins is proposed. This model is solved for real scenarios of
the Argentinian city of Bahı́a Blanca with the augmented ε-constraint method
obtaining a set of multi-objective solutions, while using a different method to
obtain the payoff tableau in order to handle the computational complexity of
the problem.
Further conclusions when results are finished . . .
Another important conclusion is that this work was mainly performed with
free software. From OpenStreetMap, QGIS and R packages are all free license.
This represents an asset for local authorities of developing countries that gen-
erally have a short budget to incorporate ICTs in public services, as is the case
of the Argentinian city of Bahı́a Blanca. Only CPLEX requires a paid license.
However, in the future it can be tried to test the performance of CBC solver
from the COIN-OR project.

References
1. Beeson, R.M.: Optimization with respect to multiple criteria. Ph.D. thesis, Uni-
versity of Southern California, United States of America (June 1972)
2. Bonomo, F., Durán, G., Larumbe, F., Marenco, J.: A method for optimizing waste
collection using mathematical programming: a buenos aires case study. Waste Man-
agement & Research 30(3), 311–324 (2012)
3. Braier, G., Durán, G., Marenco, J., Wesner, F.: An integer programming approach
to a real-world recyclable waste collection problem in argentina. Waste Manage-
ment & Research 35(5), 525–533 (2017)
4. Broz, D., Rossit, D., Cavallin, C.: The Argentinian forest sector: opportunities and
challenges in supply chain management. Uncertain Supply Chain Management
6(4), 375–392 (2018). https://doi.org/10.5267/j.uscm.2018.1.001
5. Cornuéjols, G., Sridharan, R., Thizy, J.M.: A comparison of heuristics and relax-
ations for the Capacitated Plant Location Problem. European Journal of Opera-
tional Research 50(3), 280–297 (1991)
6. Coutinho-Rodrigues, J., Tralhão, L., Alçada-Almeida, L.: A bi-objective mod-
eling approach applied to an urban semi-desirable facility location prob-
lem. European Journal of Operational Research 223(1), 203–213 (2012).
https://doi.org/10.1016/j.ejor.2012.05.037
7. Dirección Provincial de Estadı́stica de la Provincia de Buenos Aires, Argentina:
Censo 2010 Provincia de Buenos Aires Resultados Definitivos por Partido (2010)
8. Ehrgott, M., Ryan, D.M.: Constructing robust crew schedules with bicriteria op-
timization. Journal of Multi-Criteria Decision Analysis 11(3), 139–150 (2002).
https://doi.org/10.1002/mcda.321
10 D. Rossit, S. Nesmachnow, J. Toutouh

9. Eugster, M.J.A., Schlesinger, T.: osmar: OpenStreetMap and R. The R

Journal 5(1), 53–63 (2013), https://journal.r-project.org/archive/2013/RJ-2013-
005/index.html
10. Ghiani, G., Laganà, D., Manni, E., Triki, C.: Capacitated location of collection
sites in an urban waste management system. Waste Management 32(7), 1291–1296
(2012). https://doi.org/10.1016/j.wasman.2012.02.009
11. Ghiani, G., Manni, A., Manni, E., Toraldo, M.: The impact of an ef-
ficient collection sites location on the zoning phase in municipal solid
waste management. Waste Management 34(11), 1949–1956 (2014).
https://doi.org/10.1016/j.wasman.2014.05.026
12. Glover, F.: Improved linear integer programming formulations of non-
linear integer problems. Management Science 22(4), 455–460 (1975).
https://doi.org/10.1287/mnsc.22.4.455
13. Glover, F.: An improved MIP formulation for products of discrete and continuous
variables. Journal of Information and Optimization Sciences 5(1), 69–71 (1984).
https://doi.org/10.1080/02522667.1984.10698780
14. Gómez, J., Huete, J.F., Hoyos, O., Perez, L., Grigori, D.: Interaction system based
on internet of things as support for education. Procedia Computer Science 21,
132–139 (2013)
15. Haimes, Y.Y., Lasdon, L.S., Wismer, D.A.: On a bicriterion formulation of
the problems of integrated system identification and system optimization.
IEEE transactions on systems, man, and cybernetics 1(3), 296–297 (1971).
https://doi.org/10.1109/TSMC.1971.4308298
16. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F., Vigo, D.: Models and algorithms
for the integrated planning of bin allocation and vehicle routing in solid waste
management. Transportation Science 48(1), 103–120 (2013)
17. Hoornweg, D., Bhada-Tata, P.: What a waste: a Global Review of Solid Waste Man-
agement. Urban Development Series Knowledge Papers 15, World Bank, Washing-
ton, United States (2012)
18. Kao, J.J., Lin, T.I.: Shortest service location model for planning waste pickup
locations. Journal of the Air & Waste Management Association 52(5), 585–592
(2002)
19. Kinobe, J.R., Gebresenbet, G., Vinnerås, B.: Reverse logistics related to waste
management with emphasis on developing countries-a review paper. Journal of
Environmental Science and Engineering. B 1(9B), 1104 (2012)
20. Lin, H.Y., Tsai, Z.P., Chen, G.H., Kao, J.J.: A model for the implementation
of a two-shift municipal solid waste and recyclable material collection plan that
offers greater convenience to residents. Journal of the Air & Waste Management
Association 61(1), 55–62 (2011)
21. Massobrio, R., Toutouh, J., Nesmachnow, S., Alba, E.: Infrastructure deployment
in vehicular communication networks using a parallel multiobjective evolutionary
algorithm. International Journal of Intelligent Systems 32(8), 801–829 (2017)
22. Mavrotas, G.: Effective implementation of the ε-constraint method in multi-
objective mathematical programming problems. Applied mathematics and com-
putation 213(2), 455–465 (2009). https://doi.org/10.1016/j.amc.2009.03.037
23. Mavrotas, G., Florios, K.: An improved version of the augmented ε-constraint
method (AUGMECON2) for finding the exact pareto set in multi-objective integer
programming problems. Applied Mathematics and Computation 219(18), 9652–
9669 (2013). https://doi.org/10.1016/j.amc.2013.03.002
 Facility location of solid waste community bins in smart cities 11

24. Neirotti, P., De Marco, A., Cagliano, A.C., Mangano, G., Scorrano, F.: Cur-
rent trends in smart city initiatives: Some stylised facts. Cities 38, 25–36 (2014).
https://doi.org/10.1016/j.cities.2013.12.010
25. Nesmachnow, S., Rossit, D., Toutouh, J.: Comparison of multiobjective evolu-
tionary algorithms for prioritized urban waste collection in montevideo, uruguay.
Electronic Notes in Discrete Mathematics (2018), in press
26. Orsi, E., Nesmachnow, S.: Smart home energy planning using iot and the cloud.
In: URUCON IEEE. pp. 1–4 (October 2017)
27. Peña, D., Tchernykh, A., Nesmachnow, S., Massobrio, R., Feoktistov, A., Bychkov,
I., Radchenko, G., Drozdov, A.Y., Garichev, S.N.: Operating cost and quality of ser-
vice optimization for multi-vehicle-type timetabling for urban bus systems. Journal
of Parallel and Distributed Computing (2018)
28. Pettigiani, E., Muzlera, A., Antonini, S.: Caracterización de residuos sólidos ur-
banos domiciliarios en Unquillo, Córdoba. In: III Jornadas Nacionales GIRSU 2013.
pp. 5–17. Instituto Nacional de Tecnologı́a Industrial, Rawson, Argentina (2013)
29. Planta Piloto de Ingenierı́a Quı́mica UNS-CONICET: Análisis estadı́stico de los
residuos sólidos domiciliarios de Bahı́a Blanca (February 2013)
30. Rossit, D., Tohmé, F., Frutos, M., Broz, D.: An application of the augmented ε-
constraint method to design a municipal sorted waste collection system. Decision
Science Letters 6(4), 323–336 (2017)
31. Rossit, D.G., Broz, D., Rossit, D.A., Frutos, M., Tohmé, F.: Una herramienta
logı́stica para la localización de contenedores de residuos separados en origen. In:
Mazzeo, N.M., Muzlera Klappenbach, A.M.M. (eds.) Avances en Gestión Integral
de Residuos Sólidos Urbanos 2014-15, pp. 50–69. Instituto Nacional de Tecnologı́a
Industrial, Buenos Aires, Argentina (2015)
32. Rossit, D.G., Nesmachnow, S., Massobrio, R., Toutouh, J., Tohmé, F.: A mul-
tiobjective model to optimize the location of garbage accumulation points in a
real-world case. In: High Performance Computing Camp HPCCamp 2017. Compu-
tational Simulation Center for Technological Applications-CONICET, Universidad
de Buenos Aires, and Universidad de Tres de Febrero, Buenos Aires, Argentina
(September 2017)
33. Rossit, D.G.: Desarrollo de modelos y algoritmos para optimizar redes logı́sticas
de residuos sólidos urbanos. PhD thesis, Department of Engineering, Universidad
Nacional del Sur, Bahı́a Blanca, Argentina (2018), unpublished (thesis being eval-
uated by the jury).
34. Solanas, A., Patsakis, C., Conti, M., Vlachos, I.S., Ramos, V., Falcone, F., Posto-
lache, O., Pérez-Martı́nez, P.A., Di Pietro, R., Perrea, D.N., et al.: Smart health: a
context-aware health paradigm within smart cities. IEEE Communications Maga-
zine 52(8), 74–81 (2014)
35. Toutouh, J., Rossit, D., Nesmachnow, S.: Computational intelligence for locat-
ing garbage accumulation points in urban scenarios. Lecture Notes in Computer
Science (2018), in press
36. Tralhão, L., Coutinho-Rodrigues, J., Alçada-Almeida, L.: A multi-
objective modeling approach to locate multi-compartment containers
for urban-sorted waste. Waste Management 30(12), 2418–2429 (2010).
https://doi.org/10.1016/j.wasman.2010.06.017

View publication stats