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

Nejah Ben Mabrouk, Bassem Jarboui, Mansour Eddaly

Research output: Contribution to journalJournal articlepeer-review

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.

Original languageEnglish
Pages (from-to)484-502
Number of pages19
JournalInternational Journal of Mathematics in Operational Research
Volume18
Issue number4
DOIs
StatePublished - 2021

Keywords

  • Inventory
  • Production planning
  • Variable neighbourhood search
  • Vehicle routing

Fingerprint

Dive into the research topics of 'Solving the joint production distribution problem by the variable neighbourhood search algorithm'. Together they form a unique fingerprint.

Cite this