Multi-Objective Optimization of Voyage Plans for Ships
In this thesis two methods are investigated to solve a multi-objective optimization problem for voyage planning. The first method, grid search, is a brute force search in a three-dimensional graph while the other uses the Lipschitzian algorithm DIRECT to do a continuous search along a nominal route. The grid search method gives a computation time of 7.6 minutes for a route from Gothenburg to New