IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v39y2020i3p325-363.html
   My bibliography  Save this article

Optimisation of multi-plant capacitated lot-sizing problems in an integrated supply chain network using calibrated metaheuristic algorithms

Author

Listed:
  • Maryam Mohammadi
  • Siti Nurmaya Musa
  • Mohd Bin Omar

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.

Suggested Citation

  • Maryam Mohammadi & Siti Nurmaya Musa & Mohd Bin Omar, 2020. "Optimisation of multi-plant capacitated lot-sizing problems in an integrated supply chain network using calibrated metaheuristic algorithms," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 39(3), pages 325-363.
  • Handle: RePEc:ids:ijores:v:39:y:2020:i:3:p:325-363
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=110478
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:39:y:2020:i:3:p:325-363. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.