Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/839
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kesen, Saadettin Erhan | - |
dc.contributor.author | Alim, Muzaffer | - |
dc.date.accessioned | 2021-12-13T10:32:03Z | - |
dc.date.available | 2021-12-13T10:32:03Z | - |
dc.date.issued | 2019 | - |
dc.identifier.issn | 1304-7205 | - |
dc.identifier.issn | 1304-7191 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/839 | - |
dc.description.abstract | In this paper, we study a mixed pallet collection problem in a warehouse of the company operating in fast moving consumer goods industry and present a mixed integer programming formulation with the objective function of total travelling distance minimization. The problem studied is shown to be equivalent to the well-known vehicle routing problem. Since the problem belongs to the class of NP-hard problems, introduced mathematical formulation cannot provide optimal solution in an acceptable amount of time. We, therefore, develop an algorithm based on Simulated Annealing (SA) meta-heuristic approach to find near-optimal solution in a quite shorter computational time. Routes are constructed using Clarke&Wright saving algorithm and then these routes are perturbed whereby three neighborhood operators, namely swap, insert, swap-range are utilized to further improve the quality of the solution. Experimental results based on a real case instance demonstrates that SA algorithm is capable of providing solution more quickly than that of CPLEX solver but the quality of the solution found by SA is 7% worse than that of CPLEX. | en_US |
dc.language.iso | en | en_US |
dc.publisher | YILDIZ TECHNICAL UNIV | en_US |
dc.relation.ispartof | SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Vehicle Routing Problem | en_US |
dc.subject | Clarke And Wright Saving Algorithm | en_US |
dc.subject | Simulated Annealing | en_US |
dc.subject | Vehicle-Routing Problem | en_US |
dc.subject | Simultaneous Delivery | en_US |
dc.subject | Optimization | en_US |
dc.subject | Heuristics | en_US |
dc.subject | Algorithm | en_US |
dc.title | Solution Approaches For Mixed Pallet Collection Problem: A Case Study In A Logistic Company | en_US |
dc.type | Article | en_US |
dc.identifier.scopus | 2-s2.0-85078556206 | en_US |
dc.department | Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Endüstri Mühendisliği Bölümü | en_US |
dc.authorid | ALIM, Muzaffer/0000-0002-4420-7391 | - |
dc.authorwosid | ALIM, Muzaffer/ABA-7167-2020 | - |
dc.identifier.volume | 37 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.startpage | 827 | en_US |
dc.identifier.endpage | 840 | en_US |
dc.identifier.wos | WOS:000488302000011 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
item.languageiso639-1 | en | - |
item.fulltext | With Fulltext | - |
item.cerifentitytype | Publications | - |
item.openairetype | Article | - |
item.grantfulltext | embargo_20300101 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.dept | 02.09. Department of Industrial Engineering | - |
Appears in Collections: | Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections |
Files in This Item:
File | Size | Format | |
---|---|---|---|
1635851826-en.pdf Until 2030-01-01 | 615.16 kB | Adobe PDF | View/Open Request a copy |
CORE Recommender
WEB OF SCIENCETM
Citations
3
checked on Apr 20, 2024
Page view(s)
86
checked on Apr 22, 2024
Download(s)
4
checked on Apr 22, 2024
Google ScholarTM
Check
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.