The exact solution of several classes of inventory-routing problems

Authors:
Leandro C. Coelho;Gilbert Laporte
Affiliations:
CIRRELT and HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7;CIRRELT and HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7
Venue:
Computers and Operations Research
Year:
2013

Citing 13
Cited 1

A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem

Transportation Science
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem

Transportation Science
Omya Hustadmarmor Optimizes Its Supply Chain for Delivering Calcium Carbonate Slurry to European Paper Manufacturers

Interfaces
Territory Planning and Vehicle Dispatching with Driver Learning

Transportation Science
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem

Transportation Science
The Consistent Vehicle Routing Problem

Manufacturing & Service Operations Management
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing

Computers and Operations Research
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem

Computers and Operations Research
Analysis of the maximum level policy in a production-distribution system

Computers and Operations Research
A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem

Transportation Science
The inventory-routing problem with transshipment

Computers and Operations Research
Workforce Management in Periodic Delivery Operations

Transportation Science

Optimal joint replenishment, delivery and inventory management policies for perishable products

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In order to be competitive companies need to take advantage of synergistic interactions between different decision areas. Two of these are related to the distribution and inventory management processes. Inventory-Routing Problems (IRPs) arise when inventory and routing decisions must be made simultaneously, which yields a difficult combinatorial optimization problem. In this paper, we propose a branch-and-cut algorithm for the exact solution of several classes of IRPs. Specifically, we solve the multi-vehicle IRP with a homogeneous and a heterogeneous fleet, the IRP with transshipment options, and the IRP with added consistency features. We perform an extensive computational analysis on benchmark instances.