Inventory routing with pickups and deliveries

DOI10.1016/J.EJOR.2018.01.010zbMATH Open1403.90076OpenAlexW2783647323MaRDI QIDQ1754327FDOQ1754327

Xianqiang Yang

Publication date: 30 May 2018

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

Full work available at URL: http://hdl.handle.net/11250/2490974

zbMATH Keywords

routingvalid inequalitiesinventory routingpickup and delivery problems

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Cites Work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Routing problems with loading constraints
• A survey of recent research on location-routing problems
• The production routing problem: a review of formulations and solution algorithms
• Coordination of production and distribution planning
• Industrial aspects and literature survey: Combined inventory management and routing
• 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
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A survey of variants and extensions of the location-routing problem
• Decomposition of a combined inventory and time constrained ship routing problem
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Arc Routing
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• A maritime inventory routing problem: discrete time formulations and valid inequalities
• A branch-price-and-cut algorithm for single-product maritime inventory routing
• Heuristics for dynamic and stochastic inventory-routing
• A Matheuristic for the Multivehicle Inventory Routing Problem
• Editorial: Integrated vehicle routing problems
• A decomposition-based heuristic for the multiple-product inventory-routing problem
• Formulations for an inventory routing problem
• Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
• Fleet routing position-based model for inventory pickup under production shutdown
• The inventory routing problem: the value of integration
• The value of integrating loading and routing

Cited In (8)

• Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries
• Optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network of railway terminal
• An improved formulation for the inventory routing problem with time-varying demands
• Title not available (Why is that?)
• A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
• A branch-and-cut algorithm for an assembly routing problem
• A matheuristic for solving inventory sharing problems
• Modeling and solving the two-level generalized median tour problem

This page was built for publication: Inventory routing with pickups and deliveries

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