A review of applications of genetic algorithms in lot sizing
- 803 Downloads
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 paper is on the recent published literature employing genetic algorithms to solve lot sizing problems. The aim of the review is twofold. First it provides an overview of recent advances in the field in order to highlight the many ways GAs can be applied to various lot sizing models. Second, it presents ideas for future research by identifying gaps in the current literature. In reviewing the relevant literature the focus has been on the main features of the lot sizing problems and the specifications of genetic algorithms suggested in solving these problems.
KeywordsProduction planning Meta-heuristics Lot sizing Genetic algorithms
Unable to display preview. Download preview PDF.
- Afentakis P. (1987) Parallel heuristic algorithm for lot-sizing in multistage production systems. IIE Transactions 19(1): 34–42. doi: 10.1080/07408178708975367Institute of Industrial Engineers
- Askin R.G., Goldberg J.B. (2002) Design and analysis of lean production systems. Wiley, United States of AmericaGoogle Scholar
- Gen, M., & Cheng, R. (1997). Genetic algorithms and engineering design. Wiley Series in Engineering: Design and Automation United States of America.Google Scholar
- Hernandez W., Süer A.G. (1999) Genetic algorithms in lot sizing decisions. Proceedings of the 1999(Congress on Evolutionary Computation 3): 2280–2286Google Scholar
- Hung Y.-F., Chien K.-L. (2000) Multi-class multi level capacitated lot sizing model. The Journal of the Operational Research Society 51(11): 1309–1318Google Scholar
- Hung Y. F., Shih C.-C., Chen C.-P. (1999) Evolutionary algorithms for production planning problems with setup decisions. The Journal of the Operational Research Society 50(8): 857–866Google Scholar
- Karimi B., Fatemi S.M.T., Fatemi S.M.T., Wilson J.M. (2006) A tabu search heuristic for solving the CLSP with backlogging and setup carryover. The Journal of the Operational Research Society 57(2): 140–147Google Scholar
- Ozdamar L., Bozyel M.A. (2000) Capacitated lot sizing problem with overtime decisions and setup times. IIE Transactions 32(11): 1043–1057 Institute of Industrial EngineersGoogle Scholar
- Raidl, & Gunther, R. (2006). A unified view on hybrid meta-heuristics. Lecture Notes in Computer, Hybrid Meta-heuristics—Third International Workshop, HM 2006. Proceedings, Vol. 4030, pp. 1–12.Google Scholar
- Staggemeier, A. T., & Clark, A. R. (2001). A Survey of Lot-sizing and scheduling models. Presented at the Proceedings of 23rd Annual Symposium of the Brazilian Operational Research Society.Google Scholar
- Xie J. (1995) An application of genetic algorithms for general dynamic lot sizing problems. Proceedings of Genetic Algorithms in Engineering Systems: Innovations and Applications 414: 82–87Google Scholar