A Matheuristic for the Multivehicle Inventory Routing Problem
From MaRDI portal
Publication:4599309
DOI10.1287/ijoc.2016.0737zbMath1386.90013OpenAlexW2612126268MaRDI QIDQ4599309
No author found.
Publication date: 29 December 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2016.0737
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (28)
Inventory routing in a warehouse: the storage replenishment routing problem ⋮ Stochastic production routing problem for perishable products: modeling and a solution algorithm ⋮ Comparison of formulations for the inventory routing problem ⋮ Combinatorial Heuristics for Inventory Routing Problems ⋮ The two-echelon inventory-routing problem with fleet management ⋮ A matheuristic for the air transportation freight forwarder service problem ⋮ An iterative matheuristic for the inventory routing problem ⋮ An improved formulation for the inventory routing problem with time-varying demands ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ A branch-and-cut embedded matheuristic for the inventory routing problem ⋮ Complexity of inventory routing problems when routing is easy ⋮ A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics ⋮ Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery ⋮ On the zero-inventory-ordering policy in the inventory routing problem ⋮ A kernel search heuristic for the multivehicle inventory routing problem ⋮ A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows ⋮ The inventory routing problem with split deliveries ⋮ A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing ⋮ Comparing sequential and integrated approaches for the production routing problem ⋮ Inventory routing with pickups and deliveries ⋮ Exact solution methods for the multi-period vehicle routing problem with due dates ⋮ A matheuristic algorithm for stochastic home health care planning ⋮ Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation ⋮ Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products ⋮ The inventory routing problem: the value of integration ⋮ Analysis of effective sets of routes for the split-delivery periodic inventory routing problem ⋮ Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs ⋮ Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery
Cites Work
- A decomposition-based heuristic for the multiple-product inventory-routing problem
- The exact solution of several classes of inventory-routing problems
- Analysis of the maximum level policy in a production-distribution system
- The inventory-routing problem with transshipment
- Alternative formulations for a layout problem in the fashion industry
- A Hybrid Heuristic for an Inventory Routing Problem
- Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Improving Discrete Model Representations via Symmetry Considerations
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Formulations for an inventory routing problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A Matheuristic for the Multivehicle Inventory Routing Problem
