The exact solution of several classes of inventory-routing problems

DOI10.1016/J.COR.2012.08.012zbMATH Open1349.90016OpenAlexW2050280061MaRDI QIDQ340258FDOQ340258

Leandro C. Coelho, G. Laporte

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.08.012

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

zbMATH Keywords

consistencybranch-and-cutvehicle routinginventory managementinventory-routingmulti-vehicletransshipment

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Cited In (56)

• Classification, models and exact algorithms for multi-compartment delivery problems
• Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
• An iterative matheuristic for the inventory routing problem
• An exact approach for cyclic inbound inventory routing in a level production system
• A mathematical programming-based heuristic for the production routing problem with transshipments
• The production routing problem: a review of formulations and solution algorithms
• An exact solution approach for the inventory routing problem with time windows
• Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
• A branch-and-cut embedded matheuristic for the inventory routing problem
• Inventory routing with pickups and deliveries
• Inventory routing in a warehouse: the storage replenishment routing problem
• Rich vehicle routing problems: from a taxonomy to a definition
• A Matheuristic for the Multivehicle Inventory Routing Problem
• 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
• A concise guide to existing and emerging vehicle routing problem variants
• The multi-objective generalized consistent vehicle routing problem
• Multi-period vehicle routing problem with due dates
• The inventory-routing problem with transshipment
• The inventory routing problem with demand moves
• Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
• 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
• The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
• Formulations for an inventory routing problem
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
• A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
• Heuristics for dynamic and stochastic inventory-routing
• Economic model predictive inventory routing and control
• Optimal joint replenishment, delivery and inventory management policies for perishable products
• Inventory Routing with Explicit Energy Consumption: A Mass-Flow Formulation and First Experimentation
• Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes
• A kernel search heuristic for the multivehicle inventory routing problem
• A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
• An iterative graph expansion approach for the scheduling and routing of airplanes
• Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system
• A matheuristic for solving inventory sharing problems
• Comparison of formulations for the inventory routing problem
• Inventory policy and heuristic for long-term multi-product perishable inventory routing problem with static demand
• GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem
• Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• An inventory-routing problem with the objective of travel time minimization
• Fleet routing position-based model for inventory pickup under production shutdown
• Decomposing inventory routing problems with approximate value functions
• A genetic algorithm for solving the inventory routing problem with time windows
• The two-echelon multi-depot inventory-routing problem
• The dynamic bowser routing problem
• The two-echelon production-routing problem
• The inventory routing problem: the value of integration
• Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
• Optimization of a two-echelon location lot-sizing routing problem with deterministic demand
• A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
• Résolution directe du problème général de distribution
• The inventory routing problem with split deliveries
• On the zero-inventory-ordering policy in the inventory routing problem

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)