IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v9y2015i4p325-336.html
   My bibliography  Save this article

Simulation-based optimization for a capacitated multi-echelon production-inventory system

Author

Listed:
  • M Güller
  • Y Uygun
  • B Noche

Abstract

One of the most important aspects affecting the performance of a supply chain is the management of inventories. Managing inventory in complex supply chains is typically difficult, and may have a significant impact on the customer service level and system-wide costs. The main challenge of inventory management is that almost every inventory problem involves multiple and conflicting objectives that need to be optimized simultaneously. In this paper, we present an efficient way using simulation-based optimization approach to determine the optimal inventory control parameters of a multi-echelon production-inventory system under a stochastic environment. The Pareto dominance concept is implemented to find a set of near optimal solutions for determining the best trade-off between objectives. The Multi-objective Particle Swarm Optimization (MOPSO) algorithm is used to determine the appropriate inventory control parameters to minimize the total inventory cost and maximize the service level. To evaluate the control parameters generated by the MOPSO, an object-oriented framework for developing the simulation model is presented. Finally, we provide a real-world case study of a major food product supply chain to demonstrate the use of proposed approach and enable decision making at inventory management. The proposed algorithm is compared with existing multi-objective genetic algorithm (NSGA-II).

Suggested Citation

  • M Güller & Y Uygun & B Noche, 2015. "Simulation-based optimization for a capacitated multi-echelon production-inventory system," Journal of Simulation, Taylor & Francis Journals, vol. 9(4), pages 325-336, November.
  • Handle: RePEc:taf:tjsmxx:v:9:y:2015:i:4:p:325-336
    DOI: 10.1057/jos.2015.5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/jos.2015.5
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/jos.2015.5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjsmxx:v:9:y:2015:i:4:p:325-336. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    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.