Next Article in Journal
Effects of Sports Activity on Sustainable Social Environment and Juvenile Aggression
Next Article in Special Issue
Bayesian-Based NIMBY Crisis Transformation Path Discovery for Municipal Solid Waste Incineration in China
Previous Article in Journal
Carbon Footprint Estimation in Road Construction: La Abundancia–Florencia Case Study
Previous Article in Special Issue
Measuring the Efficiency of Public and Private Delivery Forms: An Application to the Waste Collection Service Using Order-M Data Panel Frontier Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Application of the Operational Research Method to Determine the Optimum Transport Collection Cycle of Municipal Waste in a Predesignated Urban Area

Institute of Technology and Business in České Budějovice, Faculty of Technology, Department of Transport and Logistics, Okružní 10, 37001 České Budějovice, Czech Republic
*
Author to whom correspondence should be addressed.
Sustainability 2019, 11(8), 2275; https://doi.org/10.3390/su11082275
Submission received: 26 March 2019 / Revised: 10 April 2019 / Accepted: 11 April 2019 / Published: 16 April 2019
(This article belongs to the Special Issue Environmental, Social and Economic Sustainability of Waste Management)

Abstract

:
This paper deals with waste management. The aim is to find out whether the number of municipal mixed waste bins can be reduced due to the impact of waste separation and to determine the optimum municipal waste collection cycle within a predesignated area with an existing urban road network. The number of mixed waste bins depends on two factors—household waste volume and household waste composition. Both of these factors have a significant impact on the number of mixed waste bins required, with household waste composition being of particular importance when it comes to calculating the potential reduction in the number of mixed waste bins required due to waste separation. The calculations for the weight and volume of mixed household waste per person and the composition (types) thereof are presented accordingly. The results reveal which types of waste are the most useful in minimising the number of mixed waste bins by up to 30–50%. To determine the optimum waste collection cycle within the predesignated area with a real urban road network, the Nearest Neighbour Search method was applied. In the discussion, the focus is on whether other methods, including the Two-Phase Heuristic approach and the Bellman-Ford Algorithm, could be applied to solve the problem, whereby parameters such as application time and the capacity of the waste collection vehicle are compared.

1. Introduction

Waste management involves, among other things, waste classification, waste prevention, waste collection and transportation, waste handling and disposal, aftercare of the places where the waste is permanently stored, and environmental impact. Waste management is a dynamically evolving sector within the national economy. Industrially and economically advanced countries only began to seriously deal with the issue of waste management in the 1980s. Country-specific waste management legislation is primarily focused on waste prevention. This is crucial in regard to the state of the environment and the use of non-renewable resources. The support of the State for cleaner waste production was one of the key points [1,2].
Setting out the objectives and identifying the specific activities relating to waste management are essential preconditions for choosing suitable logistics processes and waste management instruments. In order to put forward waste management solutions, it is appropriate to carry out a detailed analysis similar to the one presented here. Such an analysis may include alternative situations, but only within the context of the need to separate the recommended logistics tools for the individual alternatives [2,3,4]. Within the context of waste management, and from the point of view of the sustainable development of environment friendly policies [5], the issues of collection and sorting are important contributory factors [1].
The efficient distribution of waste bins and the cycle of collection represent other aspects of high-quality waste management [6]. The aim of this paper is, therefore, to quantify the reduction in the number of municipal mixed waste bins required due to the impact of waste separation and to determine the optimum waste collection cycle in a predesignated area, which is located in a selected part of the South Bohemia region, on the basis of an existing urban road network.
The current situation in terms of waste collection cycle does not take into consideration the potential and alignment of a road communication network. Given those circumstances, this inappropriate state needed to be streamlined appropriately. The objective of the paper is also to propose an appropriate waste collection cycle when using the selected operational research method. Performing the preliminary relevant methods analysis, the Nearest Neighbour Search Method is chosen as the most suitable method for the purpose of this research study [7].
In regard to discussion of achieved results, comparison of this method with other methods, which may be potentially applicable for the given issue, are specified. Particularly, Distributing or Two-Phase Heuristic method and Bellman-Ford Algorithm are described in the context of their application within the research topic [7].
The waste management issue is addressed in a number of publications [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18]. Some publications [1,2,3,4,5] focus on the impact of waste management on the environment, whilst others [6,8] focus on waste management in certain industrial sectors. For example, a previous study [5] focuses on eco-waste management through the possible use of cellulose waste combined with municipal waste to produce new materials, another study [6] focuses on waste management in hotel operations, another [8] focuses on the decision-making behaviour of contractors and government ministries in the field of construction, and yet another study [19] on innovative solutions for municipal waste management.
The sustainable management of municipal waste is dealt with in previous studies [20,21]. In another study [22], a multi-criteria sustainability assessment of waste management in the UK is the focus. In yet another study [23], the sustainability of municipal waste landfilling and composting in the north of Iran is addressed. An assessment of the financial sustainability of waste management on the basis of various factors is made in a previous study [24]. The authors conclude that the most important aspect of the financial sustainability of waste management is the assessment of the contextual factors. The analysis focuses on problems in Italian municipalities. The article goes on to point out the importance of waste separation.
This paper, on the basis of a case study, also explores the impact of waste separation on overall waste management. As part of the case study, calculations are presented in regard to the need for municipal waste bins under two conditions—with and without waste separation. In addition, calculations are presented that show which types of separated waste produce the greatest reduction in the number of required municipal waste bins. The results are very close to the required 50% recovery rate referred to in a previous work [25]. In this article, the author points to the fact that the 50% recovery rate has yet to be achieved in Geneva. In another study [26], it is suggested that the Automatic Sorting Technology Methodology should be used to support electronic waste classification, with a holistic approach to addressing the issue. The methodology is applicable not only to electronic waste management. In a previous work [27], Pasotti addresses the waste crisis economically linked to the slow transition to waste treatment and recycling in southern Italy in 2010. In previous studies [28,29], the authors deal with waste sorting and recycling.
The lifecycle and handling of municipal waste are dealt with in other works [30,31,32,33,34,35]. Case studies related to the assessment of the waste management lifecycle are presented in previous studies [32,33,35]. For example, one study [32] focuses on the assessment of the sustainability of China’s waste management system, while another [33] on the lifecycle of plastics in India, and a third [35] on general municipal solid waste in Iran. The problems regarding waste management modelling are dealt with in other studies [7,36,37]. In this paper, the waste collection cycle is addressed within a particular area on the basis of the application of the Nearest Neighbour Search Method. This method is dealt with in previous works [7,38,39,40,41,42,43,44,45,46,47,48,49].
Even though some authors describe the adoption of the Nearest Neighbour Search heuristic to determine the optimum waste collection [50], as far as we are aware, there has not yet been any comprehensive methodology developed when taking into consideration the necessary number of municipal mixed waste bins, as well as the optimum waste collection cycle in a given transport territory. This makes this article unique. It was decided to implement this technique given the circumstances that the waste management, particularly determining the optimum frequency of the waste collection cycle, can be deemed as the issues identified to find the route with which to cover all points of interest. Precisely, the Nearest Neighbour Search heuristic fully comply with this set of aspects.
Several methods, e.g., the Bellman-Ford Algorithm, the Two-Phase Heuristic approach, or the Dijsktra algorithm, can also be applied to the issue of optimising the municipal waste collection cycle, which are discussed in previous works [51,52,53,54,55,56].
The transportation of municipal waste includes both the transport of the waste from the point it is generated (e.g., households) to the collection point (e.g., waste container site) and the transport from the collection point to the place of final disposal [57,58]. Generally speaking, the transportation of municipal waste can be classified according to [7]:
  • transport distance; or
  • means of transport used.
