Model and algorithm for inventory/routing decision in a three-echelon logistics system

DOI10.1016/J.EJOR.2006.12.056zbMath1160.90326OpenAlexW1978092895MaRDI QIDQ932178

B. E. Eshmatov

Publication date: 10 July 2008

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

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

zbMATH Keywords

variable neighborhood search (VNS)fixed partition and power-of-two (FP-POT) strategyinventory and routing decisionthree-echelon logistics systemvariable large neighborhood search (VLNS)

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05) Traffic problems in operations research (90B20)

Related Items (15)

The two-echelon multi-depot inventory-routing problem ⋮ Hybrid algorithm for a vendor managed inventory system in a two-echelon supply chain ⋮ Stochastic inventory routing with time-based shipment consolidation ⋮ Modeling and solving a multi-period inventory fulfilling and routing problem for hazardous materials ⋮ A two-echelon inventory routing problem for perishable products ⋮ Spare parts inventory routing problem with transshipment and substitutions under stochastic demands ⋮ A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints ⋮ The warehouse-inventory-transportation problem for supply chains ⋮ A solution approach to the inventory routing problem in a three-level distribution system ⋮ Variable neighbourhood search: methods and applications ⋮ 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 ⋮ Variable neighbourhood search: Methods and applications ⋮ A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars ⋮ Performance evaluation of distribution strategies for the inventory routing problem

Cites Work

• Unnamed Item
• Unnamed Item
• A partition approach to the inventory/routing problem
• Variable neighborhood search
• A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints
• An integrated inventory-transportation system with modified periodic policy for multiple products
• The traveling salesman problem with backhauls
• Near-Optimal Echelon-Stock (R, nQ) Policies in Multistage Serial Systems
• Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
• A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
• Synchronized Development of Production, Inventory, and Distribution Schedules
• 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 Heuristic for the Periodic Vehicle Routing Problem
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Integrating Routing and Inventory Decisions in One-Warehouse Multiretailer Multiproduct Distribution Systems
• Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
• The Stochastic Inventory Routing Problem with Direct Deliveries
• Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
• A Location Based Heuristic for General Routing Problems
• Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories
• A Periodic Inventory Routing Problem at a Supermarket Chain
• A Class of Euclidean Routing Problems with General Route Cost Functions
• Variable neighborhood search: Principles and applications

This page was built for publication: Model and algorithm for inventory/routing decision in a three-echelon logistics system