Abstract
It is a great concerning problem for a mariner to know how maneuvering method is the best for his ship. Moreover it is also important for a ship builder in the meaning how the designed ship shows the maneuvering performance in full conditions. A minimum time maneuvering yields an answer about this problem. The minimum time maneuvering problem of ship can be formulated as two point boundary problem. The author has solved this non linear problem using the Sequential Conjugate Gradient-Restoration Algorithm (SCGRA) by Wu and Miel. This numerical method was a powerful solving method. However, a tedious programming method was needed. In this paper, the author proposes to treat this problem in a non linear programming formulation. According to this, our problem is transformed to more easy one and we can solve the transformed one by using a general Non Linear Programming (NLP) package. In this paper, the author solves a minimum time changing course problem and a Williamson's turning (man over board) one which are described by non linear mathematical maneuvering model.
