A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries

DOI10.1016/j.ejor.2019.09.056zbMath1431.90002OpenAlexW2978593108WikidataQ127179491 ScholiaQ127179491MaRDI QIDQ2286875

Yanyan Li

Publication date: 23 January 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.09.056

zbMATH Keywords

branch-and-cutroutinginventory managementpickups and deliverieslot-sizing reformulation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Related Items

A matheuristic for solving inventory sharing problems, An improved formulation for the inventory routing problem with time-varying demands, An exact criterion space search algorithm for a bi-objective blood collection problem, The inventory routing problem with split deliveries, Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation

Cites Work

• Lifted and local reachability cuts for the vehicle routing problem with time windows
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• Inventory routing with continuous moves
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
• Inventory routing with pickups and deliveries
• Economic model predictive inventory routing and control
• Mixed integer linear programming model for multi-commodity multi-depot inventory routing problem
• Ship routing and scheduling in the new millennium
• Fleet routing position-based model for inventory pickup under production shutdown
• Reachability cuts for the vehicle routing problem with time windows
• An optimization algorithm for the inventory routing problem with continuous moves
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
• A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances