Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/1599
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ekici, Ali | - |
dc.contributor.author | Özener, Okan Orsan | - |
dc.contributor.author | Kuyzu, Gültekin | - |
dc.date.accessioned | 2019-07-03T14:44:47Z | |
dc.date.available | 2019-07-03T14:44:47Z | |
dc.date.issued | 2015-11 | |
dc.identifier.citation | Ekici, A., Özener, O. Ö., & Kuyzu, G. (2014). Cyclic delivery schedules for an inventory routing problem. Transportation Science, 49(4), 817-829. | en_US |
dc.identifier.issn | 0041-1655 | |
dc.identifier.uri | https://pubsonline.informs.org/doi/10.1287/trsc.2014.0538 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/1599 | - |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Informs | en_US |
dc.relation.ispartof | Transportation Science | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | inventory routing problem | en_US |
dc.subject | iterative clustering | en_US |
dc.subject | cyclic delivery schedules | en_US |
dc.subject | heuristic algorithm | en_US |
dc.title | Cyclic Delivery Schedules for an Inventory Routing Problem | en_US |
dc.type | Article | en_US |
dc.department | Faculties, Faculty of Engineering, Department of Industrial Engineering | en_US |
dc.department | Fakülteler, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü | tr_TR |
dc.identifier.volume | 49 | |
dc.identifier.issue | 4 | |
dc.identifier.startpage | 817 | |
dc.identifier.endpage | 829 | |
dc.authorid | 0000-0002-1997-306X | - |
dc.identifier.wos | WOS:000365048900008 | en_US |
dc.identifier.scopus | 2-s2.0-84946012734 | en_US |
dc.institutionauthor | Kuyzu, Gültekin | - |
dc.identifier.doi | 10.1287/trsc.2014.0538 | - |
dc.authorscopusid | 14834070300 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q1 | - |
item.openairetype | Article | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.4. Department of Industrial Engineering | - |
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 |
CORE Recommender
SCOPUSTM
Citations
22
checked on Dec 21, 2024
WEB OF SCIENCETM
Citations
23
checked on Nov 9, 2024
Page view(s)
90
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.