Robust optimization approaches for the perishable product inventory routing problem with demand uncertainty

DOI10.3934/JIMO.2024024MaRDI QIDQ6574060

Kun Liu, Zhichao He, Ya Liu

Publication date: 18 July 2024

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

zbMATH Keywords

robust optimizationiterated local searchinventory routing problemperishable productbenders decomposition

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05) Robustness in mathematical programming (90C17)

Cites Work

• Title not available (Why is that?)
• A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods
• Stochastic production routing problem for perishable products: modeling and a solution algorithm
• The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: two robust bi-objective models
• Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
• The Price of Robustness
• An Allocation and Distribution Model for Perishable Products
• An Integrated Inventory Allocation and Vehicle Routing Problem

This page was built for publication: Robust optimization approaches for the perishable product inventory routing problem with demand uncertainty

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