Approach to WTA in air combat using IAFSA-IHS algorithm

In this paper, a static weapon target assignment（WTA）problem is studied. As a critical problem in cooperative air combat,outcome of WTA directly influences the battle. Along with the cost of weapons rising rapidly, it is indispensable to design a target assignment model that can ensure minimizing targets survivability and weapons consumption simultaneously. Afterwards an algorithm named as improved artificial fish swarm algorithm-improved harmony search algorithm（IAFSA-IHS） is proposed to solve the problem. The effect of the proposed algorithm is demonstrated in numerical simulations, and results show that it performs positively in searching the optimal solution and solving the WTA problem.

Research on Flight First Service Model and Algorithms for the Gate Assignment Problem

Aiming at the problem of gate allocation of transit flights,a flight first service model is established.Under the constraints of maximizing the utilization rate of gates and minimizing the transit time,the idea of“first flight serving first”is used to allocate the first time,and then the hybrid algorithm of artificial fish swarm and simulated annealing is used to find the optimal solution.That means the fish swarm algorithm with the swallowing behavior is employed to find the optimal solution quickly,and the simulated annealing algorithm is used to obtain a global optimal allocation scheme for the optimal local region.The experimental data show that the maximum utilization of the gate is 27.81%higher than that of the“first come first serve”method when the apron is not limited,and the hybrid algorithm has fewer iterations than the simulated annealing algorithm alone,with the overall passenger transfer tension reducing by 1.615;the hybrid algorithm has faster convergence and better performance than the artificial fish swarm algorithm alone.The experimental results indicate that the hybrid algorithm of fish swarm and simulated annealing can achieve higher utilization rate of gates and lower passenger transfer tension under the idea of“first flight serving first”.

Robust Hybrid Artificial Fish Swarm Simulated Annealing Optimization Algorithm for Secured Free Scale Networks against Malicious Attacks

Due to the recent proliferation of cyber-attacks,highly robust wireless sensor networks(WSN)become a critical issue as they survive node failures.Scale-free WSN is essential because they endure random attacks effectively.But they are susceptible to malicious attacks,which mainly targets particular significant nodes.Therefore,the robustness of the network becomes important for ensuring the network security.This paper presents a Robust Hybrid Artificial Fish Swarm Simulated Annealing Optimization(RHAFS-SA)Algorithm.It is introduced for improving the robust nature of free scale networks over malicious attacks(MA)with no change in degree distribution.The proposed RHAFS-SA is an enhanced version of the Improved Artificial Fish Swarm algorithm(IAFSA)by the simulated annealing(SA)algorithm.The proposed RHAFS-SA algorithm eliminates the IAFSA from unforeseen vibration and speeds up the convergence rate.For experimentation,free scale networks are produced by the Barabási–Albert(BA)model,and real-world networks are employed for testing the outcome on both synthetic-free scale and real-world networks.The experimental results exhibited that the RHAFS-SA model is superior to other models interms of diverse aspects.

Development of an Artificial Fish Swarm Algorithm Based on aWireless Sensor Networks in a Hydrodynamic Background

The main objective of the present study is the development of a new algorithm that can adapt to complex and changeable environments.An artificial fish swarm algorithm is developed which relies on a wireless sensor network(WSN)in a hydrodynamic background.The nodes of this algorithm are viscous fluids and artificial fish,while related‘events’are directly connected to the food available in the related virtual environment.The results show that the total processing time of the data by the source node is 6.661 ms,of which the processing time of crosstalk data is 3.789 ms,accounting for 56.89%.The total processing time of the data by the relay node is 15.492 ms,of which the system scheduling and the Carrier Sense Multiple Access(CSMA)rollback time of the forwarding is 8.922 ms,accounting for 57.59%.The total time for the data processing of the receiving node is 11.835 ms,of which the processing time of crosstalk data is 3.791 ms,accounting for 32.02%;the serial data processing time is 4.542 ms,accounting for 38.36%.Crosstalk packets occupy a certain amount of system overhead in the internal communication of nodes,which is one of the causes of node-level congestion.We show that optimizing the crosstalk phenomenon can alleviate the internal congestion of nodes to some extent.

Artificial Fish Swarm Optimization with Deep Learning Enabled Opinion Mining Approach

Sentiment analysis or opinion mining(OM)concepts become familiar due to advances in networking technologies and social media.Recently,massive amount of text has been generated over Internet daily which makes the pattern recognition and decision making process difficult.Since OM find useful in business sectors to improve the quality of the product as well as services,machine learning(ML)and deep learning(DL)models can be considered into account.Besides,the hyperparameters involved in the DL models necessitate proper adjustment process to boost the classification process.Therefore,in this paper,a new Artificial Fish Swarm Optimization with Bidirectional Long Short Term Memory(AFSO-BLSTM)model has been developed for OM process.The major intention of the AFSO-BLSTM model is to effectively mine the opinions present in the textual data.In addition,the AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process.Besides,BLSTM model is employed for the effectual detection and classification of opinions.Finally,the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model,shows the novelty of the work.A complete simulation study of the AFSO-BLSTM model is validated using benchmark dataset and the obtained experimental values revealed the high potential of the AFSO-BLSTM model on mining opinions.

