GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem

DOI10.1016/j.endm.2017.03.010zbMath1387.90031OpenAlexW2607493116MaRDI QIDQ1687640

Said Toumi, Anis Mjirda, Samia Hasni, Bassem Jarboui

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.010

zbMATH Keywords

routinginventory managementgeneral variable neighborhood search

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Cites Work

• Variable neighborhood search
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• A general variable neighbourhood search for the multi-product inventory routing problem

This page was built for publication: GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem