Nonlinear Rayleigh wave inversion based on the shuffled frog-leaping algorithm

At present, near-surface shear wave velocities are mainly calculated through Rayleigh wave dispersion-curve inversions in engineering surface investigations, but the required calculations pose a highly nonlinear global optimization problem. In order to alleviate the risk of falling into a local optimal solution, this paper introduces a new global optimization method, the shuffle frog-leaping algorithm （SFLA）, into the Rayleigh wave dispersion-curve inversion process. SFLA is a swarm-intelligence-based algorithm that simulates a group of frogs searching for food. It uses a few parameters, achieves rapid convergence, and is capability of effective global searching. In order to test the reliability and calculation performance of SFLA, noise-free and noisy synthetic datasets were inverted. We conducted a comparative analysis with other established algorithms using the noise-free dataset, and then tested the ability of SFLA to cope with data noise. Finally, we inverted a real-world example to examine the applicability of SFLA. Results from both synthetic and field data demonstrated the effectiveness of SFLA in the interpretation of Rayleigh wave dispersion curves. We found that SFLA is superior to the established methods in terms of both reliability and computational efficiency, so it offers great potential to improve our ability to solve geophysical inversion problems.

Membrane-inspired quantum shuffled frog leaping algorithm for spectrum allocation

To solve discrete optimization difficulty of the spectrum allocation problem,a membrane-inspired quantum shuffled frog leaping（MQSFL） algorithm is proposed.The proposed MQSFL algorithm applies the theory of membrane computing and quantum computing to the shuffled frog leaping algorithm,which is an effective discrete optimization algorithm.Then the proposed MQSFL algorithm is used to solve the spectrum allocation problem of cognitive radio systems.By hybridizing the quantum frog colony optimization and membrane computing,the quantum state and observation state of the quantum frogs can be well evolved within the membrane structure.The novel spectrum allocation algorithm can search the global optimal solution within a reasonable computation time.Simulation results for three utility functions of a cognitive radio system are provided to show that the MQSFL spectrum allocation method is superior to some previous spectrum allocation algorithms based on intelligence computing.

Improved Shuffled Frog Leaping Algorithm Optimizing Integral Separated PID Control for Unmanned Hypersonic Vehicle

To solve the flight control problem for unmanned hypersonic vehicles,a novel intelligent optimized control method is proposed.A flight control system based on integral separated proportional-integral-derivative(PID)control is designed for hypersonic vehicle,and an improved shuffled frog leaping algorithm is presented to optimize the control parameters.A nonlinear model of hypersonic vehicle is established to examine the dynamic characteristics achieved by the flight control system.Simulation results demonstrate that the proposed optimized controller can effectively achieve better flight control performance than the traditional controller.

Modified Shuffled Frog Leaping Algorithm for Solving Economic Load Dispatch Problem

In the recent restructured power system scenario and complex market strategy, operation at absolute minimum cost is no longer the only criterion for dispatching electric power. The economic load dispatch (ELD) problem which accounts for minimization of both generation cost and power loss is itself a multiple conflicting objective function problem. In this paper, a modified shuffled frog-leaping algorithm (MSFLA), which is an improved version of memetic algorithm, is proposed for solving the ELD problem. It is a relatively new evolutionary method where local search is applied during the evolutionary cycle. The idea of memetic algorithm comes from memes, which unlike genes can adapt themselves. The performance of MSFLA has been shown more efficient than traditional evolutionary algorithms for such type of ELD problem. The application and validity of the proposed algorithm are demonstrated for IEEE 30 bus test system as well as a practical power network of 203 bus 264 lines 23 machines system.

Control Strategy for a Quadrotor Based on a Memetic Shuffled Frog Leaping Algorithm

