柑橘多周期三梯队供应链优化问题

Q2 Engineering
N. Sahebjamnia, F. Goodarzian, M. Hajiaghaei-Keshteli
{"title":"柑橘多周期三梯队供应链优化问题","authors":"N. Sahebjamnia, F. Goodarzian, M. Hajiaghaei-Keshteli","doi":"10.22094/JOIE.2017.728.1463","DOIUrl":null,"url":null,"abstract":"In this paper, a new multi-objective integer non-linear programming model is developed for designing citrus three-echelon supply chain network. Short harvest period, product specifications, high perished rate, and special storing and distributing conditions make the modeling of citrus supply chain more complicated than other ones. The proposed model aims to minimize network costs including waste cost, transportation cost, and inventory holding cost, and to maximize network’s profits. To solve the model, firstly the model is converted to a linear programming model. Then three multi-objective meta-heuristic algorithms are used including MOPSO, MOICA, and NSGA-II for finding efficient solutions. The strengths and weaknesses of MOPSO, MOICA, and NSGA-II for solving the proposed model are discussed. The results of the algorithms have been compared by several criteria consisting of number of Pareto solution, maximum spread, mean ideal distance, and diversification metric.Computational results show that MOPSO algorithm finds competitive solutions in compare with NSGA-II and MOICA.","PeriodicalId":36956,"journal":{"name":"Journal of Optimization in Industrial Engineering","volume":"13 1","pages":"39-53"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"Optimization of Multi-period Three-echelon Citrus Supply Chain Problem\",\"authors\":\"N. Sahebjamnia, F. Goodarzian, M. Hajiaghaei-Keshteli\",\"doi\":\"10.22094/JOIE.2017.728.1463\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new multi-objective integer non-linear programming model is developed for designing citrus three-echelon supply chain network. Short harvest period, product specifications, high perished rate, and special storing and distributing conditions make the modeling of citrus supply chain more complicated than other ones. The proposed model aims to minimize network costs including waste cost, transportation cost, and inventory holding cost, and to maximize network’s profits. To solve the model, firstly the model is converted to a linear programming model. Then three multi-objective meta-heuristic algorithms are used including MOPSO, MOICA, and NSGA-II for finding efficient solutions. The strengths and weaknesses of MOPSO, MOICA, and NSGA-II for solving the proposed model are discussed. The results of the algorithms have been compared by several criteria consisting of number of Pareto solution, maximum spread, mean ideal distance, and diversification metric.Computational results show that MOPSO algorithm finds competitive solutions in compare with NSGA-II and MOICA.\",\"PeriodicalId\":36956,\"journal\":{\"name\":\"Journal of Optimization in Industrial Engineering\",\"volume\":\"13 1\",\"pages\":\"39-53\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Optimization in Industrial Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22094/JOIE.2017.728.1463\",\"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.2017.728.1463","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 38

摘要

本文建立了柑橘三梯队供应链网络设计的多目标整数非线性规划模型。采收期短,产品规格高,腐烂率高,特殊的储销条件,使得柑橘供应链的建模比其他供应链更加复杂。该模型旨在使网络成本(包括废弃物成本、运输成本和库存持有成本)最小化,并使网络利润最大化。为了求解该模型,首先将模型转换为线性规划模型。然后使用MOPSO、MOICA和NSGA-II三种多目标元启发式算法寻找高效解。讨论了MOPSO、MOICA和NSGA-II求解模型的优缺点。用Pareto解的个数、最大扩展、平均理想距离和多样化度量等标准对算法的结果进行了比较。计算结果表明,与NSGA-II和MOICA相比,MOPSO算法找到了有竞争力的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimization of Multi-period Three-echelon Citrus Supply Chain Problem
In this paper, a new multi-objective integer non-linear programming model is developed for designing citrus three-echelon supply chain network. Short harvest period, product specifications, high perished rate, and special storing and distributing conditions make the modeling of citrus supply chain more complicated than other ones. The proposed model aims to minimize network costs including waste cost, transportation cost, and inventory holding cost, and to maximize network’s profits. To solve the model, firstly the model is converted to a linear programming model. Then three multi-objective meta-heuristic algorithms are used including MOPSO, MOICA, and NSGA-II for finding efficient solutions. The strengths and weaknesses of MOPSO, MOICA, and NSGA-II for solving the proposed model are discussed. The results of the algorithms have been compared by several criteria consisting of number of Pareto solution, maximum spread, mean ideal distance, and diversification metric.Computational results show that MOPSO algorithm finds competitive solutions in compare with NSGA-II and MOICA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信