An exact solution approach for the inventory routing problem with time windows
From MaRDI portal
Publication:2669489
DOI10.1016/J.COR.2021.105371OpenAlexW3167751710MaRDI QIDQ2669489FDOQ2669489
Authors: Gizem Özbaygın Tiniç, Esra Koca, Hande Yaman 
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.105371
Recommendations
- The exact solution of several classes of inventory-routing problems
- An improved formulation for the inventory routing problem with time-varying demands
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
- Inventory routing with pickups and deliveries
Cites Work
- JGraphT—A Java Library for Graph Data Structures and Algorithms
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- New route relaxation and pricing strategies for the vehicle routing problem
- Efficient elementary and restricted non-elementary route pricing
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
- The exact solution of several classes of inventory-routing problems
- Inventory routing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Decomposition of a combined inventory and time constrained ship routing problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A hybrid heuristic for an inventory routing problem
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- A branch-and-price approach for a multi-period vehicle routing problem
- Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
- Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances
- Alternative Inventory and Distribution Policies of a Food Manufacturer
- Formulations for an inventory routing problem
- Exact algorithms for electric vehicle-routing problems with time windows
- The vehicle routing problem with service level constraints
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- Advanced Methods and Applications in Computational Intelligence
Cited In (7)
- An assign-and-route matheuristic for the time-dependent inventory routing problem
- An improved formulation for the inventory routing problem with time-varying demands
- The exact solution of several classes of inventory-routing problems
- Integrated inventory routing problem with quality time windows and loading cost for deteriorating items under discrete time
- A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
- A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows
- An inventory-routing problem with the objective of travel time minimization
Uses Software
This page was built for publication: An exact solution approach for the inventory routing problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669489)
