柑橘供应链网络设计的多目标数学模型:元启发式算法

Q2 Engineering
M. Fakhrzad, F. Goodarzian
{"title":"柑橘供应链网络设计的多目标数学模型:元启发式算法","authors":"M. Fakhrzad, F. Goodarzian","doi":"10.22094/JOIE.2020.570636.1571","DOIUrl":null,"url":null,"abstract":"Nowadays, the citrus supply chain has been motivated by both industrial practitioners and researchers due to several real-world applications. This study considers a four-echelon citrus supply chain, consisting of gardeners, distribution centers, citrus storage, and fruit market. A Mixed Integer Non-Linear Programming (MINLP) model is formulated, which seeks to minimize the total cost and maximize the profit of the Citrus supply chain network. Due to the complexity of the model when considering large-scale samples, two well-known meta-heuristic algorithms such as Ant Colony Optimization (ACO) and Simulated Annealing (SA) algorithms have been utilized. Additionally, a new multi-objective ACO algorithm based on a set of non-dominated solutions form the Pareto frontier developed to solve the mathematical model. An extensive comparison based on different measurements analyzed to find a performance solution for the developed problem in the three sizes (small, medium, and large-scale). Finally, the various outcomes of numerical experiments indicate that the MOACO algorithm is more reliable than other algorithms.","PeriodicalId":36956,"journal":{"name":"Journal of Optimization in Industrial Engineering","volume":"14 1","pages":"127-144"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":"{\"title\":\"A new multi-objective mathematical model for a Citrus supply chain network design: Metaheuristic algorithms\",\"authors\":\"M. Fakhrzad, F. Goodarzian\",\"doi\":\"10.22094/JOIE.2020.570636.1571\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, the citrus supply chain has been motivated by both industrial practitioners and researchers due to several real-world applications. This study considers a four-echelon citrus supply chain, consisting of gardeners, distribution centers, citrus storage, and fruit market. A Mixed Integer Non-Linear Programming (MINLP) model is formulated, which seeks to minimize the total cost and maximize the profit of the Citrus supply chain network. Due to the complexity of the model when considering large-scale samples, two well-known meta-heuristic algorithms such as Ant Colony Optimization (ACO) and Simulated Annealing (SA) algorithms have been utilized. Additionally, a new multi-objective ACO algorithm based on a set of non-dominated solutions form the Pareto frontier developed to solve the mathematical model. An extensive comparison based on different measurements analyzed to find a performance solution for the developed problem in the three sizes (small, medium, and large-scale). Finally, the various outcomes of numerical experiments indicate that the MOACO algorithm is more reliable than other algorithms.\",\"PeriodicalId\":36956,\"journal\":{\"name\":\"Journal of Optimization in Industrial Engineering\",\"volume\":\"14 1\",\"pages\":\"127-144\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Optimization in Industrial Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22094/JOIE.2020.570636.1571\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Optimization in Industrial Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22094/JOIE.2020.570636.1571","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 32

摘要

如今,由于一些现实世界的应用,柑橘供应链受到了行业从业者和研究人员的推动。本研究考虑了一个由园丁、配送中心、柑橘储存和水果市场组成的四级柑橘供应链。建立了柑橘供应链网络的混合整数非线性规划(MINLP)模型,该模型旨在使柑橘供应链的总成本最小化,利润最大化。由于模型在考虑大规模样本时的复杂性,已经使用了两种著名的元启发式算法,如蚁群优化(ACO)和模拟退火(SA)算法。此外,基于Pareto边界的一组非支配解,开发了一种新的多目标ACO算法来求解数学模型。基于分析的不同测量结果进行广泛比较,以找到三种规模(小型、中型和大型)中所开发问题的性能解决方案。最后,数值实验的各种结果表明,MOACO算法比其他算法更可靠。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new multi-objective mathematical model for a Citrus supply chain network design: Metaheuristic algorithms
Nowadays, the citrus supply chain has been motivated by both industrial practitioners and researchers due to several real-world applications. This study considers a four-echelon citrus supply chain, consisting of gardeners, distribution centers, citrus storage, and fruit market. A Mixed Integer Non-Linear Programming (MINLP) model is formulated, which seeks to minimize the total cost and maximize the profit of the Citrus supply chain network. Due to the complexity of the model when considering large-scale samples, two well-known meta-heuristic algorithms such as Ant Colony Optimization (ACO) and Simulated Annealing (SA) algorithms have been utilized. Additionally, a new multi-objective ACO algorithm based on a set of non-dominated solutions form the Pareto frontier developed to solve the mathematical model. An extensive comparison based on different measurements analyzed to find a performance solution for the developed problem in the three sizes (small, medium, and large-scale). Finally, the various outcomes of numerical experiments indicate that the MOACO algorithm is more reliable than other algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Optimization in Industrial Engineering
Journal of Optimization in Industrial Engineering Engineering-Industrial and Manufacturing Engineering
CiteScore
2.90
自引率
0.00%
发文量
0
审稿时长
32 weeks
×
引用
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学术官方微信