An iterative matheuristic for the inventory routing problem
From MaRDI portal
Publication:2668692
Recommendations
- A matheuristic for the multivehicle inventory routing problem
- A hybrid heuristic for an inventory routing problem
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
Cites work
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A hybrid heuristic for an inventory routing problem
- A matheuristic for the multivehicle inventory routing problem
- A survey on matheuristics for routing problems
- A unified decomposition matheuristic for assembly, production, and inventory routing
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- Industrial aspects and literature survey: Combined inventory management and routing
- Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem
- The exact solution of several classes of inventory-routing problems
- The inventory-routing problem with transshipment
- The two-echelon inventory-routing problem with fleet management
Cited in
(23)- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
- Comparison of formulations for the inventory routing problem
- A matheuristic for solving inventory sharing problems
- An improved formulation for the inventory routing problem with time-varying demands
- A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics
- A hybrid heuristic for an inventory routing problem
- Decomposing inventory routing problems with approximate value functions
- An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem
- A matheuristic for the multivehicle inventory routing problem
- On an iterative procedure for solving a routing problem with constraints
- A branch-and-cut embedded matheuristic for the inventory routing problem
- A multi-period inventory routing problem with procurement decisions: a case in China
- The inventory routing problem with split deliveries
- Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network
- New benchmark instances for the inventory routing problem
- A multi-start local search matheuristic for the capacitated arc routing problem with irregular services
- A matheuristic for the two-echelon inventory-routing problem
- An iterated local search matheuristic approach for the multi-vehicle inventory routing problem
- Fleet repositioning in the tramp ship routing and scheduling problem with bunker optimization: a matheuristic solution approach
- A column generation heuristic for the dynamic bicycle rebalancing problem
- Contemporary approaches in matheuristics an updated survey
- A hybrid genetic search for the inventory routing problem
- Inventory-routing problems: review, challenges, and innovations
This page was built for publication: An iterative matheuristic for the inventory routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668692)