Inventory Routing
From MaRDI portal
Publication:3564349
DOI10.1007/978-0-387-77778-8_3zbMath1187.90039OpenAlexW4214946404MaRDI QIDQ3564349
Luca Bertazzi, Savelsbergh, Martin W. P., Maria Grazia Speranza
Publication date: 2 June 2010
Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_3
Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items
Rich vehicle routing problems: from a taxonomy to a definition, Cyclic inventory routing in a line-shaped network, Delivery pattern and transportation planning in grocery retailing, A two-phase algorithm for the cyclic inventory routing problem, Heuristics for dynamic and stochastic inventory-routing, A decomposition-based heuristic for the multiple-product inventory-routing problem, Multi-period vehicle routing problem with due dates, Modeling a green inventory routing problem for perishable products with horizontal collaboration, Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework, Medical waste collection considering transportation and storage risk, Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands, An exact solution approach for the inventory routing problem with time windows, Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes, Complexity of inventory routing problems when routing is easy, A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows, The inventory routing problem with split deliveries, The dynamic bowser routing problem, Vehicle routing problems with multiple trips, An integrated model for production and distribution planning of perishable products with inventory and routing considerations, Analysis of the best double frequency policy in the single link problem with discrete shipping times, A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing, A two-echelon inventory routing problem for perishable products, Vehicle routing problems with multiple trips, Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries, Collaborative vehicle routing: a survey, Vehicle routing problems with split deliveries, Analysis of the maximum level policy in a production-distribution system, Industrial aspects and literature survey: Combined inventory management and routing, Objectives and methods in multi-objective routing problems: a survey and classification scheme, Simulation-based evolution of resupply and routing policies in rich vendor-managed inventory scenarios, Economic model predictive inventory routing and control, A survey on matheuristics for routing problems, A stochastic inventory routing problem for infectious medical waste collection, The inventory routing problem: the value of integration, A Hybrid Heuristic for an Inventory Routing Problem, The Humanitarian Pickup and Distribution Problem, A three-phase matheuristic for the packaging and shipping problem, Shared resources in collaborative vehicle routing, Formulations for an inventory routing problem, Vendor managed inventory for environments with stochastic product usage, A heuristic algorithm for the free newspaper delivery problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inventory routing with continuous moves
- Period and phase of customer replenishment: A new approach to the strategic inventory/routing problem
- The general multi-retailer EOQ problem with vehicle routing costs
- Vehicle minimization for periodic deliveries
- Minimizing the total cost in an integrated vendor-managed inventory system
- Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
- A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
- Probabilistic Analyses and Algorithms for Three-Level Distribution Systems
- Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
- Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies
- Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times
- A Combined Vehicle Routing and Inventory Allocation Problem
- One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
- On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
- Analysis of practical policies for a single link distribution system
- Distribution Strategies that Minimize Transportation and Inventory Costs
- An Integrated Inventory Allocation and Vehicle Routing Problem
- A Note on Bounds for Direct Shipping Cost
- Stochastic Inventory Routing: Route Design with Stockouts and Route Failures
- Minimizing Transportation and Inventory Costs for Several Products on a Single Link
- Integrating Routing and Inventory Decisions in One-Warehouse Multiretailer Multiproduct Distribution Systems
- Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds
- Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
- Continuous and Discrete Shipping Strategies for the Single Link Problem
- Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming
- The Stochastic Inventory Routing Problem with Direct Deliveries
- Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
- Rejoinder to “A Note on Bounds for Direct Shipping Costs”
- Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem
- Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories
- A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
- A Price-Directed Approach to Stochastic Inventory/Routing
- A Periodic Inventory Routing Problem at a Supermarket Chain
- An algorithm for optimal shipments with given frequencies
