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

Nejah Ben Mabrouk, Bassem Jarboui and Mansour Eddaly

International Journal of Mathematics in Operational Research, 2021, vol. 18, issue 4, 484-502

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.

Keywords: production planning; vehicle routing; inventory; variable neighbourhood search. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=114202 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:18:y:2021:i:4:p:484-502

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().