| Abstract: | By analysing the merits and demerits of the existing linear model for fleet planning, this paper presents an algorithm which combines the linear programming technique with that of dynamic programming to improve the solution to linear model for fleet planning. This new approach has not only the merits that the linear model for fleet planning has, but also the merit of saving computing time. The numbers of ships newly added into the fleet every year are always integers in the final optimal solution. The last feature of the solution directly meets the requirements of practical application. Both the mathematical model of the dynamic fleet planning and its algorithm are put forward in this paper. A calculating example is also given. |
