Combinatorial heuristics for inventory routing problems

DOI10.1287/IJOC.2021.1064zbMATH Open1492.90022OpenAlexW3195186175MaRDI QIDQ5084657FDOQ5084657

Authors: Ziye Tang, Yang Jiao, R. Ravi 

Publication date: 28 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2021.1064

Recommendations

• A hybrid heuristic for an inventory routing problem
• A matheuristic for the multivehicle inventory routing problem
• Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
• Scenario tree-based heuristics for stochastic inventory-routing problems
• A column-generation based tactical planning method for inventory routing

zbMATH Keywords

heuristicslarge neighborhood searchinventory routing problemprize-collecting Steiner tree

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Cites Work

• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Validation of subgradient optimization
• A General Approximation Technique for Constrained Forest Problems
• Incorporating inventory and routing costs in strategic location models
• Computational complexity of uncapacitated multi-echelon production planning problems
• The inventory-routing problem with transshipment
• A constant approximation algorithm for the one-warehouse multiretailer problem
• Primal-Dual Algorithms for Deterministic Inventory Problems
• A note on the prize collecting traveling salesman problem
• A new model and hybrid approach for large scale inventory routing problems
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
• Distribution Strategies that Minimize Transportation and Inventory Costs
• Title not available (Why is that?)
• Approximation algorithms for inventory problems with submodular or routing costs
• Better Approximation Bounds for the Joint Replenishment Problem
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• A hybrid heuristic for an inventory routing problem
• A matheuristic for the multivehicle inventory routing problem
• An Integrated Inventory Allocation and Vehicle Routing Problem
• Formulations for an inventory routing problem
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Probabilistic analyses and practical algorithms for inventory-routing models
• Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
• Title not available (Why is that?)
• A Survey of Lagrangean Techniques for Discrete Optimization
• APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
• A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
• Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem

Cited In (9)

• A hybrid heuristic for an inventory routing problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A column-generation based tactical planning method for inventory routing
• A Combined Vehicle Routing and Inventory Allocation Problem
• Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19
• Comparison of formulations for the inventory routing problem
• A matheuristic for the multivehicle inventory routing problem
• A relax-and-price heuristic for the inventory-location-routing problem

Uses Software

• Concorde

This page was built for publication: Combinatorial heuristics for inventory routing problems

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