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”

Heuristics for Waste Collection Arc Routing Problem

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F19%3APU133306" target="_blank" >RIV/00216305:26210/19:PU133306 - isvavai.cz</a>

  • Result on the web

    <a href="https://mendel-journal.org/index.php/mendel/article/view/73/100" target="_blank" >https://mendel-journal.org/index.php/mendel/article/view/73/100</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.13164/mendel.2019.1.015" target="_blank" >10.13164/mendel.2019.1.015</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Heuristics for Waste Collection Arc Routing Problem

  • Original language description

    Waste management is still an expanding eld which needs to be constantly enhanced so that waste transportation and treatment is as eective as possible. An important part of this process is a waste collection at the municipal level. Decision-making about daily routing for all vehicles from a heterogenous eet substantially in uences the expenses of technical services. The need of route scheduling comes also from the newly separated fractions. Transportation features include the capacity of vehicles, number and type of containers on the route, traffic light delays and many others. The mathematical model that properly describes the real practice of servicing containers has not been published yet. Moreover, routing problems are generally not solvable by exact methods, so the appropriate heuristic algorithm has been developed. A case study with obtained results is discussed. This solution serves not only to improve the current operational situation, but also to create new route schedules for increasing number of collected commodities.

  • 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

    10102 - Applied mathematics

Result continuities

  • Project

    <a href="/en/project/EF16_026%2F0008413" target="_blank" >EF16_026/0008413: Strategic Partnership for Environmental Technologies and Energy Production</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

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

    Mendel Journal series

  • ISSN

    1803-3814

  • e-ISSN

  • Volume of the periodical

    25

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    CZ - CZECH REPUBLIC

  • Number of pages

    8

  • Pages from-to

    15-22

  • UT code for WoS article

  • EID of the result in the Scopus database

    2-s2.0-85071434894