Enhanced Differential Crossover and Quantum Particle Swarm Optimization for IoT Applications

被引:30
作者
Ghorpade, Sheetal N. [1 ]
Zennaro, Marco [2 ]
Chaudhari, Bharat S. [3 ]
Saeed, Rashid A. [4 ]
Alhumyani, Hesham [4 ]
Abdel-Khalek, S. [4 ]
机构
[1] Savitribai Phule Pune Univ, RMD Sinhgad Sch Engn, Pune 411058, Maharashtra, India
[2] Abdus Salam Int Ctr Theoret Phys, Sci Technol & Innovat Unit, I-34151 Trieste, Italy
[3] MIT World Peace Univ, Sch Elect & Commun Engn, Pune 411037, Maharashtra, India
[4] Taif Univ, Coll Comp & Informat Technol, Dept Comp Engn, At Taif 21944, Saudi Arabia
关键词
Optimization; Particle swarm optimization; Internet of Things; Location awareness; Convergence; Topology; Energy consumption; crossover operator; differential evolution operation; optimization; particle swarm optimization; quantum computing; GLOBAL OPTIMIZATION; ALGORITHM THEORY; INTELLIGENCE; DESIGN; TESTS;
D O I
10.1109/ACCESS.2021.3093113
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An optimized design with real-time and multiple realistic constraints in complex engineering systems is a crucial challenge for designers. In the non-uniform Internet of Things (IoT) node deployments, the approximation accuracy is directly affected by the parameters like node density and coverage. We propose a novel enhanced differential crossover quantum particle swarm optimization algorithm for solving nonlinear numerical problems. The algorithm is based on hybrid optimization using quantum PSO. Differential evolution operator is used to circumvent group moves in small ranges and falling into the local optima and improves global searchability. The cross operator is employed to promote information interchange among individuals in a group, and exceptional genes can be continued moderately, accompanying the evolutionary process's continuance and adding proactive and reactive features. The proposed algorithm's performance is verified as well as compared with the other algorithms through 30 classic benchmark functions in IEEE CEC2017, with a basic PSO algorithm and improved versions. The results show the smaller values of fitness function and computational efficiency for the benchmark functions of IEEE CEC2019. The proposed algorithm outperforms the existing optimization algorithms and different PSO versions, and has a high precision and faster convergence speed. The average location error is substantially reduced for the smart parking IoT application.
引用
收藏
页码:93831 / 93846
页数:16
相关论文
共 50 条
[1]   Levy-based antlion-inspired optimizers with orthogonal learning scheme [J].
Ba, Abdoul Fatakhou ;
Huang, Hui ;
Wang, Mingjing ;
Ye, Xiaojia ;
Gu, Zhiyang ;
Chen, Huiling ;
Cai, Xueding .
ENGINEERING WITH COMPUTERS, 2022, 38 (01) :397-418
[2]   QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution [J].
Bhatia, Amandeep Singh ;
Saggi, Mandeep Kaur ;
Zheng, Shenggen .
QUANTUM INFORMATION PROCESSING, 2020, 19 (10)
[3]   Evolving an optimal kernel extreme learning machine by using an enhanced grey wolf optimization strategy [J].
Cai, Zhennao ;
Gu, Jianhua ;
Luo, Jie ;
Zhang, Qian ;
Chen, Huiling ;
Pan, Zhifang ;
Li, Yuping ;
Li, Chengye .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 138
[4]   An Enhanced Comprehensive Learning Particle Swarm Optimizer with the Elite-Based Dominance Scheme [J].
Chen, Chengcheng ;
Wang, Xianchang ;
Yu, Helong ;
Zhao, Nannan ;
Wang, Mingjing ;
Chen, Huiling .
COMPLEXITY, 2020, 2020
[5]   An enhanced Bacterial Foraging Optimization and its application for training kernel extreme learning machine [J].
Chen, Huiling ;
Zhang, Qian ;
Luo, Jie ;
Xu, Yueting ;
Zhang, Xiaoqin .
APPLIED SOFT COMPUTING, 2020, 86
[6]   A quantum particle swarm optimizer with chaotic mutation operator [J].
Coelho, Leandro dos Santos .
CHAOS SOLITONS & FRACTALS, 2008, 37 (05) :1409-1418
[7]   An Ant Colony Optimization Approach for the Deployment of Reliable Wireless Sensor Networks [J].
Deif, Dina S. ;
Gadallah, Yasser .
IEEE ACCESS, 2017, 5 :10744-10756
[8]   A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms [J].
Derrac, Joaquin ;
Garcia, Salvador ;
Molina, Daniel ;
Herrera, Francisco .
SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (01) :3-18
[9]  
Epstein A, 2019, IEEE C EVOL COMPUTAT, P395, DOI [10.1109/cec.2019.8790159, 10.1109/CEC.2019.8790159]
[10]   Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power [J].
Garcia, Salvador ;
Fernandez, Alberto ;
Luengo, Julian ;
Herrera, Francisco .
INFORMATION SCIENCES, 2010, 180 (10) :2044-2064