Abstract
The capacitated lot sizing problem (CLSP) arises when, under capacity constraints, the decision maker has to determine the production schedule and lot sizes that will minimize the total costs involved. The costs considered in this article are order, inventory carrying, and labor costs. The fitness function for the chromosome is computed using these cost elements. Next, the chromosomes are partitioned into good and poor segments based on the individual product chromosomes. This information is later used during crossover operation and results in crossover among multiple chromosomes. Product chromosomes are grouped into three groups, group 1 (top X%), group 2 (next Y%), and group 3 (last Z%). Product chromosomes from Groups 1, 2 and 3 can only form pairs with chromosomes from group 1. Besides, different crossover and mutation probabilities are applied for each group. The results of the experimentation showed that the different strategies of the proposed approach produced much better results than the classical genetic algorithm.
Similar content being viewed by others
References
Dellaert N., Jeunet J., Jonard N. (2000) A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs. International Journal of Production Economics 68: 241–257
Gutierrez, E., Hernandez, W., & Süer, G. (2002). Genetic algorithms in capacitated lot sizing decisions. Working Paper, Department of Industrial Engineering, University of Puerto Rico.
Hong-hang Y., Zhi-ming W. (2003) Two level GA-based approach to the capacitated lot sizing problem for multi-plants supply chain. Journal of Shanghai Jiaotong University 137(4): 473–478
Karimi B., Ghomi S.M.T.F., Wilson J.M. (2003) The capacitated lot sizing problem: A review of models and algorithms. Omega 31: 365–378
Özdamar L., Birbil S.I. (1998) Theory and methodology: Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. European Journal of Operational Research 110(3): 525–547
Özdamar L., Birbil S., Portmann M. (2002) Technical note: New results for the capacitated lot sizing problem with overtime decisions and setup times. Production Planning & Control 13(1): 2–10
Prasad P.S.S., Krishnaiah Chetty O.V. (2001) Multilevel lot sizing with a genetic algorithm under fixed and rolling horizons. International Journal of Advanced Manufacturing Technology 18: 520–527
Sambasivan M., Schmidt C.P. (2002) A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot sizing problems. Asia-Pacific Journal of Operational Research 19: 87–105
Sikora R. (1996) A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line. Computers in Industrial Engineering 3(4): 969–981
Watanabe M., Ida K., Gen M. (2005) A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Computers & Industrial Engineering 48: 743–752
Author information
Authors and Affiliations
Corresponding author
Additional information
This article has been submitted to the Journal of Intelligent Manufacturing for publication.
Rights and permissions
About this article
Cite this article
Süer, G.A., Badurdeen, F. & Dissanayake, N. Capacitated lot sizing by using multi-chromosome crossover strategy. J Intell Manuf 19, 273–282 (2008). https://doi.org/10.1007/s10845-008-0080-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-008-0080-x