Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
From MaRDI portal
Publication:2333123
DOI10.1016/j.cor.2019.07.009zbMath1458.90047OpenAlexW2969572631WikidataQ127338961 ScholiaQ127338961MaRDI QIDQ2333123
Huaizhu Oliver Gao, Faisal Alkaabneh, Ali H. Diabat
Publication date: 11 November 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.07.009
Benders decompositionperishable productsinventory-routinglast mile logisticsfood/agriculture supply chainGRASP meta-heuristic
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items
Stochastic production routing problem for perishable products: modeling and a solution algorithm, Modeling and optimizing an agro-supply chain considering different quality grades and storage systems for fresh products: a Benders decomposition solution approach, Lateral inventory share-based models for IoT-enabled e-commerce sustainable food supply networks, Supplier selection problem for multiple projects with uncertain demand and project life cycles, Eco-routing problem for the delivery of perishable products, Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19, A multi-stage stochastic programming approach for an inventory–routing problem considering life cycle, A decentralized production–distribution scheduling problem: Solution and analysis, An integrated method for hybrid distribution with estimation of demand matching degree, Simultaneous cooperation of refrigerated ground vehicle (RGV) and unmanned aerial vehicle (UAV) for rapid delivery with perishable food, An assign-and-route matheuristic for the time-dependent inventory routing problem
Cites Work
- Unnamed Item
- Optimal joint replenishment, delivery and inventory management policies for perishable products
- The exact solution of several classes of inventory-routing problems
- Supply chain network operations management of a blood banking system with cost and risk minimization
- A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
- Vendor managed inventory for environments with stochastic product usage
- A probabilistic heuristic for a computationally difficult set covering problem
- Partitioning procedures for solving mixed-variables programming problems
- Modeling a green inventory routing problem for perishable products with horizontal collaboration
- The Benders decomposition algorithm: a literature review
- An integrated inventory-transportation system with modified periodic policy for multiple products
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Competitive food supply chain networks with application to fresh produce
- A stochastic programming approach for supply chain network design under uncertainty
- Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Combinatorial Benders' Cuts for the Strip Packing Problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Benders Decomposition for Production Routing Under Demand Uncertainty
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Minimizing Transportation and Inventory Costs for Several Products on a Single Link
- A Matheuristic for the Multivehicle Inventory Routing Problem
- A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