This work presents a memetic Shuffled Frog Leaping Algorithm(SFLA)based tuning approach of an Integral Sliding Mode Controller(ISMC)for a quadrotor type of Unmanned Aerial Vehicles(UAV).Based on the Newton–Euler formalism,a nonlinear dynamic model of the studied quadrotor is firstly established for control design purposes.Since the main parameters of the ISMC design are the gains of the sliding surfaces and signum functions of the switching control law,which are usually selected by repetitive and time-consuming trials-errors based procedures,a constrained optimization problem is formulated for the systematically tuning of these unknown variables.Under time-domain operating constraints,such an optimization-based tuning problem is effectively solved using the proposed SFLA metaheuristic with an empirical comparison to other evolutionary computation-and swarm intelligence-based algorithms such as the Crow Search Algorithm(CSA),Fractional Particle Swarm Optimization Memetic Algorithm(FPSOMA),Ant Bee Colony(ABC)and Harmony Search Algorithm(HSA).Numerical experiments are carried out for various sets of algorithms’parameters to achieve optimal gains of the sliding mode controllers for the altitude and attitude dynamics stabilization.Comparative studies revealed that the SFLA is a competitive and easily implemented algorithm with high performance in terms of robustness and non-premature convergence.Demonstrative results verified that the proposed metaheuristicsbased approach is a promising alternative for the systematic tuning of the effective design parameters in the integral sliding mode control framework.

Shuffled frog leaping algorithm with non-dominated sorting for dynamic weapon-target assignment

The dynamic weapon target assignment(DWTA)problem is of great significance in modern air combat.However,DWTA is a highly complex constrained multi-objective combinatorial optimization problem.An improved elitist non-dominated sorting genetic algorithm-II(NSGA-II)called the non-dominated shuffled frog leaping algorithm(NSFLA)is proposed to maximize damage to enemy targets and minimize the self-threat in air combat constraints.In NSFLA,the shuffled frog leaping algorithm(SFLA)is introduced to NSGA-II to replace the inside evolutionary scheme of the genetic algorithm(GA),displaying low optimization speed and heterogeneous space search defects.Two improvements have also been raised to promote the internal optimization performance of SFLA.Firstly,the local evolution scheme,a novel crossover mechanism,ensures that each individual participates in updating instead of only the worst ones,which can expand the diversity of the population.Secondly,a discrete adaptive mutation algorithm based on the function change rate is applied to balance the global and local search.Finally,the scheme is verified in various air combat scenarios.The results show that the proposed NSFLA has apparent advantages in solution quality and efficiency,especially in many aircraft and the dynamic air combat environment.

Quantitative algorithm for airborne gamma spectrum of large sample based on improved shuffled frog leaping-particle swarm optimization convolutional neural network

In airborne gamma ray spectrum processing,different analysis methods,technical requirements,analysis models,and calculation methods need to be established.To meet the engineering practice requirements of airborne gamma-ray measurements and improve computational efficiency,an improved shuffled frog leaping algorithm-particle swarm optimization convolutional neural network(SFLA-PSO CNN)for large-sample quantitative analysis of airborne gamma-ray spectra is proposed herein.This method was used to train the weight of the neural network,optimize the structure of the network,delete redundant connections,and enable the neural network to acquire the capability of quantitative spectrum processing.In full-spectrum data processing,this method can perform the functions of energy spectrum peak searching and peak area calculations.After network training,the mean SNR and RMSE of the spectral lines were 31.27 and 2.75,respectively,satisfying the demand for noise reduction.To test the processing ability of the algorithm in large samples of airborne gamma spectra,this study considered the measured data from the Saihangaobi survey area as an example to conduct data spectral analysis.The results show that calculation of the single-peak area takes only 0.13~0.15 ms,and the average relative errors of the peak area in the U,Th,and K spectra are 3.11,9.50,and 6.18%,indicating the high processing efficiency and accuracy of this algorithm.The performance of the model can be further improved by optimizing related parameters,but it can already meet the requirements of practical engineering measurement.This study provides a new idea for the full-spectrum processing of airborne gamma rays.

A ε-indicator-based shuffled frog leaping algorithm for many-objective optimization problems

