Dual-stage genetic algorithm approach for capacitated lot sizing problem Online publication date: Mon, 28-Apr-2014
by Ramadan Saleem; Gürsel A. Süer; Jing Huang
International Journal of Advanced Operations Management (IJAOM), Vol. 5, No. 4, 2013
Abstract: The capacitated lot sizing problem (CLSP) deals with determining lot sizes under capacity restrictions such that the total cost is minimised. The costs considered in this paper are ordering, inventory carrying, and labour costs. The work presented in this paper is an improvement over single stage genetic algorithm (SSGA) approach proposed by Süer et al. (2008) where no partial coverage was considered. This study addresses this weakness of their work and allows partial coverage by considering a dual-stage genetic algorithm (DSGA). Stage 1 of the proposed GA works with binary representation and the best chromosome is input into Stage 2. Stage 2 of the DSGA works with integer representation and uses only mutation operator. Stage 1 includes a group-based enumeration crossover strategy and Stage 2 includes a dynamic-percentage mutation strategy. The results of the experimentation showed that newly proposed DSGA outperformed SSGA in all test problems used in the experimentation.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Operations Management (IJAOM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook