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

DOI10.1287/OPRE.45.1.102MaRDI QIDQ4367268zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

heuristicsnonpolynomial dynamic programone warehouse multiretailer distribution problemsubmodular approximationssubmodular functiontraveling salesmanvehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

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

Cited in

(18)

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

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)