International Conference Solving Multi-level Lot Sizing Problem with Memetic Algorithm based on Refinement Procedure
2015.07.30 18:38
| author | Haejoong Kim |
|---|---|
| 2nd author | / Sungwon Jung (Dept. of Industrial Engineering, Seoul National University) / Eoksu Sim (Dept. of Industrial Engineering, Seoul National University) / Jungsub Lee (Dept. of Industrial Engineering, Seoul National University) / Jinwoo Park (Dept. of Industrial Engineering, Seoul National University) |
| presenter | |
| info | Date: 2006년 07월 08일 ~ 2006년 07월 12일 City: Seattle Nation: U.S.A. Additional Information: |
| year | 2006 |
| category | IC |
| start / end date | |
| city / nation | |
| 학회 | GECCO |
| keywords | Multi-level lot sizing, Benchmark-based Genetic Algorithm, Memetic Algorithm based on Refinement Procedure |
| abstract | Production planning is a core function in manufacturing systems and is gaining even greater attention in supply chain environments where many mutually dependent and cooperative manufacturers are involved. Lot sizing is one of the most important and difficult problems in production planning. While optimal solution algorithms exist for this problem, only very small problems can be solved in a reasonable computation time because the problem is NP-hard. In this paper we present a meta-heuristic approach, which we call “Memetic Algorithm based on Refinement Procedure”, to solve multi-level lot sizing (MLLS) problem. We use a local refinement procedure based on benchmarking to facilitate the solution search. The benchmark-based refinement procedure proposed by this study is also applicable to other problems where solutions are difficult to refine |