In regard to the transport distance among the centres of waste generation and disposal sites [58,59], the waste transportation can be conducted as a single-phase, two-phase, or multiphase process. In the Czech Republic, the transportation is predominantly single-phase. However, both two-phase and multiphase transportation are starting to develop slowly (e.g., MSTS system—Multi Service Transport System) [60].
In regard to the means of transport used, transportation by road is considered the most common type of solid municipal waste transportation [61]. In foreign countries, transportation by ship or rail is only used where longer distances (more than 250 km) need to be covered [57]. Where short distances (less than 250 km) are involved, it is possible to use road transport, air, or water piping systems [59].
Municipal waste transfer stations, as well as municipal waste container systems (as concepts included within the municipal waste transportation issues), are described in several scientific publications [57,59,62,63].
Waste collection in regard to standardised waste collection bins (containers) is carried out at specified regular intervals (Act No. 100/2001 Coll.) [64].
Sites intended for waste collection bins (containers) and facilities include [62,63]:
  • waste collection container stations;
  • waste collection points;
  • facilities or sites designated for the storage of residual municipal waste.

2. Methods for Deployment of Municipal Solid Waste Bins

The deployment of waste bins is governed by two principles, namely adequate accessibility to services and adequate capacity within the waste collection system. Both principles are equally important in terms of establishing an appropriate and well-functioning waste collection system.

2.1. Waste Production Potential

The main criterion determining the qualitative and quantitative characteristics of municipal waste is the way in which apartments are heated. Within this context, it can be said that the Czech Republic has two different types of municipal waste. This division is based on the fact that the composition of municipal waste in built-up areas, in which municipal heating is provided to apartments (apartment blocks), is different to that in areas with family houses, in which local heating sources are used, i.e., predominantly solid fuel.
Research in the last few decades distinguishes between three types of built-up areas based on the prevailing types of buildings:
  • housing development
  • mixed-use development
  • rural housing
A housing development is a built-up area with apartment blocks that utilise a centralised heat supply system and where there is no opportunity to utilise waste for heat generation. The share of premises for businesses and service providers is insignificant.
A mixed-use development is a built-up area with both apartment blocks (mostly in city centres) with centralised heat supply and apartments with local gas or electric heating. There are only a negligible number of apartments with solid fuel heating, while the share of premises for businesses and service providers is significant.
Rural housing consists of family houses with mostly local solid fuel heating. This means the options exist to incinerate household waste in home furnaces, to compost biodegradable waste, or to use part of the waste as feed. The share of premises for businesses and service providers is insignificant.
Table 1 shows the volumes of household waste produced according to the type of built-up area.
As part of the analysis, a more detailed breakdown of the specific components of household waste was sought in order to determine its potential utilisation. The components were: paper (paperboard, cardboard, mixed-material packaging, other types of packaging, printed matter, other types of paper); plastics (foils, plastic bottles, other types of plastics); glass (glass packaging—clear, amber, or green, returnable glass packaging, other); metals (iron, aluminium, others). The results are presented in Table 2 below.
The above shows that in terms of the composition of household waste, there are no big differences between housing developments and mixed-use developments. It is for this reason that in subsequent sections, these are referred to as one, namely housing developments.

2.2. Process for Determining the Number of Mixed Waste Bins

