Optimizing marine cargo in the Aegean with the simulated annealing algorithm

This paper presents an optimization approach to the problem of marine cargo in the Aegean, using the Simulated Annealing Algorithm. Our main target is minimizing the total crossing costs of thirteen harbors in the Aegean, when a ship can visit a harbor exactly once, with regard to the total cost of fuel and port fees. Our method utilizes Floyds Algorithm in order to determine the minimum distances and then apply the Simulated Annealing Algorithm to the hard combinatorial problem.