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

Oğuz Solyalı () and Haldun Süral ()
Additional contact information
Oğuz Solyalı: Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey
Haldun Süral: Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey

Transportation Science, 2011, vol. 45, issue 3, 335-345

Abstract: We address a vendor-managed inventory-routing problem where a supplier (vendor) receives a given amount of a single product each period and distributes it to multiple retailers over a finite time horizon using a capacitated vehicle. Each retailer faces external dynamic demand and is controlled by a deterministic order-up-to level policy requiring that the supplier raise the retailer's inventory level to a predetermined maximum in each replenishment. The problem is deciding on when and in what sequence to visit the retailers such that systemwide inventory holding and routing costs are minimized. We propose a branch-and-cut algorithm and a heuristic based on an a priori tour using a strong formulation. To the best of our knowledge, this study is the first to consider a strong formulation for the inventory replenishment part of inventory-routing problems. Computational results reveal that the new branch-and-cut algorithm and heuristic perform better than those noted in the literature.

Keywords: supply chain management; inventory-routing problem; branch-and-cut; integer programming; heuristics (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1100.0354 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:45:y:2011:i:3:p:335-345

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().