IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v21y2015i1p1-26.html
   My bibliography  Save this article

Optimisation of multi-stage supply chain systems by integrated simulation-variable neighbourhood search algorithm

Author

Listed:
  • Ali Azadeh
  • Ali Zahedi Anaraki
  • Sara Motevali Haghighi
  • Zahra Jiryaei
  • Fatemeh Nadarlou

Abstract

In this paper, multi-stage supply chain systems (SCSs) controlled by kanban system are appraised a new simulation metaheuristics approach. In the kanban system, decision making is based on determination of batch size for each kanban. This paper simulates supply chain system regarding the costs under just-in-time (JIT) production philosophy. Since the adopted model is of backward type, the desired output is given in order to find the parameters and/or the structure of the model producing the output. This backward problem is non-analytic and often seems to be even more complex than the forward one. This paper applies genetic algorithm (GA) and variable neighbourhood search (VNS) to optimise the simulation model. A simple real-coded GA and VNS is presented and used to change the simulation model parameters. With each new set of parameters, a simulation run is performed. From the statistics gathered by running the simulation, a goal function is constructed to measure the quality of these parameters. GA and VNS and GA-VNS successfully provide a parameter set to demonstrate its capability to solve such difficult backward problems even in the area of complex simulation model optimisation specially when there is no prior knowledge of simulation model behaviour.

Suggested Citation

  • Ali Azadeh & Ali Zahedi Anaraki & Sara Motevali Haghighi & Zahra Jiryaei & Fatemeh Nadarlou, 2015. "Optimisation of multi-stage supply chain systems by integrated simulation-variable neighbourhood search algorithm," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 21(1), pages 1-26.
    • Handle: RePEc:ids:ijsoma:v:21:y:2015:i:1:p:1-26
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=68699
    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:ijsoma:v:21:y:2015:i:1:p:1-26. 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=150 .

    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.