A partition approach to the inventory/routing problem

DOI10.1016/j.ejor.2005.11.030zbMath1102.90005OpenAlexW1984923898MaRDI QIDQ856272

N. E. Zubov

Publication date: 7 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.030

zbMATH Keywords

distribution systemtabu search algorithminventory control and vehicle routing schedulespartition approach

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)

Related Items (14)

Hybrid algorithm for a vendor managed inventory system in a two-echelon supply chain ⋮ A two-phase algorithm for the cyclic inventory routing problem ⋮ Modeling and solving a multi-period inventory fulfilling and routing problem for hazardous materials ⋮ Model and algorithm for inventory/routing decision in a three-echelon logistics system ⋮ A new model and hybrid approach for large scale inventory routing problems ⋮ A blood bank network design problem with integrated facility location, inventory and routing decisions ⋮ A solution approach to the inventory routing problem in a three-level distribution system ⋮ The integrated production-inventory-distribution-routing problem ⋮ Industrial aspects and literature survey: Combined inventory management and routing ⋮ A branch-and-price algorithm for an integrated production and inventory routing problem ⋮ Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system ⋮ An inventory-routing problem with the objective of travel time minimization ⋮ An exact approach for cyclic inbound inventory routing in a level production system ⋮ Performance evaluation of distribution strategies for the inventory routing problem

Cites Work

• Unnamed Item
• An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem
• Coordinated supply chain management
• A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
• Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
• Synchronized Development of Production, Inventory, and Distribution Schedules
• Probabilistic Analyses and Algorithms for Three-Level Distribution Systems
• The Inventory Benefit of Shipment Coordination and Stock Rebalancing in a Supply Chain
• Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems
• One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• A Generalized Quantity Discount Pricing Model to Increase Supplier's Profits
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Diversification Under Supply Uncertainty
• Coordinating Buyer-Seller Transactions Across Multiple Products
• Integrating Routing and Inventory Decisions in One-Warehouse Multiretailer Multiproduct Distribution Systems
• Channel Coordination and Quantity Discounts
• A Location Based Heuristic for General Routing Problems
• Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories
• A Class of Euclidean Routing Problems with General Route Cost Functions

This page was built for publication: A partition approach to the inventory/routing problem