Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/1599
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEkici, Ali-
dc.contributor.authorÖzener, Okan Orsan-
dc.contributor.authorKuyzu, Gültekin-
dc.date.accessioned2019-07-03T14:44:47Z
dc.date.available2019-07-03T14:44:47Z
dc.date.issued2015-11
dc.identifier.citationEkici, A., Özener, O. Ö., & Kuyzu, G. (2014). Cyclic delivery schedules for an inventory routing problem. Transportation Science, 49(4), 817-829.en_US
dc.identifier.issn0041-1655
dc.identifier.urihttps://pubsonline.informs.org/doi/10.1287/trsc.2014.0538-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/1599-
dc.description.abstractWe 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.isoenen_US
dc.publisherInformsen_US
dc.relation.ispartofTransportation Scienceen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectinventory routing problemen_US
dc.subjectiterative clusteringen_US
dc.subjectcyclic delivery schedulesen_US
dc.subjectheuristic algorithmen_US
dc.titleCyclic Delivery Schedules for an Inventory Routing Problemen_US
dc.typeArticleen_US
dc.departmentFaculties, Faculty of Engineering, Department of Industrial Engineeringen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümütr_TR
dc.identifier.volume49
dc.identifier.issue4
dc.identifier.startpage817
dc.identifier.endpage829
dc.authorid0000-0002-1997-306X-
dc.identifier.wosWOS:000365048900008en_US
dc.identifier.scopus2-s2.0-84946012734en_US
dc.institutionauthorKuyzu, Gültekin-
dc.identifier.doi10.1287/trsc.2014.0538-
dc.authorscopusid14834070300-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ1-
item.openairetypeArticle-
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.dept02.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
Show simple item record



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 16, 2024

Google ScholarTM

Check




Altmetric


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