A general variable neighbourhood search for the multi-product inventory routing problem

Autor: Bassem Jarboui, Jelena Mladenović, Anis Mjirda, Christophe Wilbaut, Saïd Hanafi
Přispěvatelé: Université de Sfax - University of Sfax, Université de Bordeaux (UB), Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 (LAMIH), Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Centre National de la Recherche Scientifique (CNRS)-INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France)
Jazyk: angličtina
Rok vydání: 2016
Předmět:
Zdroj: IMA Journal of Management Mathematics
IMA Journal of Management Mathematics, Oxford University Press (OUP), 2016, 27 (1), pp.39-54. ⟨10.1093/imaman/dpu020⟩
ISSN: 1471-678X
1471-6798
DOI: 10.1093/imaman/dpu020⟩
Popis: International audience; The inventory routing problem (IRP) deals with the study of the inter-relationship between two important activities in the supply chain: transportation of commodities and inventory management. In this paper, we study a variant of the multi-product IRP and we propose a general variable neighbourhood search metaheuristic for solving it. We present several neighbourhood structures based on the movement of quantities between routes and periods. Computational experiments show the efficiency of the proposed metaheuristic when compared with the state-of-the-art based on variable neighbourhood search.
Databáze: OpenAIRE