Please use this identifier to cite or link to this item:
Title: Cyclic Delivery Schedules for an Inventory Routing Problem
Authors: Ekici, Ali
Özener, Okan Orsan
Kuyzu, Gültekin
Keywords: inventory routing problem
iterative clustering
cyclic delivery schedules
heuristic algorithm
Issue Date: Nov-2015
Publisher: Informs
Source: Ekici, A., Özener, O. Ö., & Kuyzu, G. (2014). Cyclic delivery schedules for an inventory routing problem. Transportation Science, 49(4), 817-829.
Abstract: We consider an inventory routing problem where a common vendor is responsible for replenishing the inventories of several customers over a perpetual time horizon. The objective of the vendor is to minimize the total cost of transportation of a single product from a single depot to a set of customers with deterministic and stationary consumption rates over a planning horizon while avoiding stock-outs at the customer locations. We focus on constructing a repeatable (cyclic) delivery schedule for the product delivery. We propose a novel algorithm, called the Iterative Clustering-Based Constructive Heuristic Algorithm, to solve the problem in two stages: (i) clustering, and (ii) delivery schedule generation. To test the performance of the proposed algorithm in terms of solution quality and computational efficiency, we perform a computational study on both randomly generated instances and real-life instances provided by an industrial gases manufacturer. We also compare the performance of the proposed algorithm against an algorithm developed for general routing problems.
ISSN: 0041-1655
Appears in Collections:Endüstri Mühendisliği Bölümü / Department of Industrial Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender


checked on Dec 29, 2022


checked on Sep 24, 2022

Page view(s)

checked on Dec 26, 2022

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.