基于模拟退火的多目标供应链系统设计元启发式算法

Awsan Mohammed, S. Duffuaa
{"title":"基于模拟退火的多目标供应链系统设计元启发式算法","authors":"Awsan Mohammed, S. Duffuaa","doi":"10.1109/IASEC.2019.8686517","DOIUrl":null,"url":null,"abstract":"This paper proposes a new solution based on tuned-parameter simulated annealing algorithm to obtain near-optimum solutions for solving large multi-objective multi-product supply chain design problem. The selected objective functions are: maximize the total profit, minimize the total supply chain risk, and minimize the supply chain emissions. The characteristics of the algorithm are developed and presented, then coded and tested. Since there is no benchmark available in the existing and state-of-the-art papers, the results acquired by the developed algorithm are compared with the results obtained by an improved augmented $\\varepsilon$-constraint algorithm embedded in the General Algebraic Modeling System (GAMS) software for small-scale, medium-scale, and large-scale instances of the multi-objective supply chain problem. The results indicate that the developed simulated annealing algorithm is able to obtain acceptable solutions with reasonable computational time.","PeriodicalId":198017,"journal":{"name":"2019 Industrial & Systems Engineering Conference (ISEC)","volume":"359 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Meta-Heuristic Algorithm Based on Simulated Annealing for Designing Multi-Objective Supply Chain Systems\",\"authors\":\"Awsan Mohammed, S. Duffuaa\",\"doi\":\"10.1109/IASEC.2019.8686517\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new solution based on tuned-parameter simulated annealing algorithm to obtain near-optimum solutions for solving large multi-objective multi-product supply chain design problem. The selected objective functions are: maximize the total profit, minimize the total supply chain risk, and minimize the supply chain emissions. The characteristics of the algorithm are developed and presented, then coded and tested. Since there is no benchmark available in the existing and state-of-the-art papers, the results acquired by the developed algorithm are compared with the results obtained by an improved augmented $\\\\varepsilon$-constraint algorithm embedded in the General Algebraic Modeling System (GAMS) software for small-scale, medium-scale, and large-scale instances of the multi-objective supply chain problem. The results indicate that the developed simulated annealing algorithm is able to obtain acceptable solutions with reasonable computational time.\",\"PeriodicalId\":198017,\"journal\":{\"name\":\"2019 Industrial & Systems Engineering Conference (ISEC)\",\"volume\":\"359 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Industrial & Systems Engineering Conference (ISEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IASEC.2019.8686517\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Industrial & Systems Engineering Conference (ISEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IASEC.2019.8686517","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

针对大型多目标多产品供应链设计问题,提出了一种基于可调参数模拟退火算法的近最优解求解方法。所选择的目标函数是:总利润最大化,供应链总风险最小化,供应链排放最小化。提出了该算法的特点,并对其进行了编码和测试。由于现有和最新的论文中没有可用的基准,因此将开发的算法获得的结果与嵌入在通用代数建模系统(GAMS)软件中的改进的增强$\varepsilon$约束算法获得的结果进行比较,用于多目标供应链问题的小型,中型和大型实例。结果表明,所提出的模拟退火算法能够在合理的计算时间内得到满意的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Meta-Heuristic Algorithm Based on Simulated Annealing for Designing Multi-Objective Supply Chain Systems
This paper proposes a new solution based on tuned-parameter simulated annealing algorithm to obtain near-optimum solutions for solving large multi-objective multi-product supply chain design problem. The selected objective functions are: maximize the total profit, minimize the total supply chain risk, and minimize the supply chain emissions. The characteristics of the algorithm are developed and presented, then coded and tested. Since there is no benchmark available in the existing and state-of-the-art papers, the results acquired by the developed algorithm are compared with the results obtained by an improved augmented $\varepsilon$-constraint algorithm embedded in the General Algebraic Modeling System (GAMS) software for small-scale, medium-scale, and large-scale instances of the multi-objective supply chain problem. The results indicate that the developed simulated annealing algorithm is able to obtain acceptable solutions with reasonable computational time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Meta-Heuristic Algorithm Based on Simulated Annealing for Designing Multi-Objective Supply Chain Systems Healthcare Facility Variables Important to Biomedical Staffing in Line with 2030 Saudi Vision Optimum Inventory Control and Warehouse Selection with a Time-Dependent Selling Price A Frame Work for the Integration of Statistical Process Control and Engineering Process Control A Pilot Study of Biomedical Engineering Shared Service for Hospitals in Madinah Munawwarah
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1