|
|
|
|
| LEADER |
02647na a2200229 4500 |
| 003 |
HR-ZaFER |
| 008 |
160221s2019 ci ||||| m||| 00| 0 hr d |
| 035 |
|
|
|a (HR-ZaFER)ferid7407
|
| 040 |
|
|
|a HR-ZaFER
|b hrv
|c HR-ZaFER
|e ppiak
|
| 100 |
1 |
|
|a Ivanković, Marko
|9 40710
|
| 245 |
1 |
0 |
|a Primjena Lin-Kernighan-Helsgaun TSP solvera na probleme usmjeravanja vozila :
|b završni rad /
|c Marko Ivanković ; [mentor Josipa Pina Milišić].
|
| 246 |
1 |
|
|a An Application of the Lin-Kernighan-Helsgaun TSP Solver for Vehicle Routing Problems
|i Naslov na engleskom:
|
| 260 |
|
|
|a Zagreb,
|b M. Ivanković,
|c 2019.
|
| 300 |
|
|
|a 36 str. ;
|c 30 cm +
|e CD-ROM
|
| 502 |
|
|
|b preddiplomski studij
|c Fakultet elektrotehnike i računarstva u Zagrebu
|g smjer: Računarska znanost, šifra smjera: 41, datum predaje: 2019-06-14, datum završetka: 2019-09-06
|
| 520 |
3 |
|
|a Sažetak na hrvatskom: Poznati kombinatorni problem trgovačkog putnika klasificira se kao NP-potpun problem. Različitim heuristikama i algoritmima, pa čak i za velik broj gradova, moguće je dobiti rješenje u razumnom vremenu. Trenutno najbolja tura za TSP problem koji uključuje sve gradove svijeta iznosi 7,515,772,107, a pronašao ju je Keld Helsgaun. Završni rad se zasniva na detaljnoj implementaciji i analizi Lin-Kernighan-Helsgaun algoritma, Lin-Kernighan algoritma i pripadajućih heuristika te metode grananja i razgranavanja. Svaki algoritam opisan je svojim Python i pseudokodom, a na kraju i vizualno reprezentiran alatima iz matplotlib-a. Također, razmatra se proširena verzija Lin-Kernighan-Helsgaun algoritma namjenjena za rješavanje problema za navigaciju vozila (VRP).
|
| 520 |
3 |
|
|a Sažetak na engleskom: A well-known traveling salesman problem is a combinatorial problem classified as a NP-complete problem. By applying different heuristics and algorithms, even for a large number of cities, it is possible to get a solution in a reasonable time. Currently, length of the best TSP tour that includes all cities in the world is 7,515,772,107, and has been found by Keld Helsgaun. This bachelor thesis is based on the detailed implementation and analysis of Lin-Kernighan-Helsgaun algorithm, Lin-Kernighan algorithm and related heuristics, and branch and bound method. Each algorithm is described by its Python code and pseudocode, and ultimately is visually represented by matplotlib tools. Also, an extended version of the Lin-Kernighan-Helsgaun algorithm designed to solve vehicle navigation problems (VRP) is considered.
|
| 653 |
|
1 |
|a Lin-Kernighan-Helsgaun
|a VRP
|
| 653 |
|
1 |
|a Lin-Kernighan-Helsgaun
|a VRP
|
| 700 |
1 |
|
|a Milišić, Josipa Pina
|4 ths
|9 33201
|
| 942 |
|
|
|c Z
|
| 999 |
|
|
|c 51423
|d 51423
|