• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.133-141
• /
• 2001

Rapid development in computer and network technology these days has created in environment in which decisions for manufacturing companies can be made in a much broader perspective. Especially, better decisions on production and distribution planning(PDP) problems can be made laking advantage of real time information from all the parties concerned. However, since the PDP problem-a core part of the supply chain management- is known to be the so-called NP-hard problem, so heuristic methods are dominantly used to find out solutions in a reasonable time. As one of those heuristic techniques, many previous studios considered genetic a1gorithms. A standard genetic a1gorithm applies rules of reproduction, gene crossover, and mutation to the pseudo-organisms so the organisms can pass along beneficial and survival-enhancing trails to a new generation. When it comes to representing a chromosome on the problem, it is hard to guarantee an evolution of solutions through classic a1gorithm operations alone, for there exists a strong epitasis among genes. To resolve this problem, we propose a hybrid genetic a1gorithm based on Silver-Meal heuristic. Using IMS-TB(Intelligent Manufacturing System Test-bed) problem sets. the good performance of the proposed a1gorithm is demonstrated.

• Korean Management Science Review
• /
• v.5 no.1
• /
• pp.56-70
• /
• 1988

In this study, We reviewed the solution methods (for the heuristic and optimization method) for the single-item dynamic lot-sizing problem, and improved the efficiency (speed and optimality) of the conventional heuristic method by utilizing the inventory decomposition property. The iventory decomposition property decomposes the given original problem into several independent subproblems without violating the optimality conditions. Then we solve each decomposed subproblems by using the conventional heuristics such as LTC, LUC, Silver-Meal etc. For testing the efficiency of the proposed decomposition method, we adopted the data sets given in Kaimann, Berry and Silver-Meal. The computational results show that the suggested problem solving framework results in some promising effects on the computation time and the degree of optimality.