Proposal of waste collection route with using algorithms to solve the traveling salesman problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62156489%3A43210%2F18%3A43914699" target="_blank" >RIV/62156489:43210/18:43914699 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14560/18:00110799
Result on the web
<a href="https://mnet.mendelu.cz/mendelnet2018/mnet_2018_full.pdf" target="_blank" >https://mnet.mendelu.cz/mendelnet2018/mnet_2018_full.pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Proposal of waste collection route with using algorithms to solve the traveling salesman problem
Original language description
This thesis deals with the optimization of collection routes of separated waste in Velké Meziříčí. This waste is collected by the Technical Services VM s.r.o. The solution is designed using the well-known Traveling salesman problem method and the proposed algorithm is a combination of these methods. The algorithm is designed to work in the Maple algebraic system and the data were analysed using ArcGIS and Statistica. Gradual development and functionality of the algorithm is represented by resulting separate waste collection routes.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Article name in the collection
MendelNet 2018: Proceedings of International PhD Students Conference
ISBN
978-80-7509-597-8
ISSN
—
e-ISSN
neuvedeno
Number of pages
6
Pages from-to
446-451
Publisher name
Mendelova univerzita v Brně
Place of publication
Brno
Event location
Brno
Event date
Nov 7, 2018
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
000462205300085

Similar results(10)