A partition approach to the inventory/routing problem

DOI10.1016/J.EJOR.2005.11.030zbMATH Open1102.90005OpenAlexW1984923898MaRDI QIDQ856272FDOQ856272

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

Recommendations

• An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem
• Inventory routing
• A probabilistic analysis of a fixed partition policy for the inventory-routing problem
• Probabilistic analyses and practical algorithms for inventory-routing models
• Optimal policy of inventory routing problem based on fixed partition

zbMATH Keywords

distribution systemtabu search algorithminventory control and vehicle routing schedulespartition approach

Mathematics Subject Classification ID

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

Cites Work

• The Inventory Benefit of Shipment Coordination and Stock Rebalancing in a Supply Chain
• Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems
• A Generalized Quantity Discount Pricing Model to Increase Supplier's Profits
• Diversification Under Supply Uncertainty
• Coordinated supply chain management
• A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
• Synchronized development of production, inventory, and distribution schedules
• One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
• Title not available (Why is that?)
• Channel Coordination and Quantity Discounts
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• A Location Based Heuristic for General Routing Problems
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Integrating Routing and Inventory Decisions in One-Warehouse Multiretailer Multiproduct Distribution Systems
• Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories
• An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem
• Probabilistic analyses and practical algorithms for inventory-routing models
• Probabilistic analyses and algorithms for three-level distribution systems
• A Class of Euclidean Routing Problems with General Route Cost Functions
• Coordinating Buyer-Seller Transactions Across Multiple Products

Cited In (19)

• An exact approach for cyclic inbound inventory routing in a level production system
• Hybrid algorithm for a vendor managed inventory system in a two-echelon supply chain
• A solution approach to the inventory routing problem in a three-level distribution system
• A probabilistic analysis of a fixed partition policy for the inventory-routing problem
• Modeling and solving a multi-period inventory fulfilling and routing problem for hazardous materials
• Title not available (Why is that?)
• Model and algorithm for inventory/routing decision in a three-echelon logistics system
• A two-phase algorithm for the cyclic inventory routing problem
• An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem
• Performance evaluation of distribution strategies for the inventory routing problem
• On the part inventory model sequencing problem: complexity and beam search heuristic
• Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system
• A branch-and-price algorithm for an integrated production and inventory routing problem
• The integrated production-inventory-distribution-routing problem
• Industrial aspects and literature survey: Combined inventory management and routing
• A blood bank network design problem with integrated facility location, inventory and routing decisions
• A new model and hybrid approach for large scale inventory routing problems
• An inventory-routing problem with the objective of travel time minimization
• Decomposing inventory routing problems with approximate value functions

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

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