An Effective Matheuristic for the Multivehicle Inventory Routing Problem

Solyalı, Oguz
Süral, Haldun
Copyright: © 2022 INFORMS.This study considers the multivehicle inventory routing problem in which a supplier has to build a distribution plan over a discrete time horizon to replenish a set of customers that faces a given demand. Transportation costs as well as inventory costs at the supplier and at the customers are to be minimized. A matheuristic algorithm is proposed that is based on sequentially solving different mixed integer linear programs. The algorithm merges the advantage of being easy to design and implement, as it is mainly based on the problem formulation, with the benefit of providing high-quality solutions. A computational study is performed on benchmark test instances by comparing the results with the ones obtained from previous algorithms proposed in the literature. The results show that the matheuristic algorithm outperforms the existing heuristic algorithms and finds a significant number of new best solutions in both small and large instances.
Transportation Science


A multi-phase heuristic for the production routing problem
Solyali, Oguz; Süral, Haldun (2017-11-01)
This study considers the production routing problem where a plant produces and distributes a single item to multiple retailers over a multi-period time horizon. The problem is to decide on when and how much to produce and stock at the plant, when and how much to serve and stock at each retailer, and vehicle routes for shipments such that the sum of fixed production setup cost, variable production cost, distribution cost, and inventory carrying cost at the plant and retailers is minimized. A multi-phase heur...
A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem
Solyali, Oguz; Süral, Haldun (2011-08-01)
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 v...
Robust Inventory Routing Under Demand Uncertainty
Solyali, Oguz; Cordeau, Jean-Francois; Laporte, Gilbert (2012-08-01)
This paper introduces a robust inventory routing problem where a supplier distributes a single product to multiple customers facing dynamic uncertain demands over a finite discrete time horizon. The probability distribution of the uncertain demand at each customer is not fully specified. The only available information is that these demands are independent and symmetric random variables that can take some value from their support interval. The supplier is responsible for the inventory management of its custo...
An Approach for introducing a set of domain specific components
Yiğit, İbrahim Onuralp; Doğru, Ali Hikmet; Department of Computer Engineering (2015)
In this thesis, a preliminary methodology is proposed for the determination of a set of components to populate the domain model of a Software Product Line infrastructure. Software Product Line based approaches focus on the reusability of assets for a family of software products. For effective reuse, the definition of reusable assets in this thesis considers variability in a domain. The approach is based on variability specifications that is rooted in Feature Models and is reflected to a component modeling n...
An analysis of benefits of inventory and service pooling and information sharing in spare parts management systems
Satır, Benhür; Savaşaneril Tüfekci, Seçil; Serin, Yaşar Yasemin; Department of Industrial Engineering (2010)
Inventory management and production control problem of a dealer operating in a decentralized spare parts network is analyzed in this dissertation. Spare parts network is assumed to be formed of two dealers and the problem of a dealer is considered under the assumption that the other dealer has a known policy. These dealers collaborate through inventory and service pooling. Furthermore, the dealers collaborate through sharing information on the net inventory status. Upon demand arrival, a dealer may request ...
Citation Formats
O. Solyalı and H. Süral, “An Effective Matheuristic for the Multivehicle Inventory Routing Problem,” Transportation Science, vol. 56, no. 4, pp. 1044–1057, 2022, Accessed: 00, 2022. [Online]. Available: