A hybrid heuristic based on iterated local search for multivehicle inventory routing problem

DOI10.1016/J.ENDM.2016.03.026MaRDI QIDQ325440zbMATH OpenOpenAlexFDO

Authors Edcarllos Santos, L. Simonetti, Pedro Henrique González, Luiz S. Ochi

Publication date 18 October 2016

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

zbMATH Keywords

hybrid metaheuristicsiterated local searchmultivehicle inventory routing problem

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 hybrid heuristic for an inventory routing problem
• A kernel search heuristic for the multivehicle inventory routing problem
• An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
• An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
• A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem
• GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
• A model and two heuristic methods for the multi-product inventory-location-routing problem with heterogeneous fleet

Cites work

• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• The exact solution of several classes of inventory-routing problems

Cited in

(26)

• Solving inventory routing problems using location based heuristics
• An iterative matheuristic for the inventory routing problem
• An optimization algorithm for the inventory routing problem with continuous moves
• A hybrid heuristic for an inventory routing problem
• An iterated local search matheuristic approach for the multi-vehicle inventory routing problem
• New mathematical model for the bi-objective inventory routing problem with a step cost function: a multi-objective particle swarm optimization solution approach
• Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time
• Inventory routing in a warehouse: the storage replenishment routing problem
• An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
• The inventory routing problem with split deliveries
• A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
• 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
• A hybrid genetic search for the inventory routing problem
• A hybrid fix-and-optimize heuristic for integrated inventory-transportation problem in a multi-region multi-facility supply chain
• A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost
• On the zero-inventory-ordering policy in the inventory routing problem
• A kernel search heuristic for the multivehicle inventory routing problem
• A matheuristic for solving inventory sharing problems
• A variable neighborhood search for the multi-product inventory routing problem
• Comparison of formulations for the inventory routing problem
• 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
• Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
• A matheuristic for the multivehicle inventory routing problem
• Iterated local search and simulated annealing algorithms for the inventory routing problem

This page was built for publication: A hybrid heuristic based on iterated local search for multivehicle inventory routing problem

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