Supply Chain Network Optimization by Considering Cost and Service Level Goals

Mehmet Alegoz, Z. K. Ozturk
{"title":"Supply Chain Network Optimization by Considering Cost and Service Level Goals","authors":"Mehmet Alegoz, Z. K. Ozturk","doi":"10.13189/ujam.2018.060203","DOIUrl":null,"url":null,"abstract":"In this study, we focus on designing the supply chain network of a company that sells households goods to its customers located in various cities of Turkey. Since the production plant of the company is fixed and cannot be changed, we divide the supply chain network design problem into two separate problems. In first problem, we focus on the network between the supplier and the production plant. This problem can be thought as a supplier selection problem and there are many qualitative and quantitative criteria, which affect this process. Therefore, we use Buckley's Fuzzy AHP algorithm, which enables us to evaluate the suppliers according to all types of criteria. In second phase of the study, we focus on the supply chain network between the production plant, warehouses and customers and develop a multi objective mathematical model. Although, the proposed mathematical model gives optimal solution for our company data within a reasonable time, large size instances cannot be solved by using this model due to the complexity of problem. For this reason, we propose various metaheuristic approaches based on tabu search and compare the results with optimal solution. Computational results show that one of our approaches gives high quality results within a reasonable time. We conclude the study by discussing the numerical results and giving some future work suggestions to interested readers.","PeriodicalId":372283,"journal":{"name":"Universal Journal of Applied Mathematics","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Universal Journal of Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13189/ujam.2018.060203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this study, we focus on designing the supply chain network of a company that sells households goods to its customers located in various cities of Turkey. Since the production plant of the company is fixed and cannot be changed, we divide the supply chain network design problem into two separate problems. In first problem, we focus on the network between the supplier and the production plant. This problem can be thought as a supplier selection problem and there are many qualitative and quantitative criteria, which affect this process. Therefore, we use Buckley's Fuzzy AHP algorithm, which enables us to evaluate the suppliers according to all types of criteria. In second phase of the study, we focus on the supply chain network between the production plant, warehouses and customers and develop a multi objective mathematical model. Although, the proposed mathematical model gives optimal solution for our company data within a reasonable time, large size instances cannot be solved by using this model due to the complexity of problem. For this reason, we propose various metaheuristic approaches based on tabu search and compare the results with optimal solution. Computational results show that one of our approaches gives high quality results within a reasonable time. We conclude the study by discussing the numerical results and giving some future work suggestions to interested readers.
考虑成本和服务水平目标的供应链网络优化
在本研究中,我们专注于设计一家公司的供应链网络,该公司向位于土耳其各个城市的客户销售家庭用品。由于公司的生产工厂是固定的,不能改变,所以我们将供应链网络设计问题分为两个独立的问题。在第一个问题中,我们关注供应商和生产工厂之间的网络。这个问题可以看作是一个供应商选择问题,有许多定性和定量的标准,影响这一过程。因此,我们使用巴克利的模糊层次分析法,使我们能够根据各种标准对供应商进行评估。在研究的第二阶段,我们重点研究了生产厂、仓库和客户之间的供应链网络,并建立了多目标数学模型。虽然所提出的数学模型在合理的时间内给出了我公司数据的最优解,但由于问题的复杂性,该模型无法解决大型实例。为此,我们提出了各种基于禁忌搜索的元启发式方法,并将结果与最优解进行比较。计算结果表明,我们的一种方法在合理的时间内得到了高质量的结果。最后对数值结果进行了讨论,并对未来的工作提出了一些建议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信