Determining what the adequate number of mixed waste bins per household is must be based on the worst-case scenario in terms of waste production and its collection. Waste production varies seasonally, with several peaks throughout the year. A rule of thumb used by most waste collection companies is that the average volume of waste produced per person per day is 5 L.
In terms of family homes, one waste bin (110–240 L) is usually allocated per household in order to guarantee sufficient capacity for effective and appropriate waste collection. When determining the number of waste bins for housing developments, the higher number of households and the associated higher waste production levels must be taken into consideration. Our analysis of the composition of municipal waste focused, inter alia, on the weight (bulk density) of mixed waste from households, but only after it was unloaded from waste collection vehicles. The average values for bulk density are presented in Table 3.
The weights of the individual components in the mixed waste bins were determined on the basis of measurements carried out by waste management companies. The values were calculated based on the following assumed composition (see Table 4):
On the basis of the share of the individual components in the mixed waste of households, it is possible to calculate the volumes of the individual components accordingly (see Table 5). By summing them up, it is possible to calculate the weight of mixed waste without waste separation in housing developments.
Additional calculations based on the waste production per person per day, as well as the weight of the individual components (see Table 6), enables us to infer the following results concerning the waste production per person per day (or per week).
These calculations show that waste collection companies managed to adhere to the objective volume requirements. Without waste separation, and on the basis of the assumed waste production per person, and taking into consideration the weight and composition of mixed waste, the required capacity of mixed waste bins is 5.125 L per day and 35.876 L per week.
The results are different if waste separation is taken into account. The components subject to separation are usually those with the largest assumed volumes, i.e., plastics and paper. The following calculation simulates the fulfilment of the Directive 2008/98/EC of the European Parliament and of the Council of November 19, 2008, on waste, and repealing certain directive requirements (resulting from the Waste Management Plan of the Czech Republic for the period 2015–2024) to utilise at least 50% of paper, glass, plastics, and metals recovered from household waste, as well as the 50% material recovery and 50% use of organic waste requirements under the Waste Management Plan of the Czech Republic (see Table 7) [65].
As the calculation shows, with 50% separation of the specified components, the required number of mixed waste bins can be reduced by nearly 50%. In municipalities with well-developed waste separation collection systems, this level has already been achieved in terms of paper and glass separation, while plastics separation is nearing 25%, but organic waste separation is almost zero. When simulating the current level of separation, the results are as follow.
These calculations show that in towns and cities with well-developed waste separation collection systems (values presented in Table 8), the capacity of mixed waste bins would only need approximately two-thirds of that required if no waste separation took place (values presented in Table 6). These general declarations and values can only be achieved provided that the given area has a well-developed waste separation collection system.
In addition, it is necessary to take into account the increased production and accumulation of waste on and during public holidays. In order to ensure sufficient mixed waste bin capacity, it is, therefore, recommended to calculate in a reserve of at least 30%, which would enable the collection of waste up to approximately two days over and above the regular weekly waste collection cycle. This requirement is demonstrated in the following Table 9.

3. Application of Heuristic Approach to the Distribution and Collection of Municipal Waste Bins

A significant and integral part of waste management is, in addition to determining the number of required mixed waste bins (containers), to also determine the frequency of the waste collection cycle. Within this context, mixed waste bin capacity can, therefore, be seen as a guideline for determining the waste collection cycle in municipalities. To determine the optimum waste collection cycle within a predesignated area, the Nearest Neighbour Search method was applied.
Nearest Neighbour Search (hereinafter referred to as NNS) is a sequential constructive heuristic approach, a simplified version that focuses on finding the only route with which to cover all service edges [7,38]. The single T 1 R route covering all service edges is called the complete route [7], whereby the set of routes is T R = { T 1 R } . The sought after route is at its very end extended by the nearest service edge. In terms of the distribution and collection problem, in most cases the distance between the last served edge h and the other unserved edges l i is identical (e.g., h service edge is followed up by i-number of service edges l i ). Subsequently, another l service edge must be selected by minimising or maximising one of the five following criteria [7,39]. The individual criteria and their mathematical descriptions and explanations are given in Table 10.
As long as the capacity of the vehicle is used to a maximum of 50%, the c r i t 5 criterion maximises the sum of the values of all the edges necessary for the completion of the route. The sum is subsequently minimised. The NNS heuristic approach tackles the problem five times, each time using a different criterion ( c r i t 1 , , c r i t 5 ) [22]. The best of the five solutions is chosen as the final one.
Figure 1 is an example of how the following service edge is selected according to the c r i t 1 criterion. The service edges are marked with a thick line and the minimum unserved routes between the individual service edges with a thin line; v 1 depot is in this case also a deposit site. The route ends at the h 4 edge. The minimum distance to the service edges that have not been served equals 2, and the set of other potential edges is Z = { h 5 , h 6 } . For the selection of the next service edge of the route, the c r i t 1 criterion is used, which minimises the return to the depot ( m i n { k o n ( h 9 ) , k o n ( h 13 ) } = m i n { 5 , 11 } ) , thereby extending the journey by the ( h 9 ) edge.
For one selected criterion c r i t { c r i t 1 , c r i t 2 , c r i t 3 , c r i t 4 , c r i t 5 } , it is possible to find a solution in O ( m R ) time, that is, in O ( n 2 ) for a real urban road network with m R m 4 , where m R represents the number of service edges and n the number of graph vertices [38,47]. By random selection of the next service edge l on the route [48], it is possible to obtain more than five alternative solutions and improve the average value of a solution.
The first option involves the random selection of one of the five criteria c r i t 1 , c r i t 5 , each one with equal probability, which determines the next service edge l. Another option is to ignore the criteria, and instead of choosing the edge minimising the criterion on the Z set, to perform a random selection of the edge from the set of the nearest edges, Z [7,39].

4. Discussion

Approach methodology for determining the number of mixed waste bins designed within this research study consists of several followed-up steps. Fundamental to determining the number of mixed waste bins was to analyse the waste on the basis of the volumes of household waste produced, according to the type of built-up area and specific components of household waste sought (see Table 1 and Table 2). As mentioned, a rule of thumb used by most waste collection companies is that the average volume of waste produced per person per day is 5 L (see Section 2.2). Subsequently, the weight values were converted to the average values for bulk density in terms of built-up area (see Table 3), as well as individual components (see Table 4).
Based on the share of the individual components, it was possible to calculate the volumes of the individual components then (see Table 5). Additional calculations based on the waste production per person per day, as well as the weight of the individual components, were carried out (see Table 6). The calculation of volume of mixed waste with 50% separation of specified components (see Table 7) and the volume of mixed waste with current levels of separation (see Table 8) were performed. The outcome was to compare the volume of mixed waste under different waste separation levels (see Table 9), whereby it was demonstrated that 50% separation of selected waste types brings up to 50% reduction in the required number of mixed waste bins.
Chapter 3 of this research study is focused on application of the NNS method as a sequential constructive heuristic approach, uniquely implemented to define an optimum frequency of the mixed waste collection cycle within a given predesignated area. Specifically, using this method, the only route with which to cover all service edges in terms of waste bins collection can be found.
In addition to the NNS method, two other optimisation techniques to be applied to a given issue problem may be taken into account as well; namely, Distributing or Two-Phase Heuristic method, and Bellman-Ford Algorithm.
Distributing or Two-Phase Heuristic method consists of two phases and may or may not account for the vehicle capacity. The first phase includes determining the complete route that can be found using any heuristic method, e.g., NNS heuristic. The second phase accounts for the vehicle capacity and specifies the number of waste collection vehicles. In regard to the Bellman-Ford Algorithm, to determine the shortest path, the time demand is considered the key attribute, whereby it is linearly dependent on the number of directed edges of the acyclic graph.
The detailed principles of these method procedures are described as follows (Section 4.1 and Section 4.2).

