A variable neighborhood search for the multi-product inventory routing problem

DOI10.1016/J.ENDM.2012.10.013MaRDI QIDQ2840757zbMATH OpenOpenAlexFDO

Authors Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi

Publication date 23 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

inventorymetaheuristicroutingVNS

Mathematics Subject Classification ID

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

Recommendations

• A two phase variable neighborhood search for the multi-product inventory routing problem
• A general variable neighbourhood search for the multi-product inventory routing problem
• GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
• A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
• A decomposition-based heuristic for the multiple-product inventory-routing problem

Cites work

• Delivery strategies for blood products supplies
• Inventory routing with continuous moves
• Variable neighborhood search
• Variable neighbourhood search: Methods and applications
• Variable neighbourhood search: methods and applications

Cited in

(11)

• Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
• A variable neighborhood decomposition search method for supply chain management planning problems
• Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
• Local search based metaheuristics for two-echelon distribution network with perishable products
• A general variable neighbourhood search for the multi-product inventory routing problem
• A two phase variable neighborhood search for the multi-product inventory routing problem
• Solving the joint production distribution problem by the variable neighbourhood search algorithm
• General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain
• GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem
• GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
• Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems

This page was built for publication: A variable neighborhood search for the multi-product inventory routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840757)