%0 Journal Article
%T On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia
%A Baressi £żegota
%A Sandi
%A Car
%A Zlatan
%A Lorencin
%A Ivan
%A Ohkura
%A Kazuhiro
%J -
%D 2019
%R 10.18048/2019.57.05.
%X 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 ¨C 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
%K evolutionary computing
%K genetic algorithm
%K simulated annealing
%K tourism
%K traveling salesman problem
%U https://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=338470