Optimisation of multi-plant capacitated lot-sizing problems in an integrated supply chain network using calibrated metaheuristic algorithms
by Maryam Mohammadi; Siti Nurmaya Musa; Mohd Bin Omar
International Journal of Operational Research (IJOR), Vol. 39, No. 3, 2020

Abstract: In this paper, a mathematical model for a multi-item multi-period capacitated lot-sizing problem in an integrated supply chain network composed of multiple suppliers, plants and distribution centres is developed. The combinations of several functions such as purchasing, production, storage, backordering and transportation are considered. The objective is to simultaneously determine the optimal raw material order quantity, production and inventory levels, and the transportation amount, so that the demand can be satisfied with the lowest possible cost. Transfer decisions between plants are made when demand at a plant can be fulfilled by other production sites to cope with the under-capacity and stock-out problems of that plant. Since the proposed model is NP-hard, a genetic algorithm is used to solve the model. To validate the results, particle swarm optimisation and imperialist competitive algorithm are applied to solve the model as well. The results show that genetic algorithm offers better solution compared to other algorithms.

Online publication date: Thu, 22-Oct-2020

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 International Journal of Operational Research (IJOR):
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