Evolutionary Algorithms in Transport Planning

DSpace Repository

Language: English čeština 

Evolutionary Algorithms in Transport Planning

Show simple item record

dc.contributor.advisor Vařacha, Pavel
dc.contributor.author Hrabal, Petr
dc.date.accessioned 2013-10-13T01:26:37Z
dc.date.available 2013-10-13T01:26:37Z
dc.date.issued 2013-02-22
dc.identifier Elektronický archiv Knihovny UTB cs
dc.identifier.uri http://hdl.handle.net/10563/24836
dc.description.abstract The thesis deals with the optimization and scheduling problems and does not focus on an arguing about how efficient search algorithms are from economy perspective, but to develop one. The result will be verified the idea of artificial intelligence, actually develop genetic algorithm and apply it on known problems related with this area such as Traveling Salesman Problem. Test the behavior of the genetic algorithm when an input variables are changed in permitted range. All simulations and tests were done by developed application. cs
dc.format 99 cs
dc.format.extent 13992580 bytes cs
dc.format.mimetype application/zip cs
dc.language.iso en
dc.publisher Univerzita Tomáše Bati ve Zlíně
dc.rights Bez omezení
dc.subject Artificial Intelligence cs
dc.subject Evolutionary Computation cs
dc.subject Genetic Algorithm cs
dc.subject Traveling Salesman Problem cs
dc.subject Vehicle Routing Problem cs
dc.subject Theory of Computation cs
dc.subject Artificial Intelligence en
dc.subject Evolutionary Computation en
dc.subject Genetic Algorithm en
dc.subject Traveling Salesman Problem en
dc.subject Vehicle Routing Problem en
dc.subject Theory of Computation en
dc.title Evolutionary Algorithms in Transport Planning cs
dc.title.alternative Evolutionary Algorithms in Transport Planning en
dc.type diplomová práce cs
dc.contributor.referee Horák, Tomáš
dc.date.accepted 2013-06-07
dc.description.abstract-translated The thesis deals with the optimization and scheduling problems and does not focus on an arguing about how efficient search algorithms are from economy perspective, but to develop one. The result will be verified the idea of artificial intelligence, actually develop genetic algorithm and apply it on known problems related with this area such as Traveling Salesman Problem. Test the behavior of the genetic algorithm when an input variables are changed in permitted range. All simulations and tests were done by developed application. en
dc.description.department Ústav informatiky a umělé inteligence cs
dc.description.result obhájeno cs
dc.parent.uri http://hdl.handle.net/10563/154 cs
dc.parent.uri http://hdl.handle.net/10563/220 cs
dc.thesis.degree-discipline Informační technologie cs
dc.thesis.degree-discipline Information Technologies en
dc.thesis.degree-grantor Univerzita Tomáše Bati ve Zlíně. Fakulta aplikované informatiky cs
dc.thesis.degree-grantor Tomas Bata University in Zlín. Faculty of Applied Informatics en
dc.thesis.degree-name Ing. cs
dc.thesis.degree-program Inženýrská informatika cs
dc.thesis.degree-program Engineering Informatics en
dc.identifier.stag 31140
utb.result.grade B
dc.date.submitted 2013-05-22
local.subject evoluční algoritmy cs
local.subject dopravní data cs
local.subject umělá inteligence cs
local.subject dopravní logistika cs
local.subject evolutionary algorithms en
local.subject transportation data en


Files in this item

Files Size Format View
hrabal_2013_dp.zip 13.34Mb Unknown View/Open
hrabal_2013_vp.doc 291Kb Microsoft Word View/Open
hrabal_2013_op.pdf 134.0Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Find fulltext

Search DSpace


Browse

My Account