An optimization algorithm for the inventory routing problem with continuous moves

DOI10.1016/J.COR.2006.10.020zbMath1179.90021OpenAlexW1981544375MaRDI QIDQ2468483

Jin-Hwa Song, Savelsbergh, Martin W. P.

Publication date: 23 January 2008

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

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

zbMATH Keywords

branch-and-cutinventory routingdelivery cover inequalities

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Inventory, storage, reservoirs (90B05)

Related Items (21)

The mixed capacitated general routing problem under uncertainty ⋮ A two phase variable neighborhood search for the multi-product inventory routing problem ⋮ The production routing problem: a review of formulations and solution algorithms ⋮ Modeling a green inventory routing problem for perishable products with horizontal collaboration ⋮ Maritime inventory routing: recent trends and future directions ⋮ Mixed integer linear programming model for multi-commodity multi-depot inventory routing problem ⋮ Integrated inventory routing problem with quality time windows and loading cost for deteriorating items under discrete time ⋮ A tabu search procedure for coordinating production, inventory and distribution routing problems ⋮ Optimization model for a production, inventory, distribution and routing problem in small furniture companies ⋮ Selective and periodic inventory routing problem for waste vegetable oil collection ⋮ MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results ⋮ Industrial aspects and literature survey: Combined inventory management and routing ⋮ A branch-and-price algorithm for an integrated production and inventory routing problem ⋮ Optimal inventory level control and replenishment plan for retailers ⋮ Decomposing inventory routing problems with approximate value functions ⋮ A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries ⋮ A survey on matheuristics for routing problems ⋮ A maritime inventory routing problem: Discrete time formulations and valid inequalities ⋮ A new ant colony optimization algorithm to solve the periodic capacitated arc routing problem with continuous moves ⋮ A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts ⋮ A heuristic algorithm for the free newspaper delivery problem

Uses Software

• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inventory routing with continuous moves
• Planning models for freight transportation
• On the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
• A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
• One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
• On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
• Global optimization using special ordered sets
• The Stochastic Inventory Routing Problem with Direct Deliveries
• A Location Based Heuristic for General Routing Problems
• A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
• A Price-Directed Approach to Stochastic Inventory/Routing
• A Periodic Inventory Routing Problem at a Supermarket Chain

This page was built for publication: An optimization algorithm for the inventory routing problem with continuous moves