Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/10368
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Aghazadeh, Duygu | - |
dc.contributor.author | Ertogral, Kadir | - |
dc.date.accessioned | 2023-04-16T10:01:19Z | - |
dc.date.available | 2023-04-16T10:01:19Z | - |
dc.date.issued | 2022 | - |
dc.identifier.issn | 2405-8963 | - |
dc.identifier.uri | https://doi.org/10.1016/j.ifacol.2022.10.194 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/10368 | - |
dc.description | 10th IFAC Conference on Manufacturing Modelling, Management and Control, MIM 2022 -- 22 June 2022 through 24 June 2022 -- 148818 | en_US |
dc.description.abstract | In 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.iso | en | en_US |
dc.publisher | Elsevier B.V. | en_US |
dc.relation.ispartof | IFAC-PapersOnLine | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Approximate Dynamic Programming | en_US |
dc.subject | Fix | en_US |
dc.subject | Fleet sizing | en_US |
dc.subject | optimize | en_US |
dc.subject | Replenishment planning | en_US |
dc.subject | Fleet operations | en_US |
dc.subject | Heuristic algorithms | en_US |
dc.subject | Approximate dynamic programming | en_US |
dc.subject | Delivery frequency | en_US |
dc.subject | Dynamic programming methods | en_US |
dc.subject | Fix | en_US |
dc.subject | Fix-and-optimise heuristic | en_US |
dc.subject | Fleet sizing | en_US |
dc.subject | Optimize | en_US |
dc.subject | Planning problem | en_US |
dc.subject | Replenishment planning | en_US |
dc.subject | Vehicle ownership | en_US |
dc.subject | Dynamic programming | en_US |
dc.title | An Improved Approximate Dynamic Programming Method for the Integrated Fleet Sizing and Replenishment Planning Problem With Predetermined Delivery Frequencies | en_US |
dc.type | Conference Object | en_US |
dc.department | TOBB ETÜ | en_US |
dc.identifier.volume | 55 | en_US |
dc.identifier.issue | 10 | en_US |
dc.identifier.startpage | 3034 | en_US |
dc.identifier.endpage | 3039 | en_US |
dc.identifier.wos | WOS:000881681700457 | en_US |
dc.identifier.scopus | 2-s2.0-85144502371 | en_US |
dc.institutionauthor | … | - |
dc.identifier.doi | 10.1016/j.ifacol.2022.10.194 | - |
dc.authorscopusid | 58025431100 | - |
dc.authorscopusid | 6506300862 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | - | - |
item.openairetype | Conference Object | - |
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: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.