4.1. Distributing or Two-Phase Heuristic Approach

Under the simplified version (without capacity constraints of the vehicle) only one route, which would include all service edges, can be found. However, with respect to vehicle capacity, this route needs to be subdivided into shorter routes served by individual vehicles so that the required capacity on the routes is not higher than the capacity of the vehicles used on these routes. This is ensured by the next phase of the calculation—the so-called distributing heuristic (hereinafter referred to as DH), or two-phase heuristic [37].
The principle of the two-phase heuristic is to find the complete route T 1 X R that comprises all service edges (regardless of vehicle capacity) and its division into optimum capacity-permissible routes using the DH described in the following paragraph [54]. Dividing the complete route does not ensure the inception of the optimum capacity-permissible route. The complete route can be determined using any heuristic, e.g., NNS heuristic [39].
A DH can be applied to either an oriented, disoriented, or mixed complete route T 1 X R , whereby the individual edges are assigned labels representing a connectivity demand or the length of the edge. The capacity of a vehicle is Q. Under the DH, an auxiliary acyclic graph H was created, with m R + 1 points with assigned numeric value in ascending order, starting with 0. Each permissible route from the subset { T 1 i X R , T 1 j X R } T 1 X R of the complete route is represented by only one or-edge [ i 1 , j ] in the H graph. The route is permissible if neither the capacity of the vehicle (Q) nor the L driving range is exceeded. The loading volume on the route is calculated as follows [54]:
n a k ( T i R ) = j = 1 m R w ( h j ) Q ( h j T i R , i = 1 , , | T R | )
The shortest path from the vertex indexed 0 to the vertex indexed m R in the H graph determines the best possible division of the complete route [52]. By dividing the route, several capacity-permissible routes are established. This results in the optimum solution being found in regard to the sequence of the edges on the original route.

4.2. Bellman-Ford Algorithm

The shortest path can be calculated by means of the Bellman-Ford Algorithm for a directed acyclic graph [52]. The time demand is linearly dependent on the number of directed edges of the graph. For the H graph [51], the maximum number is m R ( m R 1 ) 2 . Therefore, the time demand is O ( m R 2 ) . The time demand for a real urban road network with m R m 4 n equals ( n 2 ) [14].
The time demand will be smaller if the w m i n minimum requirement is large enough. The route thereby optimally covers Q w m i n number of service edges. The H graph contains m R Q W m i n or-edges. The time demand of this alternative is O ( m R ) , without any need to create the H graph. For i = 1 , , m R , all the permissible routes { T 1 i X R , , T 1 j X R } are labelled. The labelling is used for the direct actualisation of the labelling of the vertices in the Bellman-Ford Algorithm [50,53].
The DH can be improved by dividing several complete routes and choosing the best solution obtained through these divisions. When truncating the capacity (Q) of the vehicle and the driving range (L), the complete routes can be determined using the aforementioned NNS [7]. The NNS heuristic enables the creation of five such routes (one for each given criterion).
Another improvement may be achieved by changing the order of the edges on the route in the H graph. Better results are achieved if each or-edge in the H graph is assigned labelling according to the best cyclic order change of the edges on the route [54].

5. Conclusions

Currently, the issue of the waste separation and collection is considered a very up-to-date topic and a lot of authors in various professional publications have dealt with it (as stated in the literature review within the introduction). A number of research studies elaborate the issues of separated waste production in terms of municipal waste volume reduction. Several authors also point to the fact that the 50% recovery rate has yet to be achieved in EU big cities. Apparently, the municipal waste reduction affects the waste collection cycle of collection vehicles.
However, none of the aforementioned publications and approaches is focused on the issues of the waste separation and collection within one comprehensive methodology. This concern is addressed just within this research study, specifically by its conception. It includes several followed-up steps.
  • Analysis of the waste on the basis of the volumes of household waste produced according to the type of built-up area and specific components of household waste;
  • Calculating the weight values converted to the average values for bulk density, in terms of built-up area, as well as individual components;
  • Calculating the volumes of the individual components;
  • Calculating the waste production per person per day, as well as the weight of the individual components;
  • Calculating the volume of mixed waste with 50% separation of specified components, as well as the volume of mixed waste with current levels of separation;
  • Comparing the volume of mixed waste under different waste separation levels;
  • Applying the NNS heuristic to the collection cycle frequency of municipal waste bins in a predesignated urban road network area.
The results achieved within the research confirmed that the number of municipal mixed waste bins can be reduced due to the separation of paper and plastics up to 30–50%. Such a reduction has significant impact on the collection cycle frequency. For that reason, specifying the components in order to achieve the reduction in municipal waste volume, as well as using the proper technique and approach in this matter can considerably streamline the whole waste management system.
As mentioned, the uniqueness of the designed methodology also consists in an application of the specific operational research method (specifically, the Nearest Neighbour Search method as a sequential constructive heuristic approach) in regard to define the optimum frequency of the mixed waste collection cycle for a waste collection vehicle within a given predesignated area. This method determines the only route with which to cover all service edges in terms of waste bins collection. Each service edge must be chosen by minimising or maximising one of the criteria, as follows:
  • Minimisation of the evaluation of the route (its length) beyond the service edge to the depot;
  • Maximisation of the evaluation of the route beyond the service edge to the depot;
  • Minimisation of the ratio expressing the “productivity” of the service edge;
  • Maximisation of the ratio expressing the “productivity” of the service edge;
  • Criterion 5 = criterion 1, under pre-determined conditions (see Table 10).
