Inventory Routing Problem (IRP)
Decide replenishment and routing together, not separately. The inventory routing problem jointly optimizes when and how much to deliver to each customer and how to route vehicles over a planning horizon, capturing the trade-off that scheduling in one area constrains the other.
Solve Inventory Routing →What is the Inventory Routing Problem?
The inventory routing problem (IRP) integrates two decisions that are usually made separately: inventory replenishment (when and how much to deliver to each customer) and vehicle routing (how to sequence deliveries efficiently). It optimizes both together over a planning horizon, typically to minimize the combined cost of transportation and inventory.
The IRP arises in vendor-managed inventory, where a supplier decides the replenishment schedule for its customers rather than waiting for them to order. This freedom is what makes joint optimization possible and valuable: the supplier can time and size deliveries to build efficient routes, smoothing demand across days and combining nearby customers into shared trips.
This integration is the source of both its power and its difficulty. Because inventory decisions and routing decisions interact across multiple time periods, the IRP is substantially harder than either the pure inventory problem or the pure vehicle routing problem. It is typically solved with heuristics for realistic sizes, but the joint approach yields savings that optimizing the two decisions separately cannot.
In plain terms: Normally you decide inventory (when to restock each customer) and routing (which truck goes where) separately. The IRP does them together, because they affect each other: if you can choose when to deliver, you can group nearby customers on the same day and build cheaper routes. It's powerful but hard, so it usually uses smart approximations.
Key Ideas
Joint Decisions
Replenishment timing and quantity plus vehicle routing are optimized together over a horizon, not in isolation.
Vendor-Managed Inventory
The supplier controls the replenishment schedule, which is what enables timing deliveries to build efficient routes.
Combined Cost
Minimizes transportation plus inventory cost, capturing the trade-off between delivery frequency and stock held.
Key Formulas
Why Joint Optimization Pays
Solving inventory and routing separately misses their interaction. If deliveries can be timed freely, the supplier can consolidate nearby customers on the same day and level the delivery workload across the horizon, producing cheaper routes than a fixed replenishment schedule would allow.
The trade-off the IRP balances is delivery frequency against inventory: delivering more often builds smaller, more flexible routes but raises transport cost and handling, while delivering less often lowers transport cost but requires customers to hold more stock. The joint optimization finds the combination that minimizes total cost.
Assumptions & Validation
Supplier-Controlled Replenishment
The supplier decides delivery timing and quantities (VMI).
If violated: Without replenishment control, the joint optimization is not available.
Known Demand & Capacities
Customer demand rates and vehicle capacities are known.
If violated: Estimate demand and capacity over the horizon.
Defined Horizon
A planning horizon over multiple periods is set.
If violated: Choose a horizon long enough to capture the trade-offs.
⚠️ Check assumptions first
The IRP's value depends on the supplier controlling replenishment timing, as in vendor-managed inventory; without that freedom, routing must fit a fixed delivery schedule and the joint benefit largely disappears. The problem is also considerably harder than either inventory or routing alone, so realistic instances are solved heuristically rather than to proven optimality. Its inputs, demand rates, capacities and the planning horizon, must be characterized well for the solution to hold up.
When NOT to Use Inventory Routing Problem (IRP)
Routing Only
When replenishment quantities are fixed and only routes matter, use the vehicle routing problem.
Inventory Only
When routing is not a decision, use inventory models such as EOQ and reorder point.
Network Positioning
To position stock across supply-chain stages, use multi-echelon optimization.
Industry Applications
Vendor-Managed Inventory
Let a supplier plan replenishment and routing jointly for its customers.
Fuel & Gas Distribution
Schedule and route tanker deliveries to avoid run-outs at minimum cost, a classic IRP domain.
Retail Replenishment
Coordinate store replenishment timing with delivery routing.
Supply-Chain Cost Reduction
Cut combined inventory and transport cost through integrated planning.
Frequently Asked Questions
What is the inventory routing problem?
The inventory routing problem integrates inventory replenishment decisions, when and how much to deliver to each customer, with vehicle routing decisions, how to sequence deliveries, optimizing both together over a planning horizon. It typically minimizes the combined cost of transportation and inventory. By deciding these jointly rather than separately, it captures the interaction between delivery scheduling and route efficiency that separate optimization misses.
How does the IRP differ from the vehicle routing problem?
The vehicle routing problem takes the deliveries to be made as given and finds efficient routes for them. The inventory routing problem additionally decides when and how much to deliver to each customer over time, so replenishment scheduling becomes part of the optimization. This makes the IRP a superset of vehicle routing, integrating inventory control with routing rather than treating the deliveries as fixed inputs.
What is vendor-managed inventory and how does it relate to the IRP?
Vendor-managed inventory is an arrangement in which the supplier decides the replenishment schedule for its customers rather than waiting for them to place orders. This control over delivery timing is precisely what enables the joint optimization of the inventory routing problem, because the supplier can time and size deliveries to build efficient routes. The IRP is the natural optimization problem underlying vendor-managed inventory.
Why is the inventory routing problem so difficult?
The difficulty comes from the interaction of inventory and routing decisions across multiple time periods. Each period's routing depends on what was delivered before and what must be delivered later to avoid stockouts, so the decisions are coupled over time as well as across customers. This combination makes the IRP substantially harder than either the pure inventory problem or the pure vehicle routing problem, so realistic instances are solved with heuristics.
What trade-off does the IRP balance?
The IRP balances delivery frequency against inventory holding. Delivering to customers more often keeps their inventory low but increases transportation cost and handling, while delivering less often reduces transport cost but requires customers to hold more stock. By optimizing timing, quantities and routes jointly, the IRP finds the delivery pattern that minimizes the combined transportation and inventory cost across the horizon.
Where is the inventory routing problem applied?
A classic application is the distribution of industrial gases and fuel, where a supplier must keep many customers' tanks from running out while routing tankers efficiently. Other applications include vendor-managed retail replenishment, where store deliveries are scheduled and routed together, and any distribution setting where a supplier controls replenishment timing. In these domains, integrated inventory and routing planning yields savings unavailable from separate optimization.
Optimize Replenishment and Routing Together
Solve the inventory routing problem for lower combined cost. Free during Beta.
Solve Inventory Routing →