Simulated Annealing for Optimal Ship Routing
| dc.creator | Kosmas, O. T. | |
| dc.creator | Vlachos, D. S. | |
| dc.date | 2008-11-13 | |
| dc.date | 2009-05-04 | |
| dc.date.accessioned | 2026-07-07T13:10:52Z | |
| dc.date.available | 2026-07-07T13:10:52Z | |
| dc.description | A simulated annealing based algorithm is presented for the determination of optimal ship routes through the minimization of a cost function. This cost function is a weighted sum of the time of voyage and the voyage comfort (safety is taken into account too). The latter is dependent on both the wind speed and direction and the wave height and direction. The algorithm first discretizes an initial route and optimizes it by considering small deviations which are accepted by utilizing the simulated annealing technique. Using calculus of variations we prove a key theorem which dramatically accelerates the convergence of the algorithm. Finally both simulated and real experiments are presented. | |
| dc.description | 19 pages, 6 figures | |
| dc.identifier | https://arxiv.org/abs/0811.2162 | |
| dc.identifier | http://arxiv.org/abs/0811.2162 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/229119 | |
| dc.subject | Computational Physics | |
| dc.title | Simulated Annealing for Optimal Ship Routing | |
| dc.type | text |