清晨好,您是今天最早来到科研通的研友!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您科研之路漫漫前行!

Binary Aquila Optimizer for 0–1 knapsack problems

计算机科学 背包问题 连续优化 离散优化 数学优化 最优化问题 群体智能 元启发式 启发式 二进制数 算法 粒子群优化 多群优化 人工智能 数学 算术
作者
Emine Baş
出处
期刊:Engineering Applications of Artificial Intelligence [Elsevier BV]
卷期号:118: 105592-105592 被引量:21
标识
DOI:10.1016/j.engappai.2022.105592
摘要

The optimization process entails determining the best values for various system characteristics in order to finish the system design at the lowest possible cost. In general, real-world applications and issues in artificial intelligence and machine learning are discrete, unconstrained, or discrete. Optimization approaches have a high success rate in tackling such situations. As a result, several sophisticated heuristic algorithms based on swarm intelligence have been presented in recent years. Various academics in the literature have worked on such algorithms and have effectively addressed many difficulties. Aquila Optimizer (AO) is one such algorithm. Aquila Optimizer (AO) is a recently suggested heuristic algorithm. It is a novel population-based optimization strategy. It was made by mimicking the natural behavior of the Aquila. It was created by imitating the behavior of the Aquila in nature in the process of catching its prey. The AO algorithm is an algorithm developed to solve continuous optimization problems in their original form. In this study, the AO structure has been updated again to solve binary optimization problems. Problems encountered in the real world do not always have continuous values. It exists in problems with discrete values. Therefore, algorithms that solve continuous problems need to be restructured to solve discrete optimization problems as well. Binary optimization problems constitute a subgroup of discrete optimization problems. In this study, a new algorithm is proposed for binary optimization problems (BAO). The most successful BAO-T algorithm was created by testing the success of BAO in eight different transfer functions. Transfer functions play an active role in converting the continuous search space to the binary search space. BAO has also been developed by adding candidate solution step crossover and mutation methods (BAO-CM). The success of the proposed BAO-T and BAO-CM algorithms has been tested on the knapsack problem, which is widely selected in binary optimization problems in the literature. Knapsack problem examples are divided into three different benchmark groups in this study. A total of sixty-three low, medium, and large scale knapsack problems were determined as test datasets. The performances of BAO-T and BAO-CM algorithms were examined in detail and the results were clearly shown with graphics. In addition, the results of BAO-T and BAO-CM algorithms have been compared with the new heuristic algorithms proposed in the literature in recent years, and their success has been proven. According to the results, BAO-CM performed better than BAO-T and can be suggested as an alternative algorithm for solving binary optimization problems.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
直率的笑翠完成签到 ,获得积分0
4秒前
徐涛完成签到 ,获得积分10
8秒前
飞快的元柏完成签到,获得积分10
19秒前
科研迪完成签到,获得积分10
25秒前
yang完成签到 ,获得积分10
33秒前
科研迪发布了新的文献求助10
35秒前
淡然的易槐完成签到,获得积分10
41秒前
顺利的山柳完成签到,获得积分10
46秒前
大模型的应助被科研通管家采纳,获得30
48秒前
alei089完成签到 ,获得积分10
52秒前
1分钟前
打打的应助被科研迪采纳,获得10
1分钟前
平淡的白翠完成签到,获得积分10
1分钟前
淡定鞋子完成签到,获得积分10
1分钟前
慧子完成签到 ,获得积分10
1分钟前
Cc完成签到 ,获得积分10
1分钟前
蝎子莱莱xth完成签到,获得积分10
1分钟前
氢锂钠钾铷铯钫完成签到,获得积分10
1分钟前
万能图书馆的应助被RZH采纳,获得10
1分钟前
widesky777完成签到 ,获得积分0
1分钟前
Square完成签到,获得积分10
1分钟前
wood完成签到,获得积分10
1分钟前
优美代桃完成签到,获得积分10
1分钟前
甜蜜的紫菜完成签到,获得积分10
2分钟前
2分钟前
RZH发布了新的文献求助10
2分钟前
2分钟前
qqq完成签到 ,获得积分0
2分钟前
leng发布了新的文献求助10
2分钟前
2分钟前
成就小蜜蜂完成签到 ,获得积分10
2分钟前
彩色的芷容完成签到 ,获得积分10
2分钟前
桐桐的应助被科研通管家采纳,获得30
2分钟前
含糊的盼波完成签到,获得积分10
2分钟前
呆呆的猕猴桃完成签到 ,获得积分10
3分钟前
辛勤的松完成签到,获得积分10
3分钟前
3分钟前
宇文雨文完成签到 ,获得积分10
3分钟前
靓丽的伟祺完成签到,获得积分10
3分钟前
俊逸吐司完成签到 ,获得积分10
3分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
八旗制度の研究 600
plantTFDB 508
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8173225
求助须知:如何正确求助?哪些是违规求助? 9565575
关于积分的说明 21780525
捐赠科研通 7767395
什么是DOI,文献DOI怎么找? 3431542
关于科研通互助平台的介绍 2555764
邀请新用户注册赠送积分活动 2476697