Optimizing Collection Routes of Collection Places
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62156489%3A43210%2F16%3A43910219" target="_blank" >RIV/62156489:43210/16:43910219 - isvavai.cz</a>
Result on the web
<a href="https://mnet.mendelu.cz/mendelnet2016/mnet_2016_full.pdf" target="_blank" >https://mnet.mendelu.cz/mendelnet2016/mnet_2016_full.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Optimizing Collection Routes of Collection Places
Original language description
This thesis attends to the optimization of separated waste collection routes, the waste is being collected by the company Technické služby VM s.r.o. The solution is carried out according to the salesman's methods with farthest insertion's algorithm. This algorithm provides possible solutions in an interface of two algebraic systems Maple and Bjornson's application. The routes for separated waste collection, which are compared, constitute an output.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
AP - Municipal, regional and transportation planning
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2016
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
Article name in the collection
MendelNet 2016: Proceedings of International PhD Students Conference
ISBN
978-80-7509-443-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
898-903
Publisher name
Mendelova univerzita v Brně
Place of publication
Brno
Event location
Brno
Event date
Nov 9, 2016
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
000392968500161