Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/10368
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAghazadeh, Duygu-
dc.contributor.authorErtogral, Kadir-
dc.date.accessioned2023-04-16T10:01:19Z-
dc.date.available2023-04-16T10:01:19Z-
dc.date.issued2022-
dc.identifier.issn2405-8963-
dc.identifier.urihttps://doi.org/10.1016/j.ifacol.2022.10.194-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/10368-
dc.description10th IFAC Conference on Manufacturing Modelling, Management and Control, MIM 2022 -- 22 June 2022 through 24 June 2022 -- 148818en_US
dc.description.abstractIn this paper we propose an Improved Approximate Dynamic Programming approach for the integrated fleet sizing and replenishment planning problem utilizing fix and optimize heuristic. The problem is about deciding both the composition of a fleet for distributing a single item and the replenishment planning based on a predetermined delivery frequency. This problem integrates two important logistical issues namely fleet sizing and replenishment planning. The objective is minimizing all relevant costs composed of vehicle ownership, inventory, and approximate routing costs. We show the effectiveness of the proposed solution method on a set of fairly large size randomly generated problem instances. Copyright © 2022 The Authors. This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0/)en_US
dc.language.isoenen_US
dc.publisherElsevier B.V.en_US
dc.relation.ispartofIFAC-PapersOnLineen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectApproximate Dynamic Programmingen_US
dc.subjectFixen_US
dc.subjectFleet sizingen_US
dc.subjectoptimizeen_US
dc.subjectReplenishment planningen_US
dc.subjectFleet operationsen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectApproximate dynamic programmingen_US
dc.subjectDelivery frequencyen_US
dc.subjectDynamic programming methodsen_US
dc.subjectFixen_US
dc.subjectFix-and-optimise heuristicen_US
dc.subjectFleet sizingen_US
dc.subjectOptimizeen_US
dc.subjectPlanning problemen_US
dc.subjectReplenishment planningen_US
dc.subjectVehicle ownershipen_US
dc.subjectDynamic programmingen_US
dc.titleAn Improved Approximate Dynamic Programming Method for The Integrated Fleet Sizing and Replenishment Planning Problem with Predetermined Delivery Frequenciesen_US
dc.typeConference Objecten_US
dc.departmentTOBB ETÜen_US
dc.identifier.volume55en_US
dc.identifier.issue10en_US
dc.identifier.startpage3034en_US
dc.identifier.endpage3039en_US
dc.identifier.wosWOS:000881681700457en_US
dc.identifier.scopus2-s2.0-85144502371en_US
dc.institutionauthor-
dc.identifier.doi10.1016/j.ifacol.2022.10.194-
dc.authorscopusid58025431100-
dc.authorscopusid6506300862-
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.identifier.scopusquality--
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeConference Object-
item.languageiso639-1en-
crisitem.author.dept02.4. Department of Industrial Engineering-
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record



CORE Recommender

Page view(s)

42
checked on Sep 30, 2024

Google ScholarTM

Check




Altmetric


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