Application of the Operational Research Method to Determine the Optimum Transport Collection Cycle of Municipal Waste in a Predesignated Urban Area
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F75081431%3A_____%2F19%3A00001691" target="_blank" >RIV/75081431:_____/19:00001691 - isvavai.cz</a>
Result on the web
<a href="https://www.mdpi.com/2071-1050/11/8/2275" target="_blank" >https://www.mdpi.com/2071-1050/11/8/2275</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3390/su11082275" target="_blank" >10.3390/su11082275</a>
Alternative languages
Result language
angličtina
Original language name
Application of the Operational Research Method to Determine the Optimum Transport Collection Cycle of Municipal Waste in a Predesignated Urban Area
Original language description
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 factorshousehold 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
50703 - Transport planning and social aspects of transport (transport engineering to be 2.1)
Result continuities
Project
—
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Sustainability
ISSN
2071-1050
e-ISSN
—
Volume of the periodical
11
Issue of the periodical within the volume
8
Country of publishing house
CH - SWITZERLAND
Number of pages
15
Pages from-to
—
UT code for WoS article
000467752200088
EID of the result in the Scopus database
2-s2.0-85066842810