Many-objective optimization problems take challenges to multi-objective evolutionary algorithms.A number of nondominated solutions in population cause a difficult selection towards the Pareto front.To tackle this issue,a series of indicatorbased multi-objective evolutionary algorithms(MOEAs)have been proposed to guide the evolution progress and shown promising performance.This paper proposes an indicator-based manyobjective evolutionary algorithm calledε-indicator-based shuffled frog leaping algorithm(ε-MaOSFLA),which adopts the shuffled frog leaping algorithm as an evolutionary strategy and a simple and effectiveε-indicator as a fitness assignment scheme to press the population towards the Pareto front.Compared with four stateof-the-art MOEAs on several standard test problems with up to 50 objectives,the experimental results show thatε-MaOSFLA outperforms the competitors.

一种交叠的Shuffled-BP LDPC译码算法

Shuffled-BP(SBP)译码算法是一种基于变量节点的串行消息传递译码算法,其收敛速度快于原有的置信度传播译码算法,然而由于实际工程实现中的半并行化处理,其收敛速度和误码性能均有所降低。为了进一步提高SBP算法的性能,该文提出一种交叠的Shuffled-BP(Overlapped Shuffled-BP,OSBP)译码算法。该算法采用若干个相同的子译码器以不同的更新顺序同时进行更新,对于每个变量节点,在每次迭代更新后选取最可靠的信息参与下一次迭代,以此提高迭代的收敛速度。理论分析和仿真实验均表明,在不增加额外存储空间的条件下,OSBP算法相比于SBP算法有着更优的误码性能以及更快的收敛速度。此外,提出的OSBP算法对于规则和不规则LDPC码均有效。

Test Case Prioritization in Unit and Integration Testing:A Shuffled-Frog-Leaping Approach

Both unit and integration testing are incredibly crucial for almost any software application because each of them operates a distinct process to examine the product.Due to resource constraints,when software is subjected to modifications,the drastic increase in the count of test cases forces the testers to opt for a test optimization strategy.One such strategy is test case prioritization(TCP).Existing works have propounded various methodologies that re-order the system-level test cases intending to boost either the fault detection capabilities or the coverage efficacy at the earliest.Nonetheless,singularity in objective functions and the lack of dissimilitude among the re-ordered test sequences have degraded the cogency of their approaches.Considering such gaps and scenarios when the meteoric and continuous updations in the software make the intensive unit and integration testing process more fragile,this study has introduced a memetics-inspired methodology for TCP.The proposed structure is first embedded with diverse parameters,and then traditional steps of the shuffled-frog-leaping approach(SFLA)are followed to prioritize the test cases at unit and integration levels.On 5 standard test functions,a comparative analysis is conducted between the established algorithms and the proposed approach,where the latter enhances the coverage rate and fault detection of re-ordered test sets.Investigation results related to the mean average percentage of fault detection(APFD)confirmed that the proposed approach exceeds the memetic,basic multi-walk,PSO,and optimized multi-walk by 21.7%,13.99%,12.24%,and 11.51%,respectively.

An Adaptive Shuffled Frog-Leaping Algorithm for Hybrid-Flow Shop Scheduling with No Precedence Between Some Stages

Hybrid flow shop scheduling problem(HFSP)has been extensively considered,however,some reallife conditions are seldom investigated.In this study,HFsP with no precedence between some stages is solved and an adaptive shuffled frog-leaping algorithm(ASFLA)is developed to optimize makespan.A new solution representation and a decoding procedure are presented,an adaptive memeplex search and dynamical population shuffling are implemented together.Many computational experiments are implemented.Computational results prove that the new strategies of ASFLA are effective and ASFLA is very competitive in solving HFSP with no precedence between some stages.

Genetic-Frog-Leaping Algorithm for Text Document Clustering

