Simulated annealing for optimal ship routing

Authors:
O. T. Kosmas;D. S. Vlachos
Affiliations:
Department of Computer Science and Technology, University of Peloponnese, GR-22100, Greece and Chair of Applied Dynamics, University of Erlangen-Nuremberg, D-91058, Germany;Department of Computer Science and Technology, University of Peloponnese, GR-22100, Greece
Venue:
Computers and Operations Research
Year:
2012

Citing 8
Cited 0

Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm: Corrigenda for this article is available here

ACM Transactions on Mathematical Software (TOMS)
Simulated annealing and the mapping problem: a computational study

Computers and Operations Research
Mechanical integrators derived from a discrete variational principle

Physica D
Neural Networks for Optimization and Signal Processing

Neural Networks for Optimization and Signal Processing
An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages

Computers and Operations Research
A hybrid approach for multi-objective combinatorial optimisation problems in ship design and shipping

Computers and Operations Research
Tank allocation problems in maritime bulk shipping

Computers and Operations Research
Efficient hybrid methods for global continuous optimization based on simulated annealing

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this article we present a simulated annealing based algorithm for the determination of optimal ship routes through the minimization of a cost function defined as a weighted sum of the time of voyage and the voyage comfort (safety is taken into account too). This cost function is dependent on the wind speed and its direction as well as on the wave height and its direction. The constructed algorithm at the beginning discretizes an initial route and then optimizes it by considering small deviations, which are accepted or rejected by utilizing the simulated annealing technique. Using calculus of variations, we prove a key theorem which tremendously accelerates the convergence of the proposed algorithm. For an illustration of the advantages of the constructed method, both computational and real experiments have been carried out which are presented and discussed.