Publication detail
Heuristic for generation of waste transportation test networks
NEVRLÝ, V. POPELA, P. PAVLAS, M. ŠOMPLÁK, R.
Czech title
Heuristika pro generování testovacích sítí pro dopravu odpadu
English title
Heuristic for generation of waste transportation test networks
Type
journal article in Web of Science
Language
en
Original abstract
The aim of the paper is to present a specialized method for generation of test transportation networks for real-world waste management problems and to illustrate it by the obtained results. Several software tools (Mathematica, GAMS, Excel, VBA) are used to implement suitable procedures. The existing original optimiza- Tion system called NERUDA that supports decision-making in the field of waste management is utilized. The obtained results are processed, analysed and interpreted. At the end of the paper, the dependence of computational complexity on the size of network by using test computations is analysed.
Czech abstract
Cílem textu je prezentovat speciální metodu pro generování testovacích dopravních sítí pro nakládání s odpady a metodu ilustrovat pomocí dosažených výsledků. Vybrané softwarové nástroje (Mathematica, GAMS, Excel, VBA) jsou využity k implementaci částí metody. Je využit stávající optimalizační systém nazývaný NERUDA, který podporuje rozhodování v oblasti odpadového hospodářství. Získané výsledky jsou zpracovávány, analyzovány a interpretovány. V závěru textu je analyzována závislost výpočetní složitosti na velikosti sítě.
English abstract
The aim of the paper is to present a specialized method for generation of test transportation networks for real-world waste management problems and to illustrate it by the obtained results. Several software tools (Mathematica, GAMS, Excel, VBA) are used to implement suitable procedures. The existing original optimiza- Tion system called NERUDA that supports decision-making in the field of waste management is utilized. The obtained results are processed, analysed and interpreted. At the end of the paper, the dependence of computational complexity on the size of network by using test computations is analysed.
Keywords in Czech
Výpočetní testy; heuristické grafové algoritmy; NERUDA; dopravní sítě; nakládání s odpady
Keywords in English
Computational tests; Heuristic graph algorithms; NERUDA; Transportation networks; Waste management
RIV year
2015
Released
23.06.2015
Publisher
VUT
Location
Brno
ISSN
1803-3814
Volume
2015
Number
1
Pages from–to
189–194
Pages count
6
BIBTEX
@article{BUT123839,
author="Vlastimír {Nevrlý} and Pavel {Popela} and Martin {Pavlas} and Radovan {Šomplák},
title="Heuristic for generation of waste transportation test networks",
year="2015",
volume="2015",
number="1",
month="June",
pages="189--194",
publisher="VUT",
address="Brno",
issn="1803-3814"
}