Publication detail
Heuristics for Waste Collection Arc Routing Problem
NEVRLÝ, V. ŠOMPLÁK, R. POPELA, P.
Original Title
Heuristics for Waste Collection Arc Routing Problem
Type
journal article in Scopus
Language
English
Original Abstract
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.
Keywords
waste management; combinatorial optimization; heuristics; routing problem; waste collection; arc routing
Authors
NEVRLÝ, V.; ŠOMPLÁK, R.; POPELA, P.
Released
24. 6. 2019
Publisher
Brno University of Technology
Location
Brno
ISBN
1803-3814
Periodical
Mendel Journal series
Year of study
25
Number
1
State
Czech Republic
Pages from
15
Pages to
22
Pages count
8
URL
BibTex
@article{BUT158671,
author="Vlastimír {Nevrlý} and Radovan {Šomplák} and Pavel {Popela}",
title="Heuristics for Waste Collection Arc Routing Problem",
journal="Mendel Journal series",
year="2019",
volume="25",
number="1",
pages="15--22",
doi="10.13164/mendel.2019.1.015",
issn="1803-3814",
url="https://mendel-journal.org/index.php/mendel/article/view/73/100"
}