All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Quantity-predictive vehicle routing problem for smart waste collection

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F19%3A63524184" target="_blank" >RIV/70883521:28140/19:63524184 - isvavai.cz</a>

  • Alternative codes found

    RIV/00216305:26210/19:PU134241

  • Result on the web

    <a href="https://www.aidic.it/cet/19/76/209.pdf" target="_blank" >https://www.aidic.it/cet/19/76/209.pdf</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3303/CET1976209" target="_blank" >10.3303/CET1976209</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Quantity-predictive vehicle routing problem for smart waste collection

  • Original language description

    The current trends in the field of waste management involves the use of modern technologies such as wireless sensors. The smart waste management with Sensor Technology involves an integration of the so-called smart trash bins and containers into existing network by using sensors that fill level of the bins and containers. Apart from the technological aspects of the problem, this arrangement points to the need of development of new decision-making tools that allow collectors to make fast and smart operative decisions on the waste collection. The sensors from the waste containers read the current fill-height once a day and send the information to the central database. The central decision-maker appraises the data and makes the waste collection plan for an entire (e.g., one week) collection period; note that this improves existing models on the data available and used. The aim of this paper is to present complex modelling ideas, develop a simple mathematical model, discuss its complexity and propose/discuss a computational approach in order to solve the collection problem. The objective is to optimize the dynamic planning on daily garbage-truck schedules with respect to minimization of transportation costs that also reflects a positive environmental impact presented by savings in transportation/routing distance. The secondary objective is to optimally decide on early collection of partly-filled containers, especially those directly on or close to the optimum route linking the full ones considering waste production rates in the next days. The paper outlines some directions for further research such as the need of modifying the old-existing models into a form utilizing the newly available data. This leads to specific vehicle routing problems that request appropriate computational time requirements and the need of suitable heuristic methods development.

  • 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

    20701 - Environmental and geological engineering, geotechnics

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

    Chemical Engineering Transactions

  • ISSN

    2283-9216

  • e-ISSN

  • Volume of the periodical

    76

  • Issue of the periodical within the volume

    2019

  • Country of publishing house

    IT - ITALY

  • Number of pages

    6

  • Pages from-to

    1249-1254

  • UT code for WoS article

  • EID of the result in the Scopus database

    2-s2.0-85076310449