Shuffled complex evolution coupled with stochastic ranking for reservoir scheduling problems

This paper introduces an optimization method(SCE-SR)that combines shuffled complex evolution(SCE)and stochastic ranking(SR)to solve constrained reservoir scheduling problems,ranking individuals with both objectives and constrains considered.A specialized strategy is used in the evolution process to ensure that the optimal results are feasible individuals.This method is suitable for handling multiple conflicting constraints,and is easy to implement,requiring little parameter tuning.The search properties of the method are ensured through the combination of deterministic and probabilistic approaches.The proposed SCE-SR was tested against hydropower scheduling problems of a single reservoir and a multi-reservoir system,and its performance is compared with that of two classical methods(the dynamic programming and genetic algorithm).The results show that the SCE-SR method is an effective and efficient method for optimizing hydropower generation and locating feasible regions quickly,with sufficient global convergence properties and robustness.The operation schedules obtained satisfy the basic scheduling requirements of reservoirs.

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.

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.

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.

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.

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.

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.

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.

Recognition of practical speech emotion using improved shuffled frog leaping algorithm

Due to the drawbacks in Support Vector Machine（SVM）parameter optimization,an Improved Shuffled Frog Leaping Algorithm（Im-SFLA）was proposed,and the learning ability in practical speech emotion recognition was improved.Firstly,we introduced Simulated Annealing（SA）,Immune Vaccination（Iv）,Gaussian mutation and chaotic disturbance into the basic SFLA,which bManced the search efficiency and population diversity effectively.Secondly,Im-SFLA Was applied to the optimization of SVM parameters,and an Im-SFLA-SVM method Was proposed.Thirdly,the acoustic features of practical speech emotion,such aS ridgetiness,were analyzed.The pitch frequency,short-term energy,formant frequency and chaotic characteristics were analyzed corresponding to different emotion categories,and we constructed a 144-dimensional emotion feature vector for recognition and reduced to 4-dimension by adopting Linear Discriminant Analysis（LDA） Finally,the Im-SFLA-SVM method Was tested on the practical speech emotion database,and the recognition results were compared with Shuffled Frog Leaping Algorithm optimization-SVM（SFLA-SVM）method,Particle Swarm Optimization algorithm optimization-SVM（PSo-SVM） method,basic SVM,Gaussian Mixture Model（GMM）method and Back Propagation（BP）neural network method.The experimentM resuits showed that the average recognition rate of Im-SFLA-SVM method was 77.8%,which had improved 1.7%,2.7%,3.4%,4.7%and 7.8%respectively,compared with the other methods.The recognition of fidgetiness was significantly improve,thus verifying that Im-SFLA was an effective SVM parameter selection method,and the Im-SFLA-SVM method may significantly improve the practical speech emotion recognition.

Replica horizontal-shuffled iterative decoding of low-density parity-check codes

For practical considerations,it is essential to accelerate the convergence speed of the decoding algorithm used in an iterative decoding system. In this paper,replica versions of horizontal-shuffled decoding algorithms for low-density parity-check （LDPC） codes are proposed to improve the convergence speed of the original versions. The extrinsic information transfer （EXIT） chart technique is extended to the proposed algorithms to predict their convergence behavior. Both EXIT chart analysis and numerical results show that replica plain horizontal-shuffled （RPHS） decoding converges much faster than both plain horizontal-shuffled （PHS） decoding and the standard belief-propagation （BP） decoding. Furthermore,it is also revealed that replica group horizontal-shuffled （RGHS） decoding can increase the parallelism of RPHS decoding as well as preserve its high convergence speed if an equivalence condition is satisfied,and is thus suitable for hardware implementation.

Group Shuffled BP算法的密度演进和高斯近似

为了分析Group Shuffled BP译码算法的收敛性能,同时简化密度演进计算的复杂度,在证明对称性条件的基础上,提出了基于Group Shuffled BP译码算法的密度演进的高斯近似。从而将密度演进中计算消息概率密度的无限维问题,简化为跟踪高斯分布均值的一维问题。仿真结果表明,该方法具有较高的精确度,可以有效分析Group Shuffled BP译码算法的收敛性能。

基于SAW-YOLO v8n的葡萄幼果轻量化检测方法

葡萄簇幼果果实受背景色、遮挡和光照变化的影响,检测难度大。为了实现对背景色、遮挡和光照变化具有鲁棒性的葡萄簇幼果检测,提出了一种融合随机注意力机制(Shuffle attention,SA)的改进YOLO v8n模型(SAW-YOLO v8n)。通过在YOLO v8n模型的Neck结构中融入SA机制,增强网络多尺度特征融合能力,提升检测目标的特征信息表示,并抑制其他无关信息,提高检测网络检测精度,在不明显增加网络深度和内存开销的情况下,实现了葡萄簇幼果的高效准确检测;采用基于动态非单调聚焦机制的损失(Wise intersection over union loss,Wise-IoU Loss)作为边界框回归损失函数,加速网络收敛并进一步提高模型的准确率。构建了葡萄簇幼果的数据集GGrape,该数据集由3780幅复杂场景下的葡萄簇幼果图像及对应标注文件组成。通过该数据集对SAW-YOLO v8n模型进行训练和测试。测试结果表明,基于SAW-YOLO v8n的葡萄簇幼果检测算法的精度(Precision,P)、召回率(Recall,R)、平均精度均值(Mean average precision,mAP)和F1值分别为92.80%、91.30%、96.10%和92.04%,检测速度为140.85 f/s,模型内存占用量为6.20 MB。与SSD、YOLO v5s、YOLO v6n、YOLO v7-tiny、YOLO v8n等5个轻量化模型相比,其mAP值分别提高16.06%、1.05%、1.48%、0.84%、0.73%,F1值分别提高24.85%、1.43%、1.43%、1.09%、1.60%,模型内存占用量分别降低93.16%、56.94%、37.63%、47.00%、0,是所有模型中最小的,具有明显的轻量化、高精度优势。讨论了不同遮挡程度和光照条件的葡萄幼果检测,结果表明,基于SAW-YOLO v8n的葡萄幼果检测方法能适应不同遮挡和光照变化,具有良好的鲁棒性。结果表明,SAW-YOLO v8n不仅能满足对葡萄簇幼果检测的高精度、高速度、轻量化的要求,且具有较强的鲁棒性和实时性。

