A branch-and-cut embedded matheuristic for the inventory routing problem
From MaRDI portal
Publication:6047912
DOI10.1016/j.cor.2023.106353OpenAlexW4384562773MaRDI QIDQ6047912
Jørgen Skålnes, Magnus Stålhane, Simen Tung Vadseth, Henrik Andersson
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106353
Cites Work
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- An iterated local search heuristic for the split delivery vehicle routing problem
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
- A branch and bound algorithm for the capacitated vehicle routing problem
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Vehicle routing with split deliveries
- Efficiently solving very large-scale routing problems
- New exact solution approaches for the split delivery vehicle routing problem
- New benchmark instances for the capacitated vehicle routing problem
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- Comparison of formulations for the inventory routing problem
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
- An iterative matheuristic for the inventory routing problem
- A matheuristic for solving inventory sharing problems
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- An improved formulation for the inventory routing problem with time-varying demands
- A Hybrid Heuristic for an Inventory Routing Problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Split delivery routing
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- The Split Delivery Vehicle Routing Problem: A Survey
- Savings by Split Delivery Routing
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- A Matheuristic for the Multivehicle Inventory Routing Problem
- Iterated local search and simulated annealing algorithms for the inventory routing problem
- Particle Swarm Optimization for Split Delivery Vehicle Routing Problem
- Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- A column generation approach for the split delivery vehicle routing problem
- A column generation approach for the split delivery vehicle routing problem
This page was built for publication: A branch-and-cut embedded matheuristic for the inventory routing problem
