A Primary Study on Hyper-Heuristics Powered by Artificial Neural Networks for Customising Population-based Metaheuristics in Continuous Optimisation Problems

Jose M. Tapia-Avitia, J. M. Cruz-Duarte, I. Amaya, J. C. Ortíz-Bayliss, H. Terashima-Marín, N. Pillay
{"title":"A Primary Study on Hyper-Heuristics Powered by Artificial Neural Networks for Customising Population-based Metaheuristics in Continuous Optimisation Problems","authors":"Jose M. Tapia-Avitia, J. M. Cruz-Duarte, I. Amaya, J. C. Ortíz-Bayliss, H. Terashima-Marín, N. Pillay","doi":"10.1109/CEC55065.2022.9870275","DOIUrl":null,"url":null,"abstract":"Metaheuristics (MHs) are proven powerful algorithms for solving non-linear optimisation problems over discrete, continuous, or mixed domains. Applications have ranged from basic sciences to applied technologies. Nowadays, the literature contains plenty of MHs based on exceptional ideas, but often, they are just recombining elements from other techniques. An alternative approach is to follow a standard model that customises population-based MHs, utilising simple heuristics extracted from well-known MHs. Different approaches have explored the combination of such simple heuristics, generating excellent results compared to the generic MHs. Nevertheless, they present limitations due to the nature of the metaheuristic used to study the heuristic space. This work investigates a field of action for implementing a model that takes advantage of previously modified MHs by learning how to boost the performance of the tailoring process. Following this reasoning, we propose a hyper-heuristic model based on Artificial Neural Networks (ANNs) trained with processed sequences of heuristics to identify patterns that one can use to generate better MHs. We prove the feasibility of this model by comparing the results against generic MHs and other approaches that tailor unfolded MHs. Our results evidenced that the proposed model outperformed an average of 84 % of all scenarios; in particular, 89 % of basic and 77 % of unfolded approaches. Plus, we highlight the configurable capability of the proposed model, as it shows to be exceptionally versatile in regards to the computational budget, generating good results even with limited resources.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC55065.2022.9870275","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Metaheuristics (MHs) are proven powerful algorithms for solving non-linear optimisation problems over discrete, continuous, or mixed domains. Applications have ranged from basic sciences to applied technologies. Nowadays, the literature contains plenty of MHs based on exceptional ideas, but often, they are just recombining elements from other techniques. An alternative approach is to follow a standard model that customises population-based MHs, utilising simple heuristics extracted from well-known MHs. Different approaches have explored the combination of such simple heuristics, generating excellent results compared to the generic MHs. Nevertheless, they present limitations due to the nature of the metaheuristic used to study the heuristic space. This work investigates a field of action for implementing a model that takes advantage of previously modified MHs by learning how to boost the performance of the tailoring process. Following this reasoning, we propose a hyper-heuristic model based on Artificial Neural Networks (ANNs) trained with processed sequences of heuristics to identify patterns that one can use to generate better MHs. We prove the feasibility of this model by comparing the results against generic MHs and other approaches that tailor unfolded MHs. Our results evidenced that the proposed model outperformed an average of 84 % of all scenarios; in particular, 89 % of basic and 77 % of unfolded approaches. Plus, we highlight the configurable capability of the proposed model, as it shows to be exceptionally versatile in regards to the computational budget, generating good results even with limited resources.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于人工神经网络的超启发式自定义连续优化问题中基于群体的元启发式的初步研究
元启发式(MHs)被证明是解决离散、连续或混合领域的非线性优化问题的强大算法。应用范围从基础科学到应用技术。如今,文献中包含了大量基于特殊想法的mh,但通常它们只是重新组合了其他技术的元素。另一种方法是遵循一个标准模型,利用从知名的医疗保健中提取的简单启发式方法,定制基于人口的医疗保健。不同的方法已经探索了这些简单的启发式的组合,与通用的mh相比,产生了出色的结果。然而,由于用于研究启发式空间的元启发式的性质,它们存在局限性。通过学习如何提高裁剪过程的性能,本工作研究了实现模型的一个行动领域,该模型利用了先前修改的mh。根据这一推理,我们提出了一种基于人工神经网络(ann)的超启发式模型,该模型使用经过处理的启发式序列进行训练,以识别可用于生成更好的mh的模式。通过与一般mhhs和其他定制展开mhhs方法的结果比较,证明了该模型的可行性。我们的结果证明,所提出的模型在所有场景中的平均表现优于84%;特别是89%的基本方法和77%的未展开方法。此外,我们强调了所建议模型的可配置能力,因为它在计算预算方面显示出异常通用的功能,即使在有限的资源下也能产生良好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impacts of Single-objective Landscapes on Multi-objective Optimization Cooperative Multi-objective Topology Optimization Using Clustering and Metamodeling Global and Local Area Coverage Path Planner for a Reconfigurable Robot A New Integer Linear Program and A Grouping Genetic Algorithm with Controlled Gene Transmission for Joint Order Batching and Picking Routing Problem Test Case Prioritization and Reduction Using Hybrid Quantum-behaved Particle Swarm Optimization
×
引用
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