1997 年 97 巻 p. 141-147
At present, loading operation plan at ferry terminal depends on operator's experience and intuition. We studied some solutions of maximum loading plan for a ferryboat. We considered formulation of loading order of cars, with a constraint first come first served' without parameter of car's weight. According to the hearing from ferry shipping company, we had indicated that loading plan should be considered including ship's trim and heel condition. So, this paper is concerned with solution of this problem that minimizes the trim, the heel and dissatisfaction of the car-users in terms of loading order. Generally these have the trade-off between these objectives. Hence this three-objective problem, which yields the pareto set of the feasible solution in decision space, is studied by using algorithms of branch and bound method. Finally some numerical results for this problem are provided by the algorithms implemented with C++.