In recent years,the volume of information in digital form has increased tremendously owing to the increased popularity of the World Wide Web.As a result,the use of techniques for extracting useful information from large collections of data,and particularly documents,has become more necessary and challenging.Text clustering is such a technique;it consists in dividing a set of text documents into clusters(groups),so that documents within the same cluster are closely related,whereas documents in different clusters are as different as possible.Clustering depends on measuring the content(i.e.,words)of a document in terms of relevance.Nevertheless,as documents usually contain a large number of words,some of them may be irrelevant to the topic under consideration or redundant.This can confuse and complicate the clustering process and make it less accurate.Accordingly,feature selection methods have been employed to reduce data dimensionality by selecting the most relevant features.In this study,we developed a text document clustering optimization model using a novel genetic frog-leaping algorithm that efficiently clusters text documents based on selected features.The proposed approach is based on two metaheuristic algorithms:a genetic algorithm(GA)and a shuffled frog-leaping algorithm(SFLA).The GA performs feature selection,and the SFLA performs clustering.To evaluate its effectiveness,the proposed approach was tested on a well-known text document dataset:the“20Newsgroup”dataset from the University of California Irvine Machine Learning Repository.Overall,after multiple experiments were compared and analyzed,it was demonstrated that using the proposed algorithm on the 20Newsgroup dataset greatly facilitated text document clustering,compared with classical K-means clustering.Nevertheless,this improvement requires longer computational time.

Construction of Quasi-Cyclic Low-Density Parity-Check Codes for Simplifying Shuffle Networks in Layered Decoder

Offset Shuffle Networks(OSNs) interleave a-posterior probability messages in the Block Row-Layered Decoder(BRLD) of QuasiCyclic Low-Density Parity-Check(QC-LDPC)codes.However,OSNs usually consume a significant amount of computational resources and limit the clock frequency,particularly when the size of the Circulant Permutation Matrix(CPM)is large.To simplify the architecture of the OSN,we propose a Simplified Offset Shuffle Network Block Progressive Edge-Growth(SOSNBPEG) algorithm to construct a class of QCLDPC codes.The SOSN-BPEG algorithm constrains the shift values of CPMs and the difference of the shift values in the same column by progressively appending check nodes.Simulation results indicate that the error performance of the SOSN-BPEG codes is the same as that of the codes in WiMAX and DVB-S2.The SOSNBPEG codes can reduce the complexity of the OSNs by up to 54.3%,and can improve the maximum frequency by up to 21.7%for various code lengths and rates.

基于离散混合蛙跳算法的地震应急物资调度

建立震后应急物资调度数学模型。该模型根据各灾区的受灾情况评估其救援紧急程度,并设计一种需求拆分供应的运输机制,提高车辆的利用效率。为求解该模型,提出一种多源信息学习的离散混合蛙跳算法。所提算法引入多种信息源以扩展算法的搜索方向,降低种群的同化速度。同时,让子组最差个体学习种群中的有效信息,提高算法的收敛精度。实验结果表明,所提算法能够搜索到精度更优的调度方案,对问题规模具有良好的可扩展性。

基于改进SFLA-Elman神经网络的电离层杂波抑制方法

针对高频地波雷达目标检测中电离层杂波的干扰问题,提出了一种基于改进混合蛙跳算法优化Elman神经网络预测抑制电离层杂波的策略。为解决混合蛙跳算法初始种群分布不均匀、收敛精度低、易陷于局部极值等问题,引入Cubic混沌映射、莱维飞行策略、非线性平衡因子和复制操作,增强种群多样性,提高算法搜索能力。利用改进后的算法和其他算法分别优化Elman神经网络预测抑制模型,结果表明,改进后的算法无论是在收敛精度和稳定性上,还是在临近距离单元电离层杂波的预测抑制上,都取得了显著的提升。在基本保留目标信号的基础上,平均信杂比较原始回波提升18.52 dB,较原始混合蛙跳算法提升1.08 dB,对于电离层杂波的抑制具有较高应用价值。

基于RF-SFLA-SVM的装配式建筑高空作业工人不安全行为预警

