The exact solution of several classes of inventory-routing problems
From MaRDI portal
Recommendations
- An exact solution approach for the inventory routing problem with time windows
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- Inventory routing
- A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
Cited in
(66)- Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes
- Résolution directe du problème général de distribution
- On the zero-inventory-ordering policy in the inventory routing problem
- The inventory routing problem with split deliveries
- Inventory routing with explicit energy consumption: a mass-flow formulation and first experimentation
- Solving inventory routing problems using location based heuristics
- An exact solution approach for the inventory routing problem with time windows
- Fleet routing position-based model for inventory pickup under production shutdown
- A branch-and-cut embedded matheuristic for the inventory routing problem
- The vehicle routing problem with floating targets: formulation and solution approaches
- An improved formulation for the inventory routing problem with time-varying demands
- The biobjective inventory routing problem -- problem solution and decision support
- A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
- Complexity of inventory routing problems when routing is easy
- The inventory routing problem: the value of integration
- The two-echelon production-routing problem
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
- A mathematical programming-based heuristic for the production routing problem with transshipments
- A matheuristic for the multivehicle inventory routing problem
- A genetic algorithm for solving the inventory routing problem with time windows
- An iterative matheuristic for the inventory routing problem
- A matheuristic for solving inventory sharing problems
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- Optimal inventory level control and replenishment plan for retailers
- The inventory routing problem with demand moves
- Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
- The two-echelon inventory-routing problem with fleet management
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
- Inventory routing in a warehouse: the storage replenishment routing problem
- A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
- Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
- Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
- Decomposing inventory routing problems with approximate value functions
- An exact approach for cyclic inbound inventory routing in a level production system
- The two-echelon multi-depot inventory-routing problem
- Optimization of a two-echelon location lot-sizing routing problem with deterministic demand
- The production routing problem: a review of formulations and solution algorithms
- Comparison of formulations for the inventory routing problem
- A unified decomposition matheuristic for assembly, production, and inventory routing
- Inventory routing
- The dynamic bowser routing problem
- Formulations for an inventory routing problem
- A concise guide to existing and emerging vehicle routing problem variants
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- The multi-objective generalized consistent vehicle routing problem
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- Economic model predictive inventory routing and control
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem
- An iterative graph expansion approach for the scheduling and routing of airplanes
- Optimal joint replenishment, delivery and inventory management policies for perishable products
- A column-generation based tactical planning method for inventory routing
- Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system
- Multi-period vehicle routing problem with due dates
- An inventory-routing problem with the objective of travel time minimization
- Heuristics for dynamic and stochastic inventory-routing
- The inventory-routing problem with transshipment
- A maritime inventory routing problem: practical approach
- Inventory policy and heuristic for long-term multi-product perishable inventory routing problem with static demand
- Inventory routing with pickups and deliveries
- Rich vehicle routing problems: from a taxonomy to a definition
- Classification, models and exact algorithms for multi-compartment delivery problems
- A kernel search heuristic for the multivehicle inventory routing problem
- Inventory routing problems: a logistical overview
This page was built for publication: The exact solution of several classes of inventory-routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340258)
