Lot Sizing Problems & Genetic Algorithms
Speaker
Abstract
| Lot sizing problems are production planning problems with the objective of determining the periods where production should take place and the quantities to be produced in order to satisfy demand while minimizing production, setup and inventory costs. Most lot sizing problems are combinatorial and hard to solve. In recent years, to deal with the complexity and find optimal or near-optimal results in reasonable computational time, a growing number of researchers have employed meta-heuristic approaches to lot sizing problems. One of the most popular meta-heuristics is genetic algorithms which have been applied to different optimization problems with good results. The focus of this presentation is to explain the use of genetic algorithms in lot sizing problems. First, some basic terms related to lot sizing and genetic algorithms will be given. Next, a review of the recent published literature employing genetic algorithms to solve lot sizing problems will be presented. The main features of the lot sizing problems and the specifications of genetic algorithms suggested in solving these problems are taken into consideration in reviewing. Lastly, the literature gaps and ideas for future research will be explained. |
| Contact information: |
| Dr. R. Jans |
