Comparison of formulations for the inventory routing problem

DOI10.1016/J.EJOR.2021.12.051MaRDI QIDQ2160484zbMATH OpenOpenAlexFDO

Authors Ivana Ljubić, C. Archetti

Publication date 3 August 2022

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

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

zbMATH Keywords

routinginventory routinglinear programming relaxationpolyhedral projectionaggregated formulation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Formulations for an inventory routing problem
• Performance evaluation of distribution strategies for the inventory routing problem
• Combinatorial heuristics for inventory routing problems
• An iterative matheuristic for the inventory routing problem
• The exact solution of several classes of inventory-routing problems
• scientific article; zbMATH DE number 956789
• An improved formulation for the inventory routing problem with time-varying demands
• A hybrid heuristic for an inventory routing problem
• An Integrated Inventory Allocation and Vehicle Routing Problem

Cites work

• scientific article; zbMATH DE number 3156381 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
• A hybrid heuristic for an inventory routing problem
• A matheuristic for the multivehicle inventory routing problem
• A result on projection for the vehicle routing problem
• A unified decomposition matheuristic for assembly, production, and inventory routing
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Formulations for an inventory routing problem
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
• Iterated local search and simulated annealing algorithms for the inventory routing problem
• Multistars and directed flow formulations
• Network flows. Theory, algorithms, and applications.
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
• Projection results for vehicle routing
• Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• The exact solution of several classes of inventory-routing problems
• The inventory routing problem: the value of integration

Cited in

(8)

• A branch-and-cut embedded matheuristic for the inventory routing problem
• Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network
• New benchmark instances for the inventory routing problem
• Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
• The inventory routing problem with split deliveries
• The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem
• An exact criterion space search algorithm for a bi-objective blood collection problem
• A computational comparison of flow formulations for the capacitated location-routing problem

This page was built for publication: Comparison of formulations for the inventory routing problem

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