We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia.
- Authors
Šegota, Sandi Baressi; Lorencin, Ivan; Ohkura, Kazuhiro; Car, Zlatan
- Abstract
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.
- Subjects
CROATIA; TRAVELING salesman problem; EVOLUTIONARY algorithms; SIMULATED annealing; GENETIC algorithms; TOURISTS
- Publication
Annals of Maritime Studies / Pomorski Zbornik, 2019, Vol 57, Issue 1, p71
- ISSN
0554-6397
- Publication type
Article
- DOI
10.18048/2019.57.05.