Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation

DOI10.1016/j.ejor.2020.08.047zbMath1487.90036OpenAlexW3082043861MaRDI QIDQ2029903

Eleftherios Manousakis, Emmanouil E. Zachariadis, Christos D. Tarantilis, Panagiotis P. Repoussis

Publication date: 4 June 2021

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

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

zbMATH Keywords

transportationbranch-and-cutinventory routingcut separationtwo-commodity flow

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

Comparison of formulations for the inventory routing problem ⋮ An iterative matheuristic for the inventory routing problem ⋮ An exact solution approach for the inventory routing problem with time windows ⋮ An improved formulation for the inventory routing problem with time-varying demands ⋮ A branch-and-cut embedded matheuristic for the inventory routing problem ⋮ On the zero-inventory-ordering policy in the inventory routing problem ⋮ 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 ⋮ The inventory routing problem with split deliveries ⋮ An infeasible space exploring matheuristic for the production routing problem ⋮ A genetic algorithm for solving the inventory routing problem with time windows ⋮ A shortfall modelling-based solution approach for stochastic cyclic inventory routing

Uses Software

• VRP
• MAXFLOW
• CVRPSP
• Julia
• JuMP

Cites Work

• An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
• The exact solution of several classes of inventory-routing problems
• Analysis of the maximum level policy in a production-distribution system
• Facet identification for the symmetric traveling salesman polytope
• Performance evaluation of distribution strategies for the inventory routing problem
• Vendor managed inventory for environments with stochastic product usage
• Separating capacity constraints in the CVRP using tabu search
• Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
• The inventory-routing problem with transshipment
• A computational comparison of flow formulations for the capacitated location-routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Industrial aspects and literature survey: Combined inventory management and routing
• A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
• A memetic algorithm with dynamic population management for an integrated production-distribution problem
• Projection results for vehicle routing
• The Vehicle Routing Problem
• A maritime inventory routing problem: Discrete time formulations and valid inequalities
• The inventory routing problem: the value of integration
• A Hybrid Heuristic for an Inventory Routing Problem
• A Column-Generation Based Tactical Planning Method for Inventory Routing
• Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
• Julia: A Fresh Approach to Numerical Computing
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Matheuristic for the Multivehicle Inventory Routing Problem
• Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
• Formulations for an inventory routing problem
• A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• A Periodic Inventory Routing Problem at a Supermarket Chain
• JuMP: A Modeling Language for Mathematical Optimization

This page was built for publication: Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation