Optimal policy of inventory routing problem based on fixed partition

MaRDI QIDQ3571352zbMATH OpenFDO

Authors Fei Xi, Yongwu Zhou

Publication date 8 July 2010

zbMATH Keywords

inventory routing problempartition problemreplenishment interval

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35)

Recommendations

• A partition approach to the inventory/routing problem
• Study on the inventory routing problem based on different replenishment interval strategy
• A probabilistic analysis of a fixed partition policy for the inventory-routing problem
• An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem
• Integrated inventory-routing problem for the logistics distribution planning of chain enterprise

Cited in

(8)

• Application of parallel nested genetic algorithm in centralized inventory routing problem
• A coordination model for decentralized inventory routing problem based on transfer payment
• A new policy for the inventory routing problem
• Study on the inventory routing problem based on different replenishment interval strategy
• Optimal division of inventory between depot and bases
• An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem
• A partition approach to the inventory/routing problem
• Model and algorithm for inventory/routing decision in a three-echelon logistics system

This page was built for publication: Optimal policy of inventory routing problem based on fixed partition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3571352)