Optimal search path planning of UUV in battlefeld ambush scene

Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat.

BHJO: A Novel Hybrid Metaheuristic Algorithm Combining the Beluga Whale, Honey Badger, and Jellyfish Search Optimizers for Solving Engineering Design Problems

Hybridizing metaheuristic algorithms involves synergistically combining different optimization techniques to effectively address complex and challenging optimization problems.This approach aims to leverage the strengths of multiple algorithms,enhancing solution quality,convergence speed,and robustness,thereby offering a more versatile and efficient means of solving intricate real-world optimization tasks.In this paper,we introduce a hybrid algorithm that amalgamates three distinct metaheuristics:the Beluga Whale Optimization(BWO),the Honey Badger Algorithm(HBA),and the Jellyfish Search(JS)optimizer.The proposed hybrid algorithm will be referred to as BHJO.Through this fusion,the BHJO algorithm aims to leverage the strengths of each optimizer.Before this hybridization,we thoroughly examined the exploration and exploitation capabilities of the BWO,HBA,and JS metaheuristics,as well as their ability to strike a balance between exploration and exploitation.This meticulous analysis allowed us to identify the pros and cons of each algorithm,enabling us to combine them in a novel hybrid approach that capitalizes on their respective strengths for enhanced optimization performance.In addition,the BHJO algorithm incorporates Opposition-Based Learning(OBL)to harness the advantages offered by this technique,leveraging its diverse exploration,accelerated convergence,and improved solution quality to enhance the overall performance and effectiveness of the hybrid algorithm.Moreover,the performance of the BHJO algorithm was evaluated across a range of both unconstrained and constrained optimization problems,providing a comprehensive assessment of its efficacy and applicability in diverse problem domains.Similarly,the BHJO algorithm was subjected to a comparative analysis with several renowned algorithms,where mean and standard deviation values were utilized as evaluation metrics.This rigorous comparison aimed to assess the performance of the BHJOalgorithmabout its counterparts,shedding light on its effectiveness and reliability in solving optimization problems.Finally,the obtained numerical statistics underwent rigorous analysis using the Friedman post hoc Dunn’s test.The resulting numerical values revealed the BHJO algorithm’s competitiveness in tackling intricate optimization problems,affirming its capability to deliver favorable outcomes in challenging scenarios.

Optimal searching for a Helix target motion

This paper discusses a search problem for a Helix target motion in which any information of the target position is not available to the searchers. There exist three searchers start searching for the target from the origin. The purpose of this paper is to formulate a search model and finds the conditions under which the expected value of the first meeting time between one of the searchers and the target is finite. Also, the existence of the optimal search plan that minimizes the expected value of the first meeting time is shown. Furthermore,this optimal search plan is found. The effectiveness of this method is illustrated by using an example with numerical results.

Estimation of state of health based on charging characteristics and back-propagation neural networks with improved atom search optimization algorithm

With the rapid development of new energy technologies, lithium batteries are widely used in the field of energy storage systems and electric vehicles. The accurate prediction for the state of health(SOH) has an important role in maintaining a safe and stable operation of lithium-ion batteries. To address the problems of uncertain battery discharge conditions and low SOH estimation accuracy in practical applications, this paper proposes a SOH estimation method based on constant-current battery charging section characteristics with a back-propagation neural network with an improved atom search optimization algorithm. A temperature characteristic, equal-time temperature variation(Dt_DT), is proposed by analyzing the temperature data of the battery charging section with the incremental capacity(IC) characteristics obtained from an IC analysis as an input to the data-driven prediction model. Testing and analysis of the proposed prediction model are carried out using publicly available datasets. Experimental results show that the maximum error of SOH estimation results for the proposed method in this paper is below 1.5%.

Enhanced Atom Search Optimization Based Optimal Control Parameter Tunning of PMSG for MPPT

For the past few years,wind energy is the most popular non-traditional resource among renewable energy resources and it’s significant to make full use of wind energy to realize a high level of generating power.Moreover,diverse maximum power point tracking(MPPT)methods have been designed for varying speed operation of wind energy conversion system(WECS)applications to obtain optimal power extraction.Hence,a novel and metaheuristic technique,named enhanced atom search optimization(EASO),is designed for a permanent magnet synchronous generator(PMSG)based WECS,which can be employed to track the maximum power point.One of the most promising benefits of this technique is powerful global search capability that leads to fast response and high-quality optimal solution.Besides,in contrast with other conventional meta-heuristic techniques,EASO is extremely not relying on the original solution,which can avoid sinking into a low-quality local maximum power point(LMPP)by realizing an appropriate trade-off between global exploration and local exploitation.At last,simulations employing two case studies through Matlab/Simulink validate the practicability and effectiveness of the proposed techniques for optimal proportional-integral-derivative(PID)control parameters tuning of PMSG based WECS under a variety of wind conditions.

