A comparative study of hybrid approaches for solving capacitated lot sizing problem with setup carryover and backordering
by Hacer Guner Goren; Semra Tunali
European J. of Industrial Engineering (EJIE), Vol. 10, No. 6, 2016

Abstract: The classical capacitated lot sizing problem is shown to be NP-hard for even a single item problem. This study deals with an extended version of this problem with setup carryover and backordering. To solve this computationally difficult lot sizing problem, we propose a number of hybrid meta-heuristic approaches consisting of genetic algorithms and a mixed integer programming-based heuristic. This MIP-based heuristic is combined with two types of decomposition schemes (i.e., product and time decomposition) to generate subproblems. Computational experiments are carried out on various problem sizes. We found that hybrid approaches employing only time decomposition scheme or combination of both time and product decomposition schemes in different forms outperform the other hybrid approaches. Moreover, we investigated the sensitivity of the two best performing approaches to changes in problem-specific parameters including backorder costs, setup times, setup costs, capacity utilisation and demand variability. [Received 2 November 2015; Revised 25 March 2016; Accepted 7 April 2016]

Online publication date: Thu, 15-Dec-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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