为有效预警装配式建筑高空作业工人不安全行为的发生趋势或状态,增强对装配式建筑工人不安全行为(PBWUBs)的管控,采用随机森林(RF)-混合蛙跳算法(SFLA)-支持向量机(SVM)模型,开展工人不安全行为预警研究。首先,采用SHEL模型分析处于高空作业危险中的PBWUBs的影响因素,并通过RF确定关键预警指标;然后,采用SFLA对SVM的参数进行寻优改进;最后,利用RF-SFLA-SVM预警高空作业PBWUBs,提出应对措施,并与其他预警模型对比。研究结果表明:基于RF-SFLA-SVM预警高空作业PBWUBs,准确率最高,为91.67%,与其他模型的预警性能相比,最高提升14%。研究结果可为高空作业PBWUBs的防控提供参考。

输电网中储能电站的智能预测系统设计

针对输电网中风电场与储能电站的容量配置问题,设计了一种输电网中储能电站的智能预测系统。采用直流系统、站用电低压系统、监控系统、微机保护装置、测控装置、计量装置、人工智能、5G移动通信以及综合自动化设备,创建智能预测系统。通过基于混合蛙跳算法(SFLA)的人工智能,实现储能电站容量的计算、研究、预测,同时对储能电站进行优化配置。将外连接口与卡线器进行对接。通过传感设备采集检测单元需要的硬件信息、运行状态、设备情况和额定负载等数据,并对数据进行优化。试验结果表明,该系统在储能电站的预测精准度高达90%以上。该系统对解决电能浪费问题具有较强的实用性,也符合储能电站的特性。

混合蛙跳算法在旋转货架货位优化中的应用

以集群旋转式货架存储货物的自动化立体仓库为研究对象,以提高货架整体和运动状态的单层稳定性、货物相关性和出入库效率等基本货位优化原则为目标,提出一种通用性较强的多参数混合蛙跳算法,对多目标优化问题进行建模,使用MATLAB工具进行仿真。通过实验结果的对比可知,多参数混合蛙跳算法比混合蛙跳算法具有一定的优越性,并且对于分析其他问题的适应性较强,对于多目标优化问题具有一定的理论意义。

基于改进的MobilenetV3热轧钢带表面缺陷分类

提出一种基于轻量化神经网络MobilenetV3-large改进的热轧钢带表面缺陷分类算法,通过剪枝、大量削减卷积层数、调整通道大小和步长,以及修改对应的网络参数快速降低了参数量.为弥补修改模型带来的准确率下降的问题,将激活函数ReLU更换为Hard-Swish,引入置换注意力机制替换原模型中的通道注意力机制,在进一步降低参数量的同时提高运行效率和分类准确率.在NEU-CLS表面缺陷数据集中的试验结果表明,改进后的算法参数量为0.5 MB,相比原模型降低96.89%,训练图片的时间由19.81 ms/幅降至10.73 ms/幅,平均准确率为99.26%,比改进前提高了5.56%,表明改进后的算法可应用于实时分类.

混合蛙跳算法求解车辆无人机协同配送问题

为了充分发挥无人机与车辆各自的优势,研究无人机起飞后可服务多个客户的车辆-无人机协同配送问题,其中考虑了车辆因区域限制、无人机因载重和续航限制导致2类运输工具配送范围均受到限制的约束.针对这类运输工具配送受限的车辆-多投递无人机协同配送问题(MDVCP-DR),以最小化总配送时间为优化目标,建立对应的数学模型,提出混合蛙跳算法(HSFLA)进行求解.提出新的编码与预调整解码方法,得到满足各种约束的可行解.建立基于4种交叉算子和精英表的个体生成方法,更新种群中的个体.设计自适应局部搜索策略来增强算法的局部开发能力,通过种群多样性检测策略来保证个体的多样性.通过仿真实验,验证了建立的数学模型的正确性和HSFLA的有效性.