Improved Transient Search Optimization with Machine Learning Based Behavior Recognition on Body Sensor Data

Recently,human healthcare from body sensor data has gained considerable interest from a wide variety of human-computer communication and pattern analysis research owing to their real-time applications namely smart healthcare systems.Even though there are various forms of utilizing distributed sensors to monitor the behavior of people and vital signs,physical human action recognition(HAR)through body sensors gives useful information about the lifestyle and functionality of an individual.This article concentrates on the design of an Improved Transient Search Optimization with Machine Learning based BehaviorRecognition(ITSOMLBR)technique using body sensor data.The presented ITSOML-BR technique collects data from different body sensors namely electrocardiography(ECG),accelerometer,and magnetometer.In addition,the ITSOML-BR technique extract features like variance,mean,skewness,and standard deviation.Moreover,the presented ITSOML-BR technique executes a micro neural network(MNN)which can be employed for long term healthcare monitoring and classification.Furthermore,the parameters related to the MNN model are optimally selected via the ITSO algorithm.The experimental result analysis of the ITSOML-BR technique is tested on the MHEALTH dataset.The comprehensive comparison study reported a higher result for the ITSOMLBR approach over other existing approaches with maximum accuracy of 99.60%.

IoT-Driven Optimal Lightweight RetinaNet-Based Object Detection for Visually Impaired People

Visual impairment is one of the major problems among people of all age groups across the globe.Visually Impaired Persons(VIPs)require help from others to carry out their day-to-day tasks.Since they experience several problems in their daily lives,technical intervention can help them resolve the challenges.In this background,an automatic object detection tool is the need of the hour to empower VIPs with safe navigation.The recent advances in the Internet of Things(IoT)and Deep Learning(DL)techniques make it possible.The current study proposes IoT-assisted Transient Search Optimization with a Lightweight RetinaNetbased object detection(TSOLWR-ODVIP)model to help VIPs.The primary aim of the presented TSOLWR-ODVIP technique is to identify different objects surrounding VIPs and to convey the information via audio message to them.For data acquisition,IoT devices are used in this study.Then,the Lightweight RetinaNet(LWR)model is applied to detect objects accurately.Next,the TSO algorithm is employed for fine-tuning the hyperparameters involved in the LWR model.Finally,the Long Short-Term Memory(LSTM)model is exploited for classifying objects.The performance of the proposed TSOLWR-ODVIP technique was evaluated using a set of objects,and the results were examined under distinct aspects.The comparison study outcomes confirmed that the TSOLWR-ODVIP model could effectually detect and classify the objects,enhancing the quality of life of VIPs.

Search and Rescue Optimization with Machine Learning Enabled Cybersecurity Model

Presently,smart cities play a vital role to enhance the quality of living among human beings in several ways such as online shopping,e-learning,ehealthcare,etc.Despite the benefits of advanced technologies,issues are also existed from the transformation of the physical word into digital word,particularly in online social networks(OSN).Cyberbullying(CB)is a major problem in OSN which needs to be addressed by the use of automated natural language processing(NLP)and machine learning(ML)approaches.This article devises a novel search and rescue optimization with machine learning enabled cybersecurity model for online social networks,named SRO-MLCOSN model.The presented SRO-MLCOSN model focuses on the identification of CB that occurred in social networking sites.The SRO-MLCOSN model initially employs Glove technique for word embedding process.Besides,a multiclass-weighted kernel extreme learning machine(M-WKELM)model is utilized for effectual identification and categorization of CB.Finally,Search and Rescue Optimization(SRO)algorithm is exploited to fine tune the parameters involved in the M-WKELM model.The experimental validation of the SRO-MLCOSN model on the benchmark dataset reported significant outcomes over the other approaches with precision,recall,and F1-score of 96.24%,98.71%,and 97.46%respectively.

Comparison of Websites Employing Search Engine Optimization and Live Data

