A kernel search heuristic for the multivehicle inventory routing problem
From MaRDI portal
Cites work
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- A hybrid heuristic for an inventory routing problem
- A kernel search heuristic for a fair facility location problem
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- A matheuristic for the multivehicle inventory routing problem
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- A unified decomposition matheuristic for assembly, production, and inventory routing
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Formulations for an inventory routing problem
- Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
- Iterated local search and simulated annealing algorithms for the inventory routing problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Mixed integer linear programming for feature selection in support vector machine
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- The exact solution of several classes of inventory-routing problems
- The inventory routing problem: the value of integration
- Worst case analysis of relax and fix heuristics for lot-sizing problems
Cited in
(10)- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- An inventory hub location model for multi‐coal‐fired coastal power plants: a case study in Guangdong district
- The inventory routing problem with split deliveries
- New benchmark instances for the inventory routing problem
- Matheuristic algorithms for the inventory routing problem with unsplit and split deliveries
- A matheuristic for the two-echelon inventory-routing problem
- An iterated local search matheuristic approach for the multi-vehicle inventory routing problem
- Augmented patterns for decomposition of scheduling and assignment problems
- Large neighborhood and hybrid genetic search for inventory routing problems
- A hybrid genetic search for the inventory routing problem
This page was built for publication: A kernel search heuristic for the multivehicle inventory routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092539)