基于CAM-YOLOX的大场景SAR图像近岸场景舰船目标检测

针对大场景SAR图像近岸场景舰船目标检测中遇到的陆地目标虚警和岸边目标漏检等问题,基于YOLOX设计了一种轻量化的改进模型CAM-YOLOX。首先,在骨干部分嵌入CAM,增强舰船特征提取以保持较高的检测性能;其次,在特征金字塔网络结构中增加一个浅层分支,以增强对小目标特征的提取能力;最后,在特征融合网络中用Shuffle unit替换CSPLayer中的CBS和堆叠的Bottleneck结构,实现了模型压缩。在LS-SSDD-v1.0遥感数据集上进行实验,实验结果表明,本文改进算法相较于原始算法在近岸场景舰船检测的精确率P提高了5.51%,召回率R提高了3.68%,模型参数量减小了16.33%。本文算法能在不增加模型参数量的情况下,有效抑制近岸场景中陆地上的虚警和减少岸边舰船漏检率。

基于改进YOLOv7的SAR图像舰船目标检测算法

针对SAR舰船数据集小物体在图像中像素占比小、物体识别不清、检测效率低等问题,提出一种改进YOLOv7的SAR舰船目标检测算法STSD-YOLO。首先,根据SAR图像特点,重新设计网络结构,改变多尺度特征融合与特征提取的关系,解决下采样次数过多而丢失细节特征的问题;然后,使用轻量型注意力机制Shuffle Attention,在空间域与通道域注意力机制基础上,融合特征分组与通道置换,提升网络特征提取能力,降低计算复杂度;其次,引入卷积变体DSConv,通过在可变量化内核中仅储存整数来实现减少计算量;最后,加入NWD度量,将边界框建模为2D高斯分布,以衡量小物体的边界框之间的相似性来增强对小物体的检测性能。使用HRSID舰船数据集进行了实验验证,结果表明,相较于基准算法,所提STSD-YOLO算法在舰船检测任务中mAP提升9.9%,模型体积下降62.55%。通过对比实验验证,所提改进算法对比其余主流算法检测效果更优,能有效解决SAR图像检测的问题,可以胜任SAR图像中的舰船检测任务。

基于改进YOLOv8的轻量型车辆目标检测算法

针对现有交通监控场景下车辆目标检测算法参数多、计算量大,难以在资源有限的设备中部署的问题,提出一种基于YOLOv8改进的轻量型车辆目标检测算法GSE-YOLO。结合Ghost卷积技术,设计出一种轻量型特征提取模块C2fGhostv2,在减少计算负担的同时保证良好的特征提取能力。在颈部网络,引入SA(shu ffl e attention)注意力机制,主动选择合适的特征图权重凸显重要特征信息,减少背景对车辆检测的干扰。引入新的损失函数EIOU,解决边界框的纵横比模糊问题,提高预测框精度。实验结果表明,在交通数据集UA-DETRAC上,GSE-YOLO在检测精度没有损失的情况下,相较于原始YOLOv8参数量降低36.11%,计算量降低29.21%,更适合在计算量有限的边缘设备上部署,具有实用价值。

基于改进YOLOv7的高分二号遥感影像滑坡识别算法研究

为快速准确地识别滑坡地质灾害,本文提出基于YOLOv7的轻量滑坡检测模型。实验结果表明,改进后YOLOv7网络模型整体mAP达到94.6%,与原始YOLOv7网络模型相比,参数量减少了20.8M,计算量减少47.3G,整体mAP0.5提高3.8%,检测速度FPS提高14.3f/s,对滑坡灾害具有出色的检测效果。

权重改进的蛙跳算法优化PID参数

针对非线性、大延迟、时变的控制系统,传统的PID控制效果不理想,为此提出用蛙跳(shuffled frog leaping algorithm,SFLA)仿生优化算法整定PID参数,但传统蛙跳算法易陷入局部最优,收敛速度慢,因此提出权重改进的蛙跳算法(weight improved shuffled frog leaping algorithm,WISFLA)。该算法引入线性递减惯性权重修正最差青蛙的更新策略,可以平衡算法的全局搜索和局部搜索。通过两个经典控制系统的仿真测试,结果表明,WISFLA算法可以平衡算法的全局搜索和局部搜索,比SFLA和PSO(particle swarm optimization)的寻优能力强,迭代次数少,更适合PID参数的整定优化。