A novel mixed-integer linear programming formulation for continuous-time inventory routing

DOI10.1016/J.COR.2024.106883MaRDI QIDQ6975869zbMATH OpenFDO

Authors Akang Wang, Jeffrey E. Arbogast, Zachary A. Wilson, Chrysanthos E. Gounaris

Publication date 4 June 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106883

zbMATH Keywords

branch-and-cutcontinuous-time inventory routinginventory managementrounded capacity inequalitiesvehicle routing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch and bound algorithm for the capacitated vehicle routing problem
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Benchmarking optimization software with performance profiles.
• Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes
• scientific article; zbMATH DE number 1830744 (Why is no real title available?)
• Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries
• Path inequalities for the vehicle routing problem with time windows
• Separating capacity constraints in the CVRP using tabu search
• The exact solution of several classes of inventory-routing problems
• The vehicle routing problem

Cited in

(3)

• Towards an unsupervised learning scheme for efficiently solving parameterized mixed-integer programs
• A branch-price-and-cut algorithm for sustainable milk-run vehicle scheduling problem with cross-dimensional integration
• Inventory-routing problems: review, challenges, and innovations

This page was built for publication: A novel mixed-integer linear programming formulation for continuous-time inventory routing

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