Uporedite metode

	Problem usklađivanja zaliha i ruta (Inventory Routing Problem - IRP)	Unakrsno pretovarivanje (Cross-Docking)
Oblast	Upravljanje operacijama	Upravljanje operacijama
Porodica	Machine learning	Machine learning
Godina nastanka	2014	2007
Tvorac	Coelho, L. C., Cordeau, J. F., & Laporte, G.	Gue, K. R.
Tip	Optimization problem	Warehouse operation strategy
Temeljni izvor	Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014). Thirty years of inventory routing. Transportation Research Part B: Methodological, 55, 28-67.	Apuzzio, M. (2008). Essentials of supply chain management. New Jersey: Pearson Education.
Drugi nazivi	IRP, vendor-managed logistics	—
Srodne	5	5
Sažetak	The Inventory Routing Problem (IRP) is an optimization problem that jointly determines inventory levels at customer locations, delivery routes, and shipment quantities to minimize total logistics and inventory holding costs. Rather than treating inventory management and vehicle routing as separate decisions, IRP recognizes that they are interdependent: larger shipments reduce routing costs but increase inventory holding costs, and vice versa. IRP is solved using mixed-integer programming, heuristics, and metaheuristics, and is a cornerstone of vendor-managed inventory (VMI) programs.	Cross-docking is a logistics strategy in which products arriving at a distribution center from suppliers are unloaded, sorted, consolidated, and immediately reloaded onto outbound vehicles destined for customers, with minimal or no storage time. Rather than storing inventory in a warehouse, products flow through in 24–48 hours. Cross-docking reduces inventory holding costs, improves product freshness, and increases throughput of the distribution network. It is widely used in fast-moving consumer goods, parcel delivery, and retail supply chains.