Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes

DOI10.1016/J.COR.2021.105686MaRDI QIDQ2669743zbMATH OpenOpenAlexFDO

Authors Felipe Lagos, Natashia Boland, Martin W. P. Savelsbergh

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.105686

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Perspectives on integer programming for time-dependent models
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
• The Continuous-Time Service Network Design Problem
• Discrete time and continuous time formulations for a short sea inventory routing problem
• Inventory routing with continuous moves

Cites work

• scientific article; zbMATH DE number 1749231 (Why is no real title available?)
• scientific article; zbMATH DE number 1452995 (Why is no real title available?)
• Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times
• Decomposition of a combined inventory and time constrained ship routing problem
• Exact solution methods for the multi-period vehicle routing problem with due dates
• Inventory routing
• Iterated local search and simulated annealing algorithms for the inventory routing problem
• On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
• Optimizing multiship routing and scheduling with constraints on inventory levels in a Brazilian oil company
• Performance evaluation of distribution strategies for the inventory routing problem
• Perspectives on integer programming for time-dependent models
• Rejoinder to “A Note on Bounds for Direct Shipping Costs”
• The Continuous-Time Service Network Design Problem
• The Stochastic Inventory Routing Problem with Direct Deliveries
• The exact solution of several classes of inventory-routing problems

Cited in

(2)

• Scalable timing-aware network design via Lagrangian decomposition
• Stochastic inventory routing with dynamic demands and intra-day depletion

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes

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