Lévy flight distribution: A new metaheuristic algorithm for solving engineering optimization problems

元启发式 计算机科学 算法 粒子群优化 模拟退火 数学优化 元优化 进化算法 并行元启发式 最优化问题 多群优化 莱维航班 帝国主义竞争算法 Bat算法 人工智能 数学 随机游动 统计
作者
Essam H. Houssein,Mohammed R. Saad,Fatma A. Hashim,Abdelmgeid A. Ali,M. Hassaballah
出处
期刊:Engineering Applications of Artificial Intelligence [Elsevier]
卷期号:94: 103731-103731 被引量:327
标识
DOI:10.1016/j.engappai.2020.103731
摘要

In this paper, we propose a new metaheuristic algorithm based on Lévy flight called Lévy flight distribution (LFD) for solving real optimization problems. The LFD algorithm is inspired from the Lévy flight random walk for exploring unknown large search spaces (e.g., wireless sensor networks (WSNs). To assess the performance of the LFD algorithm, various optimization test bed problems are considered, namely the congress on evolutionary computation (CEC) 2017 suite and three engineering optimization problems: tension/compression spring, the welded beam, and pressure vessel. The statistical simulation results revealed that the LFD algorithm provides better results with superior performance in most tests compared to several well-known metaheuristic algorithms such as simulated annealing (SA), differential evolution (DE), particle swarm optimization (PSO), elephant herding optimization (EHO), the genetic algorithm (GA), moth-flame optimization algorithm (MFO), whale optimization algorithm (WOA), grasshopper optimization algorithm (GOA), and Harris Hawks Optimization (HHO) algorithm. Furthermore, the performance of the LFD algorithm is tested on other different optimization problems of unknown large search spaces such as the area coverage problem in WSNs. The LFD algorithm shows high performance in providing a good deployment schema than energy-efficient connected dominating set (EECDS), A3, and CDS-Rule K topology construction algorithms for solving the area coverage problem in WSNs. Eventually, the LFD algorithm performs successfully achieving a high coverage rate up to 43.16 %, while the A3, EECDS, and CDS-Rule K algorithms achieve low coverage rates up to 40 % based on network sizes used in the simulation experiments. Also, the LFD algorithm succeeded in providing a better deployment schema than A3, EECDS, and CDS-Rule K algorithms and enhancing the detection capability of WSNs by minimizing the overlap between sensor nodes and maximizing the coverage rate. The source code is currently available for public from: https://www.mathworks.com/matlabcentral/fileexchange/76103-lfd.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
在水一方应助文艺水蜜桃采纳,获得10
刚刚
刚刚
海绵宝宝完成签到,获得积分10
1秒前
橘子完成签到,获得积分10
1秒前
2秒前
俊逸海瑶发布了新的文献求助10
2秒前
2秒前
高高问柳完成签到,获得积分20
2秒前
Hello应助736550205采纳,获得10
3秒前
4秒前
干净凌雪完成签到,获得积分20
4秒前
3kou完成签到 ,获得积分10
4秒前
发财小鱼完成签到 ,获得积分10
5秒前
Sun应助cyd采纳,获得10
5秒前
6秒前
stk完成签到,获得积分10
7秒前
7秒前
GGZ完成签到,获得积分10
7秒前
今后应助Duha采纳,获得10
8秒前
大模型应助小雪雪采纳,获得20
8秒前
擦撒擦擦发布了新的文献求助10
9秒前
123554发布了新的文献求助10
10秒前
cheng发布了新的文献求助10
10秒前
11秒前
jz完成签到,获得积分10
13秒前
16秒前
iidae完成签到,获得积分10
17秒前
苏安莲完成签到,获得积分10
17秒前
18秒前
18秒前
HEIKU应助jhx采纳,获得20
19秒前
锋feng完成签到 ,获得积分10
20秒前
cheng完成签到,获得积分10
21秒前
gwx发布了新的文献求助10
23秒前
23秒前
科研通AI2S应助lvsehx采纳,获得10
24秒前
火星上的含羞草完成签到,获得积分10
25秒前
26秒前
互助遵法尚德应助包容豪采纳,获得10
26秒前
酷波er应助包容的人生采纳,获得10
26秒前
高分求助中
Ore genesis in the Zambian Copperbelt with particular reference to the northern sector of the Chambishi basin 800
Becoming: An Introduction to Jung's Concept of Individuation 600
A new species of Coccus (Homoptera: Coccoidea) from Malawi 500
A new species of Velataspis (Hemiptera Coccoidea Diaspididae) from tea in Assam 500
PraxisRatgeber: Mantiden: Faszinierende Lauerjäger 500
Sarcolestes leedsi Lydekker, an ankylosaurian dinosaur from the Middle Jurassic of England 450
Die Gottesanbeterin: Mantis religiosa: 656 400
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3166424
求助须知:如何正确求助?哪些是违规求助? 2817875
关于积分的说明 7918097
捐赠科研通 2477432
什么是DOI,文献DOI怎么找? 1319613
科研通“疑难数据库(出版商)”最低求助积分说明 632536
版权声明 602415