A route generation algorithm for an optimal fuel routing problem between two single ports

摘要

In this paper, a problem to find the shipping route and speed that minimize the total fuel consumption between two ports is formulated as a mixed-integer nonlinear optimization problem (MINLP). In special cases, theMINLP becomes a mixed-integer second-order cone optimization problem. To solve this problem, the authors propose a route generation algorithm that implicitly enumerates the feasible shipping routes. Enumerating all feasible shipping routes is avoided by computing lower bounds of the optimal value. The effectiveness of our algorithm is verified in numerical experiments.