需求不确定和短缺惩罚的救济运输模型设计:用元启发式算法求解

Q3 Decision Sciences
R. Ramezanian, Soleiman Jani
{"title":"需求不确定和短缺惩罚的救济运输模型设计:用元启发式算法求解","authors":"R. Ramezanian, Soleiman Jani","doi":"10.22068/IJIEPR.32.3.12","DOIUrl":null,"url":null,"abstract":"In this paper, a fuzzy multi-objective optimization model in the logistics of relief chain for response phase planning is addressed. The objectives of the model are: minimizing the costs, minimizing unresponsive demand, and maximizing the level of distribution and fair relief. A multi-objective integer programming model is developed to formulate the problem in fuzzy conditions and transformed to the deterministic model using Jimechr('39')nez approach. To solve the exact multi-objective model, the e-constraint method is used. The resolved results for this method have shown that this method is only able to find the solution for problems with very small sizes. Therefore, in order to solve the problems with medium and large sizes, multi-objective cuckoo search optimization algorithm (MOCSOA) is implemented and its results are compared with the NSGA-II. The results showed that MOCSOA in all cases has the higher ability to produce higher quality and higher-dispersion solutions than NSGA-II.","PeriodicalId":52223,"journal":{"name":"International Journal of Industrial Engineering and Production Research","volume":"53 7 1","pages":"1-17"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Design a Relief Transportation Model with Uncertain Demand and Shortage Penalty: Solving with Meta-Heuristic Algorithms\",\"authors\":\"R. Ramezanian, Soleiman Jani\",\"doi\":\"10.22068/IJIEPR.32.3.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a fuzzy multi-objective optimization model in the logistics of relief chain for response phase planning is addressed. The objectives of the model are: minimizing the costs, minimizing unresponsive demand, and maximizing the level of distribution and fair relief. A multi-objective integer programming model is developed to formulate the problem in fuzzy conditions and transformed to the deterministic model using Jimechr('39')nez approach. To solve the exact multi-objective model, the e-constraint method is used. The resolved results for this method have shown that this method is only able to find the solution for problems with very small sizes. Therefore, in order to solve the problems with medium and large sizes, multi-objective cuckoo search optimization algorithm (MOCSOA) is implemented and its results are compared with the NSGA-II. The results showed that MOCSOA in all cases has the higher ability to produce higher quality and higher-dispersion solutions than NSGA-II.\",\"PeriodicalId\":52223,\"journal\":{\"name\":\"International Journal of Industrial Engineering and Production Research\",\"volume\":\"53 7 1\",\"pages\":\"1-17\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Industrial Engineering and Production Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22068/IJIEPR.32.3.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Decision Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Industrial Engineering and Production Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22068/IJIEPR.32.3.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 1

摘要

本文研究了救灾链物流响应阶段规划的模糊多目标优化模型。该模型的目标是:使成本最小化,使无响应需求最小化,使分配水平和公平救济最大化。建立了模糊条件下的多目标整数规划模型,并利用Jimechr('39')nez方法将其转化为确定性模型。为了精确求解多目标模型,采用e约束方法。对该方法的解析结果表明,该方法只能对非常小的问题求出解。因此,为了解决大中型问题,实现了多目标布谷鸟搜索优化算法(MOCSOA),并将其结果与NSGA-II进行了比较。结果表明,在所有情况下,与NSGA-II相比,MOCSOA具有更高的生成质量更高、分散度更高的解决方案的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design a Relief Transportation Model with Uncertain Demand and Shortage Penalty: Solving with Meta-Heuristic Algorithms
In this paper, a fuzzy multi-objective optimization model in the logistics of relief chain for response phase planning is addressed. The objectives of the model are: minimizing the costs, minimizing unresponsive demand, and maximizing the level of distribution and fair relief. A multi-objective integer programming model is developed to formulate the problem in fuzzy conditions and transformed to the deterministic model using Jimechr('39')nez approach. To solve the exact multi-objective model, the e-constraint method is used. The resolved results for this method have shown that this method is only able to find the solution for problems with very small sizes. Therefore, in order to solve the problems with medium and large sizes, multi-objective cuckoo search optimization algorithm (MOCSOA) is implemented and its results are compared with the NSGA-II. The results showed that MOCSOA in all cases has the higher ability to produce higher quality and higher-dispersion solutions than NSGA-II.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Industrial Engineering and Production Research
International Journal of Industrial Engineering and Production Research Engineering-Industrial and Manufacturing Engineering
CiteScore
1.60
自引率
0.00%
发文量
0
审稿时长
10 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学术官方微信