残業生産を考慮したロットサイズ決定問題に対するアニーリング・ヒューリスティック

概要

論文の詳細を見る
A heuristic based on simulated annealing method is developed to solve lot sizing problem with setup times. The problem assumes that the unlimited overtime production is available for each planning period so as to generate a feasible neighborhood solution easily. Firstly the problem is modified into a zero-one programming problem in order to obtain the objective function value without complicated calculation. Then the simulated annealing heuristic is implemented to obtain the best solution. Finally this solution is fed into a simplex algorithm to obtain the revised best solution. In the numerical examples, the simulated annealing heuristic is compared with the Lagrangean relaxation approach and the following results are obtained ; ( 1 ) the heuristic produced better solutions on the average, ( 2 ) setting the production quantity equal to either zero or the cumulative demand performed well in the condition of many products, and ( 3 ) performance of the heuristic was relatively sensitive to the initial random seeds.
一般社団法人日本機械学会の論文
1993-02-25