Pregled bibliografske jedinice broj: 1045325
On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia
On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia // Pomorski zbornik, 57 (2019), 1; 71-87 doi:10.18048/2019.57.05. (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1045325 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia
Autori
Baressi Šegota, Sandi ; Lorencin, Ivan ; Ohkura, Kazuhiro ; Car, Zlatan
Izvornik
Pomorski zbornik (0554-6397) 57
(2019), 1;
71-87
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
evolutionary computing ; genetic algorithm ; simulated annealing ; tourism ; traveling salesman problem
Sažetak
The Traveling salesman problem (TSP) defines the problem of finding the optimal path between multiple points, connected by paths of a certain cost. This paper applies that problem formulation in the maritime environment, specifically a path planning problem for a tour boat visiting popular tourist locations in Medulin, Croatia. The problem is solved using two evolutionary computing methods – the genetic algorithm (GA) and the simulated annealing (SA) - and comparing the results (are compared) by an extensive search of the solution space. The results show that evolutionary computing algorithms provide comparable results to an extensive search in a shorter amount of time, with SA providing better results of the two.
Izvorni jezik
Engleski
Znanstvena područja
Strojarstvo
POVEZANOST RADA
Ustanove:
Tehnički fakultet, Rijeka
