A matheuristic for solving inventory sharing problems
From MaRDI portal
Publication:2669710
DOI10.1016/J.COR.2021.105605OpenAlexW3208359873MaRDI QIDQ2669710FDOQ2669710
Authors: Fatima Ezzahra Achamrah, Fouad Riane, Christine Di Martinelly, S. Limbourg 
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105605
Recommendations
- A matheuristic for the multivehicle inventory routing problem
- An iterative matheuristic for the inventory routing problem
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- The two-echelon multi-depot inventory-routing problem
- A hybrid heuristic for an inventory routing problem
Cites Work
- The inventory-routing problem with transshipment
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
- Lot sizing with carbon emission constraints
- Ship routing and scheduling in the new millennium
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The exact solution of several classes of inventory-routing problems
- Title not available (Why is that?)
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- A new decision rule for lateral transshipments in inventory systems
- An inventory sharing and allocation method for a multi-location service parts logistics network with time-based service levels
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- A hybrid heuristic for an inventory routing problem
- The dynamic transshipment problem
- A column-generation based tactical planning method for inventory routing
- A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
- Sharing and lateral transshipment of inventory in a supply chain with expensive low-demand items
- Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
- The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search
- A VNS approach to multi-location inventory redistribution with vehicle routing
- Clustering model and algorithm for production inventory and distribution problem
- Optimal joint replenishment and transshipment policies in a multi-period inventory system with lost sales
- Inventory routing with pickups and deliveries
- The two-echelon inventory-routing problem with fleet management
Cited In (3)
Uses Software
This page was built for publication: A matheuristic for solving inventory sharing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669710)