This study compares websites that take live data into account using search engine optimization(SEO).A series of steps called search engine optimization can help a website rank highly in search engine results.Static websites and dynamic websites are two different types of websites.Static websites must have the necessary expertise in programming compatible with SEO.Whereas in dynamic websites,one can utilize readily available plugins/modules.The fundamental issue of all website holders is the lower level of page rank,congestion,utilization,and exposure of the website on the search engine.Here,the authors have studied the live data of four websites as the real-time data would indicate how the SEO strategy may be applied to website page rank,page difficulty removal,and brand query,etc.It is also necessary to choose relevant keywords on any website.The right keyword might assist to increase the brand query while also lowering the page difficulty both on and off the page.In order to calculate Off-page SEO,On-page SEO,and SEO Difficulty,the authors examined live data in this study and chose four well-known Indian university and institute websites for this study:www.caluniv.ac.in,www.jnu.ac.in,www.iima.ac.in,and www.iitb.ac.in.Using live data and SEO,the authors estimated the Off-page SEO,On-page SEO,and SEO Difficulty.It has been shown that the Off-page SEO of www.caluniv.ac.in is lower than that of www.jnu.ac.in,www.iima.ac.in,and www.iitb.ac.in by 9%,7%,and 7%,respectively.On-page SEO is,in comparison,4%,1%,and 1%more.Every university has continued to keep up its own brand query.Additionally,www.caluniv.ac.in has slightly less SEO Difficulty compared to other websites.The final computed results have been displayed and compared.

The optimal fractional Gabor transform based on the adaptive window function and its application

We designed the window function of the optimal Gabor transform based on the time-frequency rotation property of the fractional Fourier transform. Thus, we obtained the adaptive optimal Gabor transform in the fractional domain and improved the time-frequency concentration of the Gabor transform. The algorithm first searches for the optimal rotation factor, then performs the p-th FrFT of the signal and, finally, performs time and frequency analysis of the FrFT result. Finally, the algorithm rotates the plane in the fractional domain back to the normal time-frequency plane. This promotes the application of FrFT in the field of high-resolution reservoir prediction. Additionally, we proposed an adaptive search method for the optimal rotation factor using the Parseval principle in the fractional domain, which simplifies the algorithm. We carried out spectrum decomposition of the seismic signal, which showed that the instantaneous frequency slices obtained by the proposed algorithm are superior to the ones obtained by the traditional Gabor transform. The adaptive time frequency analysis is of great significance to seismic signal processing.

LINEAR SEARCH FOR A BROWNIAN TARGET MOTION

A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point. The object is to detect the target. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite, and to show the existence of a search plan which made this expected value minimum.

A Hybrid Algorithm Based on Differential Evolution and Group Search Optimization and Its Application on Ethylene Cracking Furnace

To find the optimal operational condition when the properties of feedstock changes in the cracking furnace online,a hybrid algorithm named differential evolution group search optimization(DEGSO) is proposed,which is based on the differential evolution(DE) and the group search optimization(GSO).The DEGSO combines the advantages of the two algorithms:the high computing speed of DE and the good performance of the GSO for preventing the best particle from converging to local optimum.A cooperative method is also proposed for switching between these two algorithms.If the fitness value of one algorithm keeps invariant in several generations and less than the preset threshold,it is considered to fall into the local optimization and the other algorithm is chosen.Experiments on benchmark functions show that the hybrid algorithm outperforms GSO in accuracy,global searching ability and efficiency.The optimization of ethylene and propylene yields is illustrated as a case by DEGSO.After optimization,the yield of ethylene and propylene is increased remarkably,which provides the proper operational condition of the ethylene cracking furnace.

Soft Sensor for Ammonia Concentration at the Ammonia Converter Outlet Based on an Improved Group Search Optimization and BP Neural Network

The ammonia synthesis reactor is the core unit in the whole ammonia synthesis production. The ammonia concentration at the ammonia converter outlet is a significant process variable, which reflects directly the production efficiency. However, it is hard to be measured reliably online in real applications. In this paper, a soft sensor based on BP neural network (BPNN) is applied to estimate the ammonia concentration. A modified group search optimization with nearest neighborhood (GSO-NH) is proposed to optimize the weights and thresholds of BPNN. GSO-NH is integrated with BPNN to build a soft sensor model. Finally, the soft sensor model based on BPNN and GSO-NH (GSO-NH-NN) is used to infer the outlet ammonia concentration in a real-world application. Three other modeling methods are applied for comparison with GSO-NH-NN. The results show that the soft sensor based on GSO-NH-NN has a good prediction performance with high accuracy. Moreover, the GSO-NH-NN also provides good generalization ability to other modeling problems in ammonia synthesis production.

Artificial bee colony algorithm with comprehensive search mechanism for numerical optimization

