A hybrid heuristic for an inventory routing problem

DOI10.1287/IJOC.1100.0439zbMATH Open1460.90009OpenAlexW2121266360MaRDI QIDQ2815432FDOQ2815432

Authors: C. Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza 

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1100.0439

Recommendations

• A matheuristic for the multivehicle inventory routing problem
• Combinatorial heuristics for inventory routing problems
• Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
• A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
• An iterative matheuristic for the inventory routing problem

zbMATH Keywords

optimizationinteger programmingmetaheuristictabu searchinventory routing problem

Mathematics Subject Classification ID

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

Cites Work

• Future paths for integer programming and links to artificial intelligence
• Inventory routing
• Title not available (Why is that?)
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Title not available (Why is that?)
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Title not available (Why is that?)
• A Combined Vehicle Routing and Inventory Allocation Problem
• Deterministic Order-Up-To Level Policies in an Inventory Routing Problem

Cited In (65)

• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
• An iterative matheuristic for the inventory routing problem
• An optimization algorithm for the inventory routing problem with continuous moves
• Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
• A mathematical programming-based heuristic for the production routing problem with transshipments
• Title not available (Why is that?)
• A Combined Vehicle Routing and Inventory Allocation Problem
• Exact solution methods for the multi-period vehicle routing problem with due dates
• An exact solution approach for the inventory routing problem with time windows
• An improved formulation for the inventory routing problem with time-varying demands
• Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands
• A branch-and-cut embedded matheuristic for the inventory routing problem
• Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
• A unified decomposition matheuristic for assembly, production, and inventory routing
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
• Synchronization of inventory and transportation under flexible vehicle constraint: A heuristics approach using sliding windows and hierarchical tree structure
• The inventory-routing problem with transshipment
• A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
• A two-phase solution algorithm for the flexible periodic vehicle routing problem
• An ILP improvement procedure for the open vehicle routing problem
• A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
• Combinatorial heuristics for inventory routing problems
• Formulations for an inventory routing problem
• A two-phase algorithm for the cyclic inventory routing problem
• A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
• Heuristics for dynamic and stochastic inventory-routing
• Economic model predictive inventory routing and control
• A decomposition-based heuristic for the multiple-product inventory-routing problem
• A hybrid heuristic for a stochastic production-inventory-routing problem
• Analysis of the maximum level policy in a production-distribution system
• A kernel search heuristic for the multivehicle inventory routing problem
• Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem
• The consistent production routing problem
• Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system
• A matheuristic for solving inventory sharing problems
• Comparison of formulations for the inventory routing problem
• GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem
• Generalized local branching heuristics and the capacitated ring tree problem
• Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
• A new model and hybrid approach for large scale inventory routing problems
• A matheuristic for the multivehicle inventory routing problem
• A multi-phase heuristic for the production routing problem
• Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
• Iterated local search and simulated annealing algorithms for the inventory routing problem
• An inventory-routing problem with the objective of travel time minimization
• A relax-and-price heuristic for the inventory-location-routing problem
• A matheuristic solution approach for the production routing problem with visit spacing policy
• The two-echelon multi-depot inventory-routing problem
• The dynamic bowser routing problem
• Large scale stochastic inventory routing problems with~split delivery and service level constraints
• A survey on matheuristics for routing problems
• A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics
• Discrete time and continuous time formulations for a short sea inventory routing problem
• The inventory routing problem: the value of integration
• Optimization of a two-echelon location lot-sizing routing problem with deterministic demand
• New benchmark instances for the inventory routing problem
• Adaptive evolutionary algorithms for portfolio selection problems
• Inventory routing with explicit energy consumption: a mass-flow formulation and first experimentation
• A multi-period inventory routing problem with procurement decisions: a case in China
• A new heuristic scheduling method for the make-pack-route problem in make-to-order supply chains
• A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands
• On the zero-inventory-ordering policy in the inventory routing problem
• Title not available (Why is that?)
• Supply chain planning problem considering customer inventory holding cost based on an improved tabu search algorithm

Uses Software

• Tabu search

This page was built for publication: A hybrid heuristic for an inventory routing problem

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