Such a methodology has not been published yet. Therefore, the designed technique can be seen as a new or different holistic view for determining the necessary number of municipal mixed waste bins, as well as the optimum waste collection cycle in a variety of municipalities. The next step in the future should be to deal with the financial aspects of the optimum collection cycle of municipal waste management.

Author Contributions

O.S. and M.S. conceived and designed the manuscript; particularly, they elaborated the methodology, performed individual calculations, processed literature review, verified the results, and performed the experiments. R.K. obtained and analysed the input data, approved the final manuscript corrections, and provided the supervising the final version.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Faircloth, C.C.; Wagner, K.H.; Woodward, K.E.; Rakkwamsuk, P.; Gheewala, S.H. The environmental and economic impacts of photovoltaic waste management in Thailand. Resour. Conserv. Recycl. 2019, 143, 260–272. [Google Scholar] [CrossRef]
  2. De Feo, G.; Ferrara, C.; Finelli, A.; Grosso, A. Environmental and economic benefits of the recovery of materials in a municipal solid waste management system. Environ. Technol. 2019, 40, 903–911. [Google Scholar] [CrossRef]
  3. Edahbi, M.; Plante, B.; Benzaazoua, M. Environmental challenges and identification of the knowledge gaps associated with REE mine wastes management. J. Clean. Prod. 2019, 212, 1232–1241. [Google Scholar] [CrossRef]
  4. Hidayat, R.; Mu’alim. Waste management and greed productivity in increased productivity and environmental performance. Int. J. Geomate 2019, 16, 145–152. [Google Scholar] [CrossRef]
  5. Filimonau, V.; De Coteau, D.A. Food waste management in hospitality operations: A critical review. Tour. Manag. 2019, 71, 234–245. [Google Scholar] [CrossRef]
  6. Chen, J.G.; Hua, C.X.; Liu, C.Y. Considerations for better construction and demolition waste management: Identifying the decision behaviors of contractors and government departments through a game theory decision-making model. J. Clean. Prod. 2019, 212, 190–199. [Google Scholar] [CrossRef]
  7. Asefi, H.; Lim, S.; Maghrebi, M.; Shahparvari, S. Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management. Ann. Oper. Res. 2019, 273, 75–110. [Google Scholar] [CrossRef]
  8. Antonkiewicz, J.; Baran, A.; Pelka, R.; Wisla-Swider, A.; Nowak, E.; Konieczka, P. A mixture of cellulose production waste with municipal sewage as new material for an ecological management of wastes. Ecotoxicol. Environ. Saf. 2019, 169, 607–614. [Google Scholar] [CrossRef]
  9. Gwada, B.; Ogendi, G.; Makindi, S.M.; Trott, S. Composition of plastic waste discarded by households and its management approaches. Glob. J. Environ. Sci. Manag. 2019, 5, 83–94. [Google Scholar] [CrossRef]
  10. Habib, M.S.; Sarkar, B.; Tayyab, M.; Saleem, M.W.; Hussain, A.; Ullah, M.; Omair, M.; Iqbal, M.W. Large-scale disaster waste management under uncertain environment. J. Clean. Prod. 2019, 212, 200–222. [Google Scholar] [CrossRef]
  11. Sharma, K.D.; Jain, S. Overview of Municipal Solid Waste Generation, Composition, and Management in India. J. Environ. Eng. 2019, 145, 04018143. [Google Scholar] [CrossRef]
  12. Babar, P.; Lokhande, A.; Karade, V.; Pawar, B.; Gang, M.G.; Pawar, S.; Kim, J.H. Towards highly efficient and low-cost oxygen evolution reaction electrocatalysts: An effective method of electronic waste management by utilizing waste Cu cable wires. J. Colloid Interface Sci. 2019, 537, 43–49. [Google Scholar] [CrossRef]
  13. Fernando, R.L.S. Solid waste management of local governments in the Western Province of Sri Lanka: An implementation analysis. Waste Manag. 2019, 84, 194–203. [Google Scholar] [CrossRef]
  14. Cheng, C.; Zhang, L.H.; Thompson, R.G. Reliability analysis of road networks in disaster waste management. Waste Manag. 2019, 84, 383–393. [Google Scholar] [CrossRef]
  15. Higueras, P.L.; Saez-Martinez, F.J.; Lefebvre, G.; Moilleron, R. Contaminated sites, waste management, and green chemistry: New challenges from monitoring to remediation. Environ. Sci. Pollut. Res. 2019, 26, 3095–3099. [Google Scholar] [CrossRef]
  16. Cavalletti, B.; Corsi, M. By diversion rate alone: The inconsistency and inequity of waste management evaluation in a single-indicator system. Pap. Reg. Sci. 2019, 98, 307–329. [Google Scholar] [CrossRef]
  17. Kliopova, I.; Staniskis, J.K.; Stunzenas, E.; Jurovickaja, E. Bio-nutrient recycling with a novel integrated biodegradable waste management system for catering companies. J. Clean. Prod. 2019, 209, 116–125. [Google Scholar] [CrossRef]
  18. Deus, R.M.; Bezerra, B.S.; Battistelle, R.A.G. Solid waste indicators and their implications for management practice. Int. J. Environ. Sci. Technol. 2019, 16, 1129–1144. [Google Scholar] [CrossRef]
  19. Wang, J.; Maier, S.D.; Horn, R.; Hollander, R.; Aschemann, R. Development of an Ex-Ante Sustainability Assessment Methodology for Municipal Solid Waste Management Innovations. Sustainability 2018, 10, 3208. [Google Scholar] [CrossRef]
  20. Peng, W.; Pivato, A. Sustainable Management of Digestate from the Organic Fraction of Municipal Solid Waste and Food Waste Under the Concepts of Back to Earth Alternatives and Circular Economy. Waste Biomass Valorization 2019, 10, 465–481. [Google Scholar] [CrossRef]
  21. He, Z.; Xiong, J.; Ng, T.S.; Fan, B.; Shoemaker, C.A. Managing competitive municipal solid waste treatment systems: An agent-based approach. Eur. J. Oper. Res. 2017, 263, 1063–1077. [Google Scholar] [CrossRef]
  22. Iacovidou, E.; Voulvoulis, N. A multi-criteria sustainability assessment framework: Development and application in comparing two food waste management options using a UK region as a case study. Environ. Sci. Pollut. Res. 2018, 25, 35821–35834. [Google Scholar] [CrossRef]
  23. Behrooznia, L.; Sharifi, M.; Alimardani, R.; Mousavi-Avval, S.H. Sustainability analysis of landfilling and composting-landfilling for municipal solid waste management in the north of Iran. J. Clean. Prod. 2018, 203, 1028–1038. [Google Scholar] [CrossRef]
  24. Bartolacci, F.; Paolini, A.; Quaranta, A.G.; Soverchia, M. Assessing factors that influence waste management financial sustainability. Waste Manag. 2018, 79, 571–579. [Google Scholar] [CrossRef]
  25. Bergeron, F.C. Multi-method assessment of household waste management in Geneva regarding sorting and recycling. Resour. Conserv. Recycl. 2016, 115, 50–62. [Google Scholar] [CrossRef]
  26. Barletta, I.; Larborn, J.; Mani, M.; Johannson, B. Towards an Assessment Methodology to Support Decision Making for Sustainable Electronic Waste Management Systems: Automatic Sorting Technology. Sustainability 2016, 8, 84. [Google Scholar] [CrossRef]
  27. Pasotti, E. Sorting through the Trash: The Waste Management Crisis in Southern Italy. South Eur. Soc. Polit. 2010, 15, 289–307. [Google Scholar] [CrossRef]
  28. Chifari, R.; Lo Piano, S.; Matsumoto, S.; Tasaki, T. Does recyclable separation reduce the cost of municipal waste management in Japan? Waste Manag. 2017, 60, 32–41. [Google Scholar] [CrossRef]
  29. Sukholthaman, P.; Sharp, A. A system dynamics model to evaluate effects of source separation of municipal solid waste management: A case of Bangkok, Thailand. Waste Manag. 2016, 52, 50–61. [Google Scholar] [CrossRef]
  30. Khandelwal, H.; Dhar, H.; Thalla, A.K.; Kumar, S. Application of life cycle assessment in municipal solid waste management: A worldwide critical review. J. Clean. Prod. 2019, 209, 630–654. [Google Scholar] [CrossRef]
  31. Santos, A.C.; Mendes, P.; Teixeira, M.R. Social life cycle analysis as a tool for sustainable management of illegal waste dumping in municipal services. J. Clean. Prod. 2019, 210, 1141–1149. [Google Scholar] [CrossRef]
  32. Zhou, Z.Z.; Chi, Y.; Dong, J.; Tang, Y.J.; Ni, M.J. Model development of sustainability assessment from a life cycle perspective: A case study on waste management systems in China. J. Clean. Prod. 2019, 210, 1005–1014. [Google Scholar] [CrossRef]
  33. Aryan, Y.; Yadav, P.; Samadder, S.R. Life Cycle Assessment of the existing and proposed plastic waste management options in India: A case study. J. Clean. Prod. 2019, 211, 1268–1283. [Google Scholar] [CrossRef]
  34. Fiore, S.; Ibanescu, D.; Teodosiu, C.; Ronco, A. Improving waste electric and electronic equipment management at full-scale by using material flow analysis and life cycle assessment. Sci. Total Environ. 2019, 659, 928–939. [Google Scholar] [CrossRef]
  35. Zarea, M.A.; Moazed, H.; Ahmadmoazzam, M.; Malekghasemi, S.; Jaafarzadeh, N. Life cycle assessment for municipal solid waste management: A case study from Ahvaz, Iran. Environ. Monit. Assess. 2019, 191, 131. [Google Scholar] [CrossRef]
  36. Gambella, C.; Maggioni, F.; Vigo, D. A stochastic programming model for a tactical solid waste management problem. Eur. J. Oper. Res. 2019, 273, 684–694. [Google Scholar] [CrossRef]
  37. Chiu, C.Y.; Chiu, J.S.; Markchit, S.; Chou, S.H. Effective product quantization-based indexing for nearest neighbor search. Multimedia Tools Appl. 2019, 78, 2877–2895. [Google Scholar] [CrossRef]
  38. Bartal, Y.; Gottlieb, L.A. Approximate nearest neighbor search for l(p)-spaces (2 < p < infinity) via embeddings. Comput. Sci. 2019, 757, 27–35. [Google Scholar] [CrossRef]
  39. Tagami, Y. Speeding up Extreme Multi-Label Classifier by Approximate Nearest Neighbor Search. IEICE Trans. Inf. Syst. 2018, E101D, 2784–2794. [Google Scholar] [CrossRef]
  40. Bittremieux, W.; Meysman, P.; Noble, W.S.; Laukens, K. Fast Open Modification Spectral Library Searching through Approximate Nearest Neighbor Indexing. J. Proteome Res. 2018, 17, 3463–3474. [Google Scholar] [CrossRef]
  41. Liu, Y.F.; Wei, H.; Cheng, H. Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data. Inf. Sci. 2018, 465, 484–504. [Google Scholar] [CrossRef]
  42. Liu, M.M.; Pan, X.Y.; Yin, Y.T. Randomized Approximate Nearest Neighbor Search with Limited Adaptivity. ACM Trans. Parallel Comput. 2018, 5, UNSP 3. [Google Scholar] [CrossRef]
  43. Gripon, V.; Lowe, M.; Vermet, F. Associative Memories to Accelerate Approximate Nearest Neighbor Search. Appl. Sci. BASEL 2018, 8, 1676. [Google Scholar] [CrossRef]
  44. Hassanat, A.B.A. Furthest-Pair-Based Binary Search Tree for Speeding Big Data Classification Using K-Nearest Neighbors. Big Data 2018, 6, 225–235. [Google Scholar] [CrossRef]
  45. Liu, H.K.; Wei, X.; Xiao, R.L.; Chen, L.F.; Du, X.; Zhang, S. OPRCP: Approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain. Eurasip J. Wirel. Commun. Netw. 2018, 208. [Google Scholar] [CrossRef]
  46. Meenachi, L.; Ramakrishnan, S. Evolutionary sequential genetic search technique-based cancer classification using fuzzy rough nearest neighbour classifier. Healthc. Technol. Lett. 2018, 5, 130–135. [Google Scholar] [CrossRef]
  47. Liu, R.; Wang, H.; Yu, X.M. Shared-nearest-neighbor-based clustering by fast search and find of density peaks. Inf. Sci. 2018, 450, 200–226. [Google Scholar] [CrossRef]
  48. Shen, M.Y.; Jiang, X.H.; Sun, T.F. Anomaly detection based on Nearest Neighbor search with Locality-Sensitive B-tree. Neurocomputing 2018, 289, 55–67. [Google Scholar] [CrossRef]
  49. Chavez, E.; Luduena, V.; Reyes, N.; Kasian, F. All Near Neighbor Graph Without Searching. J. Comput. Sci. Technol. 2018, 18, 61–67. [Google Scholar] [CrossRef]
  50. Bautista, J.; Fernández, E.; Pereira, J. Solving an urban waste collection problem using ants heuristics. Comput. Oper. Res. 2008, 35, 3020–3033. [Google Scholar] [CrossRef] [Green Version]
  51. Dinitz, Y.; Itzhak, R. Hybrid Bellman-Ford-Dijkstra algorithm. Hybrid Bellman-Ford-Dijkstra algorithm. J. Discrete Algorithms 2017, 42, 35–44. [Google Scholar] [CrossRef]
  52. Busato, F.; Bombieri, N. An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures. IEEE Trans. Parallel Distrib. Syst. 2016, 27, 2222–2233. [Google Scholar] [CrossRef]
  53. Jukna, S.; Schnitger, G. On the optimality of Bellman-Ford-Moore shortest path algorithm. Theor. Comput. Sci. 2016, 628, 101–109. [Google Scholar] [CrossRef]
  54. Dahshan, M.H. Maximum Independent Set Approximation Based on Bellman-Ford Algorithm. Arabian J. Sci. Eng. 2014, 39, 7003–7011. [Google Scholar] [CrossRef]
  55. Banerjee, S.; Chowdhury, C.; Chattopadhyay, S.; Aslam, N. Two Phased Routing Protocol Incorporating Distributed Genetic Algorithm and Gradient Based Heuristic in Clustered WSN. Wirel. Pers. Commun. 2017, 97, 5401–5425. [Google Scholar] [CrossRef]
  56. Ojekudo, N.A.; Akpan, N.P. An application of Dijkstra’s Algorithm to shortest route problem. IOSR J. Math. (IOSR-JM) 2017, 13, 20–32. [Google Scholar] [CrossRef]
  57. Ghiasinejad, H.; Abduli, S. Technical and economical selection of optimum transfer-transport method in solid waste management in metropolitan cities. Int. J. Environ. Res. 2007, 1, 179–187. [Google Scholar]
  58. Wang, S.A.; Zhen, L.; Dan, Z.G. Dynamic programming algorithms for selection of waste disposal ports in cruise shipping. Transp. Res. Part B Methodol. 2018, 108, 235–248. [Google Scholar] [CrossRef]
  59. Novarlic, B.; Stevic, Z.; Duric, P.; Vasiljevic, M. Efficiency in organizing transport routes as part of the city waste management: Proposal for innovative way of transport. Int. J. Qual. Res. 2017, 11, 507–524. [Google Scholar] [CrossRef]
  60. Inghels, D.; Dullaert, W.; Vigo, D. A service network design model for multimodal municipal solid waste transport. Eur. J. Oper. Res. 2016, 254, 68–79. [Google Scholar] [CrossRef]
  61. Tchobanoglous, G.; Theisen, H.; Vigil, S.A.; Alaniz, V.M. Integrated Solid Waste Management: Engineering Principles and Management Issues; McGraw-Hill: New York, NY, USA, 1993. [Google Scholar]
  62. Miranda, P.A.; Blazquez, C.A.; Vergara, R.; Weitzler, S. A novel methodology for designing a household waste collection system for insular zones. Transp. Res. Part E Log. Transp. Rev. 2015, 77, 227–247. [Google Scholar] [CrossRef]
  63. Gomez, J.R.; Pacheco, J.; Gonzalo-Orden, H. A Tabu Search Method for a Bi-Objective Urban Waste Collection Problem. Comput. Aided Civil Infrastruct. Eng. 2015, 30, 36–53. [Google Scholar] [CrossRef]
  64. Act No. 100/2001 Coll., of 20th February, 2001 on the Environmental Impact Assessment and Amending Some Related Laws (the EIA Act). Available online: https://www.zakonyprolidi.cz/cs/2001-100 (accessed on 16 April 2019).
  65. Directive 2008/98/EC of the European Parliament and of the Council of 19 November 2008 on waste and repealing certain Directives. Available online: https://eur-lex.europa.eu/eli/dir/2008/98/oj (accessed on 16 April 2019).
