Skoči na glavni sadržaj

Izvorni znanstveni članak

https://doi.org/10.18048/2019.57.05.

On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia

Sandi Baressi Šegota orcid id orcid.org/0000-0002-3015-1024 ; University of Rijeka, Faculty of Engineering
Ivan Lorencin ; University of Rijeka, Faculty of Engineering
Kazuhiro Ohkura ; Hiroshima University
Zlatan Car orcid id orcid.org/0000-0003-2817-9252 ; University of Rijeka, Faculty of Engineering


Puni tekst: engleski pdf 867 Kb

str. 71-87

preuzimanja: 372

citiraj


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.

Ključne riječi

evolutionary computing, genetic algorithm, simulated annealing, tourism, traveling salesman problem

Hrčak ID:

232665

URI

https://hrcak.srce.hr/232665

Posjeta: 775 *