Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds

DOI10.1287/OPRE.45.1.102zbMATH Open0892.90062OpenAlexW2068830719MaRDI QIDQ4367268FDOQ4367268

Yale T. Herer, Robin Roundy

Publication date: 25 November 1997

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/8799

Recommendations

• Approximation Procedures for the One-Warehouse Multi-Retailer System
• One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
• Integrating Routing and Inventory Decisions in One-Warehouse Multiretailer Multiproduct Distribution Systems
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems

zbMATH Keywords

heuristicssubmodular functionvehicle routingtraveling salesmannonpolynomial dynamic programone warehouse multiretailer distribution problemsubmodular approximations

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cited In (15)

• Bounds, Heuristics, and Approximations for Distribution Systems
• Multi-item dynamic production-distribution planning in process industries with divergent finishing stages
• Approximation Procedures for the One-Warehouse Multi-Retailer System
• Submodularity and the traveling salesman problem
• Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints
• The submodular joint replenishment problem
• Coordination mechanisms of supply chain systems
• Naturally submodular digraphs and forbidden digraph configurations
• An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem
• Inventory routing
• A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
• Industrial aspects and literature survey: Combined inventory management and routing
• Modeling and optimization of inventory-distribution routing problem for agriculture products supply chain
• Stochastic inventory routing with dynamic demands and intra-day depletion
• A heuristic approach for solving serially distributed storage depots under power-of-two policy

This page was built for publication: Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds

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