IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v18y2021i4p484-502.html
   My bibliography  Save this article

Solving the joint production distribution problem by the variable neighbourhood search algorithm

Author

Listed:
  • Nejah Ben Mabrouk
  • Bassem Jarboui
  • Mansour Eddaly

Abstract

This paper addressed the dynamic integrated production routing problem where the objective is to minimise the total cost including production, inventory and distribution. Since this problem is NP-hard, we developed a variable neighbourhood search algorithm (VNS) to solve it. Therefore, two VNS algorithms were proposed: the first one is used to determine the produced quantity of each day and the second aims to determine the routing map. Insert and swap moves were used in the local search step. The obtained results showed the effectiveness of our proposed approach according to previous works, including greedy heuristic and memetic algorithm, in the literature.

Suggested Citation

  • Nejah Ben Mabrouk & Bassem Jarboui & Mansour Eddaly, 2021. "Solving the joint production distribution problem by the variable neighbourhood search algorithm," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 18(4), pages 484-502.
    • Handle: RePEc:ids:ijmore:v:18:y:2021:i:4:p:484-502
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=114202
    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:ijmore:v:18:y:2021:i:4:p:484-502. 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=320 .

    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.