Solving the joint production distribution problem by the variable neighbourhood search algorithm
by Nejah Ben Mabrouk; Bassem Jarboui; Mansour Eddaly
International Journal of Mathematics in Operational Research (IJMOR), Vol. 18, No. 4, 2021

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.

Online publication date: Tue, 13-Apr-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com