IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v61y2023i15p5134-5155.html
   My bibliography  Save this article

Parameterisation of demand-driven material requirements planning: a multi-objective genetic algorithm

Author

Listed:
  • David Damand
  • Youssef Lahrichi
  • Marc Barth

Abstract

Demand-Driven Material Requirements Planning (DDMRP) is a recent inventory management method that has generated considerable interest in both academia and industry. Many recent papers have demonstrated the superiority of DDMRP over classical methods like MRP or Kanban, an observation confirmed by companies that have implemented DDMRP. However, DDMRP depends on many parameters that affect its performance. Only general rules are given by the authors of the method to fix these parameters but no algorithm. The present paper aims to fill this gap by proposing a multi-objective optimisation algorithm to fix a set of eight identified parameters. The suggested genetic algorithm is coupled with a simulation algorithm that computes the objective functions. Two opposing objective functions are considered: first, the maximisation of orders delivered on-time to the customer and, second, the minimisation of on-hand inventory. A set of data instances was generated to test the suggested method. Fronts of non-dominated solutions are found for all these instances.

Suggested Citation

  • David Damand & Youssef Lahrichi & Marc Barth, 2023. "Parameterisation of demand-driven material requirements planning: a multi-objective genetic algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 61(15), pages 5134-5155, August.
    • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:15:p:5134-5155
    DOI: 10.1080/00207543.2022.2098074
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2098074
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2022.2098074?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:tprsxx:v:61:y:2023:i:15:p:5134-5155. 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/TPRS20 .

    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.