Optimal Logistics Activities Based Deep Learning Enabled Traffic Flow Prediction Model

Traffic flow prediction becomes an essential process for intelligent transportation systems(ITS).Though traffic sensor devices are manually controllable,traffic flow data with distinct length,uneven sampling,and missing data finds challenging for effective exploitation.The traffic data has been considerably increased in recent times which cannot be handled by traditional mathematical models.The recent developments of statistic and deep learning(DL)models pave a way for the effectual design of traffic flow prediction(TFP)models.In this view,this study designs optimal attentionbased deep learning with statistical analysis for TFP(OADLSA-TFP)model.The presentedOADLSA-TFP model intends to effectually forecast the level of traffic in the environment.To attain this,the OADLSA-TFP model employs attention-based bidirectional long short-term memory(ABLSTM)model for predicting traffic flow.In order to enhance the performance of the ABLSTM model,the hyperparameter optimization process is performed using artificial fish swarm algorithm(AFSA).A wide-ranging experimental analysis is carried out on benchmark dataset and the obtained values reported the enhancements of the OADLSA-TFP model over the recent approaches mean square error(MSE),root mean square error(RMSE),and mean absolute percentage error(MAPE)of 120.342%,10.970%,and 8.146%respectively.

Intelligent approach of score-based artificial fish swarm algorithm(SAFSA)for Parkinson’s disease diagnosis

Purpose-Conventional diagnostic techniques,on the other hand,may be prone to subjectivity since they depend on assessment of motions that are often subtle to individual eyes and hence hard to classify,potentially resulting in misdiagnosis.Meanwhile,early nonmotor signs of Parkinson’s disease(PD)can be mild and may be due to variety of other conditions.As a result,these signs are usually ignored,making early PD diagnosis difficult.Machine learning approaches for PD classification and healthy controls or individuals with similar medical symptoms have been introduced to solve these problems and to enhance the diagnostic and assessment processes of PD(like,movement disorders or other Parkinsonian syndromes).Design/methodology/approach-Medical observations and evaluation of medical symptoms,including characterization of a wide range of motor indications,are commonly used to diagnose PD.The quantity of the data being processed has grown in the last five years;feature selection has become a prerequisite before any classification.This study introduces a feature selection method based on the score-based artificial fish swarm algorithm(SAFSA)to overcome this issue.Findings-This study adds to the accuracy of PD identification by reducing the amount of chosen vocal features while to use the most recent and largest publicly accessible database.Feature subset selection in PD detection techniques starts by eliminating features that are not relevant or redundant.According to a few objective functions,features subset chosen should provide the best performance.Research limitations/implications-In many situations,this is an Nondeterministic Polynomial Time(NPHard)issue.This method enhances the PD detection rate by selecting the most essential features from the database.To begin,the data set’s dimensionality is reduced using Singular Value Decomposition dimensionality technique.Next,Biogeography-Based Optimization(BBO)for feature selection;the weight value is a vital parameter for finding the best features in PD classification.Originality/value-PD classification is done by using ensemble learning classification approaches such as hybrid classifier of fuzzy K-nearest neighbor,kernel support vector machines,fuzzy convolutional neural network and random forest.The suggested classifiers are trained using data from UCIMLrepository,and their results are verified using leave-one-person-out cross validation.The measures employed to assess the classifier efficiency include accuracy,F-measure,Matthews correlation coefficient.

Performance evaluation model of cross border e-commerce supply chain based on LMBP feedback neural network

In recent years,with the support of national policies,Cross Border E-Commerce(CBEC)has developed rapidly.This business model not only brings significant benefits to the national economy,but also has many unique challenges,especially at the level of supply chain management.Therefore,to enable CBEC enterprises to develop sustainable supply chain,this study discusses the performance evaluation model of supply chain and proposes a CBEC Supply Chain Performance Evaluation Model(CBECSC-EM)based on the Levenberg–Marquardt Backpropagation(LMBP)algorithm.This experiment constructs performance evaluation indicators for the supply chain of CBEC enterprises.On this basis,the LMBP algorithm is introduced,and improved in the experiment to make the overall performance of the evaluation model more scientific and reasonable.In the verification set,the maximum F1 values of LMBP,DEA,SBM,and BP are 98.46%,93.78%,87.29%,and 78.95%,respectively.The MAPE value of LMBP model is 0.102%,which is lower than the other three methods(0.282%,0.343%,and 0.385%)selected in the experiment.The maximum standard deviation rates of importance and operability of the evaluation indexes are 0.1346 and 0.1405,respectively,and there is a significant consistency between the expert scores.Therefore,the LMBP algorithm has broad application prospects in supply chain performance evaluation of CBEC enterprises.