段ボール箱製造スケジューリングの多目的最適化

概要

論文の詳細を見る
A practical method for solving the cardboard box production scheduling problem using genetic algorithms is presented. This problem is formulated as a multi-objective combinatorial optimization problem involving minimization of the numbers of setup at printing line and minimization of the total loss. Generally, the solution of a multi-objective optimization problem is obtained as a set of Pareto optimal solutions, which are compared manually to obtain the desired solution. However, it is very difficult to obtain multiple Pareto optimal solutions in a single trial by the conventional method. Genetic algorithms have advantage of excelling in multi-point search. The proposed method can efficiently obtain a set of Pareto optimal solution candidates by exploiting the advantage of GA. Moreover, good solution is obtained by combining genetic algorithms and local search. The result of numerical test shows the effectiveness of the proposed method for a large scale cardboard box production scheduling problem.
2005-12-20