The artificial bee colony （ABC） algorithm is a sim- ple and effective global optimization algorithm which has been successfully applied in practical optimization problems of various fields. However, the algorithm is still insufficient in balancing ex- ploration and exploitation. To solve this problem, we put forward an improved algorithm with a comprehensive search mechanism. The search mechanism contains three main strategies. Firstly, the heuristic Gaussian search strategy composed of three different search equations is proposed for the employed bees, which fully utilizes and balances the exploration and exploitation of the three different search equations by introducing the selectivity probability P,. Secondly, in order to improve the search accuracy, we propose the Gbest-guided neighborhood search strategy for onlooker bees to improve the exploitation performance of ABC. Thirdly, the self- adaptive population perturbation strategy for the current colony is used by random perturbation or Gaussian perturbation to en- hance the diversity of the population. In addition, to improve the quality of the initial population, we introduce the chaotic opposition- based learning method for initialization. The experimental results and Wilcoxon signed ranks test based on 27 benchmark func- tions show that the proposed algorithm, especially for solving high dimensional and complex function optimization problems, has a higher convergence speed and search precision than ABC and three other current ABC-based algorithms.

Adaptive backtracking search optimization algorithm with pattern search for numerical optimization

The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.

BHGSO:Binary Hunger Games Search Optimization Algorithm for Feature Selection Problem

In machine learning and data mining,feature selection(FS)is a traditional and complicated optimization problem.Since the run time increases exponentially,FS is treated as an NP-hard problem.The researcher’s effort to build a new FS solution was inspired by the ongoing need for an efficient FS framework and the success rates of swarming outcomes in different optimization scenarios.This paper presents two binary variants of a Hunger Games Search Optimization(HGSO)algorithm based on V-and S-shaped transfer functions within a wrapper FS model for choosing the best features from a large dataset.The proposed technique transforms the continuous HGSO into a binary variant using V-and S-shaped transfer functions(BHGSO-V and BHGSO-S).To validate the accuracy,16 famous UCI datasets are considered and compared with different state-of-the-art metaheuristic binary algorithms.The findings demonstrate that BHGSO-V achieves better performance in terms of the selected number of features,classification accuracy,run time,and fitness values than other state-of-the-art algorithms.The results demonstrate that the BHGSO-V algorithm can reduce dimensionality and choose the most helpful features for classification problems.The proposed BHGSO-V achieves 95%average classification accuracy for most of the datasets,and run time is less than 5 sec.for low and medium dimensional datasets and less than 10 sec for high dimensional datasets.

Free Search Algorithm Based Estimation in WSN Location

This paper proposes a novel intelligent estimation algorithm in Wireless Sensor Network nodes location based on Free Search,which converts parameter estimation to on-line optimization of nonlinear function and estimates the coordinates of senor nodes using the Free Search optimization.Compared to the least-squares estimation algorithms,the localization accuracy has been increased significantly,which has been verified by the simulation results.

Optimizing combination of aircraft maintenance tasks by adaptive genetic algorithm based on cluster search

It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.

AModified Search and Rescue Optimization Based Node Localization Technique inWSN

Wireless sensor network(WSN)is an emerging technology which find useful in several application areas such as healthcare,environmentalmonitoring,border surveillance,etc.Several issues that exist in the designing of WSN are node localization,coverage,energy efficiency,security,and so on.In spite of the issues,node localization is considered an important issue,which intends to calculate the coordinate points of unknown nodes with the assistance of anchors.The efficiency of the WSN can be considerably influenced by the node localization accuracy.Therefore,this paper presents a modified search and rescue optimization based node localization technique(MSRONLT)forWSN.The major aim of theMSRO-NLT technique is to determine the positioning of the unknown nodes in theWSN.Since the traditional search and rescue optimization(SRO)algorithm suffers from the local optima problemwith an increase in number of iterations,MSRO algorithm is developed by the incorporation of chaotic maps to improvise the diversity of the technique.The application of the concept of chaotic map to the characteristics of the traditional SRO algorithm helps to achieve better exploration ability of the MSRO algorithm.In order to validate the effective node localization performance of the MSRO-NLT algorithm,a set of simulations were performed to highlight the supremacy of the presented model.A detailed comparative results analysis showcased the betterment of the MSRO-NLT technique over the other compared methods in terms of different measures.

Integrating Tabu Search in Particle Swarm Optimization for the Frequency Assignment Problem

In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency spectrum. In order to satisfy the increasing demand in such cellular mobile networks, we use a hybrid approach consisting of a Particle Swarm Optimization(PSO) combined with a Tabu Search(TS) algorithm. This approach takes both advantages of PSO efficiency in global optimization and TS in avoiding the premature convergence that would lead PSO to stagnate in a local minimum. Moreover, we propose a new efficient, simple, and inexpensive model for storing and evaluating solution's assignment. The purpose of this model reduces the solution's storage volume as well as the computations required to evaluate thesesolutions in comparison with the classical model. Our simulation results on the most known benchmarking instances prove the effectiveness of our proposed algorithm in comparison with previous related works in terms of convergence rate, the number of iterations, the solution storage volume and the running time required to converge to the optimal solution.