Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/2979
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDastjerd, Niousha Karimi-
dc.contributor.authorErtoğral, Kadir-
dc.date.accessioned2019-12-26T14:47:03Z-
dc.date.available2019-12-26T14:47:03Z-
dc.date.issued2019
dc.identifier.citationDastjerd, N. K., & Ertogral, K. (2019). A fix-and-optimize heuristic for the integrated fleet sizing and replenishment planning problem with predetermined delivery frequencies. Computers & Industrial Engineering, 127, 778-787.en_US
dc.identifier.issn0360-8352
dc.identifier.urihttps://hdl.handle.net/20.500.11851/2979-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0360835218305540?via%3Dihub-
dc.identifier.urihttps://doi.org/10.1016/j.cie.2018.11.014-
dc.description.abstractIn this study, we tackle an integrated fleet sizing and replenishment planning problem in a vendor managed inventory system. There is a set of customers whose inventory must be replenished using a given set of predetermined frequencies for visits, and the customers have deterministic and constant demand. The vehicle fleet consists of multiple types of vehicles that differ in carrying capacity, cost per kilometer, and ownership costs. The main decision we need to make in this problem is the triple assignment of vehicle-frequency-customer. As a result of these assignment decisions, we obtain the annual total cost, which consists of vehicle ownership cost, routing cost, inventory holding, and fixed replenishment costs. A key simplification in the model is the use of linear approximation for the routing cost based on the number of customers visited in a route. The developed model in this study, which is new in the literature, integrates fleet sizing and replenishment planning decisions. We showed that our problem is NP-hard. In order to solve large problems efficiently, we proposed two versions of a fix and optimize type heuristic; with and without a moving sub problem window. We showed the effectiveness of the suggested heuristic solution procedure on a large set of randomly generated problems.en_US
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.relation.ispartofComputers and Industrial Engineeringen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectLogistics; Fleet sizingen_US
dc.subjectreplenishment planningen_US
dc.subjectfix and optimizeen_US
dc.subjectpredetermined frequenciesen_US
dc.titleA fix-and-optimize heuristic for the integrated fleet sizing and replenishment planning problem with predetermined delivery frequenciesen_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.volume127
dc.identifier.startpage778
dc.identifier.endpage787
dc.identifier.wosWOS:000460708800059en_US
dc.identifier.scopus2-s2.0-85056667366en_US
dc.institutionauthorErtoğral, Kadir-
dc.contributor.YOKid143559-
dc.identifier.doi10.1016/j.cic.2018.11.014-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ1-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
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

WEB OF SCIENCETM
Citations

2
checked on Sep 24, 2022

Page view(s)

22
checked on Dec 5, 2022

Google ScholarTM

Check

Altmetric


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