Figure 1. Example of the Nearest Neighbour Search heuristic when applying the c r i t 1 criterion. Source: Authors
Figure 1. Example of the Nearest Neighbour Search heuristic when applying the c r i t 1 criterion. Source: Authors
Sustainability 11 02275 g001
Table 1. Volume of household waste.
Table 1. Volume of household waste.
Type of Built-up AreaVolume of Waste
kg/inhab./Weekkg/inhab./Year
AverageMaximumMinimumAverage
Housing development3.43.92.5179
Mixed-use development3.64.23.2189
Rural housing *)5.98.52.8308
Note: *) with mostly solid fuel heating. Source: Authors.
Table 2. Composition of household waste (by % weight).
Table 2. Composition of household waste (by % weight).
ComponentsHousehold Waste—Share of Individual Components
(by % Weight), Average Values
Housing DevelopmentMixed-Use DevelopmentRural Housing *)
Paper, paperboard25.724.97.8
Plastics16.819.09.7
Glass11.28.54.9
Metals1.72.12.6
Organic waste15.619.611.7
Fabrics4.53.72.3
Mineral wastes2.20.56.8
Hazardous waste0.50.50.3
Combustible waste10.611.19.4
Waste EEE0.60.50.3
Fraction 20–40 mm5.04.24.9
Fraction 8–20 mm2.83.27.8
Fraction under 8 mm2.82.231.5
In total100.0100.0100.0
Note: *) with mostly solid fuel heating. Source: Authors.
Table 3. Weight (bulk density) of mixed waste from households (kg·m−3).
Table 3. Weight (bulk density) of mixed waste from households (kg·m−3).
TypeWeight (Bulk Density) of Mixed Waste from Households
(kg·m−3)
AverageMaximumMinimum
Housing development266232183
Mixed-use development292351207
Rural housing *)476494211
Note: *) mostly solid fuel heating. Source: Authors.
Table 4. Weight of components in mixed waste from households.
Table 4. Weight of components in mixed waste from households.
ComponentWeight (kg·m−3)
Paper, paperboard100
Plastics25
Glass350
Metals4000
Organic waste500
Fabric200
Mineral waste2500
Hazardous waste2000
Combustible waste500
Fine fraction1000
Source: authors.
Table 5. Volume of individual components in 1 kg of mixed waste.
Table 5. Volume of individual components in 1 kg of mixed waste.
ComponentsL·kg−1
Paper, paperboard2.57
Plastics6.72
Glass0.32
Metals0.004
Organic waste0.312
Fabric0.225
Mineral waste0.009
Hazardous waste0.006
Combustible waste0.212
Fine fraction0.106
In total10.484
Source: Authors.
Table 6. Amount of mixed waste without waste separation.
Table 6. Amount of mixed waste without waste separation.
Mixed Waste ComponentAverage ProductionVolume
kg/Daykg/WeekL/DayL/Week
Paper, paperboard0.1260.8821.268.82
Plastics0.0820.5743.2822.96
Glass0.0550.3850.1571.1
Metals0.0080.0560.0020.014
Organic waste0.0770.5390.1541.078
Fabric0.0220.1540.110.77
Mineral wastes0.0110.0770.0040.031
Hazardous waste0.0030.0210.0020.011
Combustible waste0.0520.3640.1040.728
Fine fraction0.0520.3640.0520.364
In total 5.12535.876
Source: Authors.
Table 7. Volume of mixed waste—50% separation of specified components.
Table 7. Volume of mixed waste—50% separation of specified components.
Mixed Waste ComponentsAfter 50% Separation
Average ProductionVolume
kg/Daykg/WeekL/DayL/Week
Paper, paperboard0.0630.4410.634.41
Plastics0.0410.2871.6411.48
Glass0.02750.19250.0790.55
Metals0.0040.0280.0010.007
Organic waste0.03850.26950.0770.539
Fabric0.0220.1540.110.77
Mineral wastes0.0110.0770.0040.031
Hazardous waste0.0030.0210.0020.011
Combustible waste0.0520.3640.1040.728
Fine fraction0.0520.3640.0520.364
In total 2.69918.89
Source: Authors.
Table 8. Volume of mixed waste under current levels of separation.
Table 8. Volume of mixed waste under current levels of separation.
Mixed Waste ComponentsAfter Separation (50% Paper, 50% Glass, 25% Plastics, 50% Metals, 0% Organic Waste)
Average ProductionVolume
kg/Daykg/WeekL/DayL/Week
Paper, paperboard0.0630.4410.634.41
Plastics0.06150.43052.4617.22
Glass0.02750.19250.0790.55
Metals0.0040.0280.0010.007
Organic waste0.0770.5390.1541.078
Fabric0.0220.1540.110.77
Mineral wastes0.0110.0770.0040.031
Hazardous waste0.0030.0210.0020.011
Combustible waste0.0520.3640.1040.728
Fine fraction0.0520.3640.0520.364
In total 3.59625.169
Source: Authors.
Table 9. Volume of mixed waste under different waste separation levels.
Table 9. Volume of mixed waste under different waste separation levels.
Separation LevelL/Day/PersonL/Week/Person
Zero separation6.662546.6388
50% separation3.508724.557
Current level of separation4.674832.7197
Source: Authors.
Table 10. Criteria mathematical expressions and descriptions.
Table 10. Criteria mathematical expressions and descriptions.
CriterionMathematical ExpressionDescription
1 c r i t 1 ( l ) : m i n ( k o n ( l ) ) minimisation of the evaluation of the route (its length) beyond the l edge to the depot
2 c r i t 2 ( l ) : m a x ( k o n ( l ) ) maximisation of the evaluation of the route beyond the l edge to the depot
3 c r i t 3 ( l ) : m i n ( w ( l ) c R ( l ) ) minimisation of the ratio expressing the “productivity“ of the l edge, where w(l) represents service requirement for the l edge and cR(l) the length of the service l edge
4 c r i t 4 ( l ) : m a x ( w ( l ) c R ( l ) ) maximisation of the ratio expressing the “productivity” of the l edge
5 c r i t 5 ( l ) = c r i t 1 ( l ) if n a k ( T 1 R ) Q 2 , or c r i t 5 ( l ) = c r i t 1 ( l ) ; where Q represents the capacity of a vehicle
Source: Authors.

Share and Cite

MDPI and ACS Style

Stopka, O.; Stopkova, M.; Kampf, R. Application of the Operational Research Method to Determine the Optimum Transport Collection Cycle of Municipal Waste in a Predesignated Urban Area. Sustainability 2019, 11, 2275. https://doi.org/10.3390/su11082275

AMA Style

Stopka O, Stopkova M, Kampf R. Application of the Operational Research Method to Determine the Optimum Transport Collection Cycle of Municipal Waste in a Predesignated Urban Area. Sustainability. 2019; 11(8):2275. https://doi.org/10.3390/su11082275

Chicago/Turabian Style

Stopka, Ondrej, Maria Stopkova, and Rudolf Kampf. 2019. "Application of the Operational Research Method to Determine the Optimum Transport Collection Cycle of Municipal Waste in a Predesignated Urban Area" Sustainability 11, no. 8: 2275. https://doi.org/10.3390/su11082275

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop