Heuristics for Waste Collection Arc Routing Problem

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Heuristics for Waste Collection Arc Routing Problem

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Heuristics for Waste Collection Arc Routing Problem

Popis výsledku anglicky

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.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

<a href="/cs/project/EF16_026%2F0008413" target="_blank" >EF16_026/0008413: Strategické partnerství pro environmentální technologie a produkci energie</a><br>

Návaznosti

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

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Mendel Journal series

ISSN

1803-3814

e-ISSN

—

Svazek periodika

25

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

8

Strana od-do

15-22

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85071434894