Optimization of Stochastic Discrete Event Simulation Models Using "AFO" Heuristic

Bendato Ilaria, Cassettari Lucia, Fioribello Simone, Giribone Pier Giuseppe
{"title":"Optimization of Stochastic Discrete Event Simulation Models Using \"AFO\" Heuristic","authors":"Bendato Ilaria, Cassettari Lucia, Fioribello Simone, Giribone Pier Giuseppe","doi":"10.1109/MCSI.2016.029","DOIUrl":null,"url":null,"abstract":"The optimal conditions evaluation in complex stochastic systems modelled through Discrete Event Simulation is often extremely costly in computational terms. Especially when the number of variables involved is high, as in the case of manufacturing systems, the duration of each simulation run can last even several hours of calculation. It therefore becomes very important to use an optimal search method that allows the experimenter to reduce as much as possible the number of function evaluations analysed. With this goal, the Authors compared the performance of a new nature-inspired Heuristic called Attraction Force Optimization (AFO), with those of traditional algorithms, applying these different methodologies to a real industrial case. The authors believe that the obtained results could be of great interest to the scientific community and the AFO heuristic can become a valuable reference for discrete event simulation-based optimization problems.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCSI.2016.029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The optimal conditions evaluation in complex stochastic systems modelled through Discrete Event Simulation is often extremely costly in computational terms. Especially when the number of variables involved is high, as in the case of manufacturing systems, the duration of each simulation run can last even several hours of calculation. It therefore becomes very important to use an optimal search method that allows the experimenter to reduce as much as possible the number of function evaluations analysed. With this goal, the Authors compared the performance of a new nature-inspired Heuristic called Attraction Force Optimization (AFO), with those of traditional algorithms, applying these different methodologies to a real industrial case. The authors believe that the obtained results could be of great interest to the scientific community and the AFO heuristic can become a valuable reference for discrete event simulation-based optimization problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用“AFO”启发式优化随机离散事件模拟模型
在离散事件模拟的复杂随机系统中,最优条件的计算通常是非常昂贵的。特别是当涉及的变量数量很高时,例如在制造系统的情况下,每次模拟运行的持续时间甚至可能持续几个小时的计算时间。因此,使用一种最优搜索方法变得非常重要,这种方法允许实验者尽可能减少所分析的函数评估的数量。为了实现这一目标,作者将一种新的启发自然的启发式算法称为吸引力优化(AFO)与传统算法的性能进行了比较,并将这些不同的方法应用于实际的工业案例。作者认为,所得结果对科学界具有重要意义,AFO启发式方法对基于离散事件模拟的优化问题具有参考价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Real Emotion Recognition by Detecting Symmetry Patterns with Dihedral Group Reliability and Security Issues for IoT-based Smart Business Center: Architecture and Markov Model Fast Empirical Mode Decomposition Based on Gaussian Noises Advanced Laser Processes for Energy Production A Non-blocking Online Cake-Cutting Protocol
×
引用
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