Search

With the rapid growth of social economy, the requirements for resource utilization are becoming higher and higher. How to effectively solve the problem of energy shortage has become a hot topic. However, there are still many deficiencies in the current resource scheduling algorithm. For example, for different types of satellites with different needs and requirements, their performance indicators are different, and in the satellite communication system, the interaction between multiple nodes needs to be considered. Therefore, this paper studies the artificial intelligence algorithm, and proposes an improved particle complementary scheduling strategy for a single user in view of the shortcomings of the existing particle swarm optimization (PSO) algorithm. On this basis, this paper applies this method to evaluate the system performance and verify its effectiveness. The verification results show that the utilization efficiency of the satellite communication system resource scheduling algorithm is above 93%. [ABSTRACT FROM AUTHOR]

Particle Swarm Optimization (PSO) is considered as one of Maximum Power Point Tracking (MPPT) controller algorithm developed for PhotoVoltaic system (PV) to guarantee a maximum power extraction under different climatic conditions of temperature and irradiation. Classical MPPT algorithms like Perturbe and Observe (P&O), PSO, Adaptive Neuro-Fuzzy Inference System (ANFIS) are an effective method for tracking the maximum power point (MPP) for the PV systems, but the problems with these approaches that they are less stable, high oscillation around steady state and slower convergence to the MPP. Based on recent research, the purpose of this paper is to introduces a novel MPPT controller based on a modified version of heterogeneous multi swarm PSO algorithm using an adaptive factor selection strategy (FMSPSO), to overcome the previous shortcomings and compared with conventional PSO, ANFIS and classical P&O controllers. Simulation and experimental results revealed that the new FMSPSO algorithm can overcome the previous shortcomings providing the superior performance to track the MPP efficiently with a shorter convergence time and small oscillations compared to other algorithms. The experimental confirmation of the FMSPSO algorithm has been carried out using NI-myRIO-1900 card and shows that with the proposed MPPT approach efficiency can reach a value greater than 99% even in climatic variation of irradiation and temperature. • A classical MPPT controller cannot track the dynamic the MPP, has obvious oscillations, and converges slowly. • A novel MPPT controller based on a modified version of MSPSO algorithm using an adaptive factor selection strategy (FMSPSO) is proposed. • A FMSPSO based MPPT algorithm is compared with conventional PSO, classical P&O and ANFIS controllers for validation. • The proposed FMSPSO algorithm provides the superior performance by boosting the PV system tracking efficiency more than 99%. [ABSTRACT FROM AUTHOR]

This paper proposes a novel efficient inspired algorithm based on snow avalanches in nature which is named the Snow Avalanches Algorithm (SAA), for solving the benchmark and engineering optimization problems and determining the global solution. The proposed algorithm is modeled using four phases including avalanche due to mountain slope, human factors, weather in the region as well as normal conditions and it has only one control parameter. The advantages of this algorithm are low control parameters, simple structure and also easy implementation. The effectiveness of the SAA algorithm is examined on 23 classic benchmark test functions. Then, the effectiveness of the SAA to achieve accurate results in different aspects is examined and proved on engineering problems including six different cases. The superiority of the SAA to solve the classic benchmark test functions is compared with spotted hyena optimization (SHO), particle swarm optimization (PSO), Aquila optimizer (AO), differential evolution (DE), bat algorithm (BA), dwarf mongoose optimization (DMO), genetic algorithm (GA), artificial bee colony (ABC), and ant colony optimization (ACO). The simulation results provide evidence for the well-organized and efficient performance of the SAA in solving a great diversity of engineering problems. The results demonstrated that the SAA can be more effective than other algorithms to solve the test functions in terms of optimization accuracy and convergence rate. Moreover, the results proved that the SAA obtained more competitive results than the previous methods to solve constrained engineering optimization problems, especially hybrid energy system design as well as economic load dispatch problems. [ABSTRACT FROM AUTHOR]

Intrusion Detection System (IDS) can ensure the network security by identifying network intrusions according to the abnormal traffic data. However, the intrusion detection data has the problem of high dimensionality and changes with network and attack environments, which leads to the poor performance and poor portability of intrusion detection algorithms. Therefore, this paper proposes an intrusion detection algorithm based on joint symmetric uncertainty and hyperparameter optimized fusion neural network. Firstly, a feature selection method based on symmetric uncertainty and approximate Markov blanket is proposed, which fully considers the correlation and redundancy of features, and also the correlation between combined features and the class label, so as to reduce the data dimensionality. Secondly, the CNN-LSTM classifier fused with Convolutional Neural Network (CNN) and Long Short-Term Memory (LSTM) is used to extract the spatial features and temporal features to improve the classification performance. Finally, the Particle Swarm Optimization (PSO) algorithm is improved and used to automatically optimize the hyperparameters of the classifier, so that the classifier can be applied to different intrusion detection datasets with better generalization ability and portability. Experiments have verified the effectiveness and superiority of the proposed algorithm on multiple evaluation indicators. • An effective algorithm for intrusion detection is proposed in this paper. • Feature selection is based on symmetric uncertainty and approximate Markov blanket. • A fusion neural network is constructed to extract the spatial and temporal features. • The PSO algorithm is improved to automatically optimize the hyperparameters. [ABSTRACT FROM AUTHOR]

• Distinct DG Output Modes Validation: The simulation validates distinct DG output modes, impacting prediction. • Mode-Based State Estimation: The paper proposes an innovative mode-based state estimation using IPSO-DBSCAN clustering, overcoming k-means limitations. • Enhanced Data Recovery using DBSCAN: Enhanced data recovery employs DBSCAN with improved secondary clustering, guided by similarity and homogeneity, outperforming traditional methods. • BiGRU-PF State Estimation: BiGRU-PF enhances state estimation accuracy and robustness in distribution networks by detecting DG output modes, addressing k-means limitations, and improving data recovery. This paper proposes a new forecasting-aided state estimation (FASE) method for distribution systems that mitigates issues with uncertain distributed generation (DG) and lost measurements. We utilize an Improved Particle Swarm Optimization (IPSO)-optimized Density-Based Spatial Clustering of Applications with Noise (DBSCAN) for examination of historical DG output data. Based on identified DG output modes, it facilitates precise state prediction and data reconstruction,. The proposed method employs a Bidirectional Gated Recurrent Unit (BiGRU) neural network for state prediction and a particle filter (PF) for final state filtering. The method verification is provided through Python simulations of the Distribution Transformer Unit (DTU)7k distribution network system, demonstrating improved accuracy and robustness against sudden load change and bad data in measurements. [ABSTRACT FROM AUTHOR]

• A Mixed Particle Swarm Optimization model is developed for optimal network reconfiguration and DG integration. • Optimal network reconfiguration allow a better penetration of renewable energy in the system. • Optimal integration of DG units dramatically increases the voltage level and the optimal exploitation of the DS. • DG integration along with optimal NR greatly contribute to power losses minimization and voltage level enhancement. This paper introduces a Mixed Particle Swarm Optimization (MPSO) approach for active power loss minimization and voltage profile improvement in the distribution network. The developed technique joins the Binary Particle Swarm Optimization (BPSO) and the conventional PSO algorithms. The first one is devoted to identify the optimal distribution network configuration, while the second one is used to solve Distributed Generation (DG) placement and sizing problems. To evaluate the performance of the developed approach, three different load scenarios were assessed during network reconfiguration (NR) and DG integration. Simulations are conducted on two distribution test systems, namely, the IEEE-33-bus and the IEEE-69-bus. The obtained results clearly demonstrate the performance and the effectiveness of the proposed method to find optimal status of switches, as well as DG locations and sizes. A benchmark comparison is presented to prove the efficiency of the proposed MPSO with regard to other optimization techniques. The results show that MPSO outperforms these techniques in terms of quality of solution, power loss reduction and voltage profile enhancement. This study is an extension of the earlier published conference paper. [ABSTRACT FROM AUTHOR]

The focus of this paper is to determine how the mechanisms of each algorithm contribute to search performance. swarm-based algorithms are composed of several mechanisms. This paper regards these independent mechanisms as modules. The modules constituting each algorithm are classified into three categories: (1) the common module: a collection of mechanisms that all swarm-based algorithms have in common; (2) the main module: the unique mechanisms of each algorithm that updates the solution by interacting with other solutions; and (3) the sub module: the unique mechanisms of each algorithm that do not directly improve the quality of the solution. Testing the algorithms combined into these modules reveals the contribution of each module to performance. The experiments are conducted for the three algorithms PSO, ABC, and CS to test the usefulness of this concept. The results of these experiments revealed the following implications: (a) the main module of ABC alone can have good performance; (b) the main module of CS does not perform well as a stand-alone; (c) the combination algorithm with the main module of PSO and the sub module of ABC can improve applicability. [ABSTRACT FROM AUTHOR]

Accurate electric energy metering in micro-grid is one of the most urgent problems in the field of electric energy metering. In order to solve the problem that the lackness of electric energy metering can't be accurately calculated with the existing electric energy compensation algorithm when the electric energy metering device is completely faulty, this paper proposes an electric energy compensation algorithm that is limited in micro-grid and is based on standard particle swarm to optimize the deep belief network. Taking the historical electric energy data of each micro source metering point in micro-grid as an example, it is divided into the training set and the test set, the standard particle swarm optimization algorithm is used to determine the optimal learning layers and learning rate of deep belief network, and the electric energy algorithm model is established. The model verification results show that the proposed algorithm is nearly five times lower than the algorithm based on deep belief network solely. Further engineering case comparison shows that lackness of electric energy metering compensated by the algorithm studied in the paper is closer to the theoretical value, and the error is also less than the traditional average electricity algorithm. The real-time power curve is closer to the theoretical value, and has the higher accuracy. [ABSTRACT FROM AUTHOR]

Classification is a common problem in various fields of life, and the key challenging task in data mining. The primary objective of the classification process is to classify the given dataset in a defined class label for all data. Many research papers widely used classification in the medical sector. Various researches have been carried out to classify medical data using different techniques, such as High Order Neural Network (HONN) combined with Back-Propagation Neural Network (BPNN) as a learning algorithm. Due to the increased data complexity, the back-propagation algorithm faced problems of slow convergence. The Back-Propagation (BP) using the gradient descent technique has the possibility of getting stuck in local minima. So, the BP algorithm may cause difficulties in finding the global minima of the error function. This paper proposed a high-order Functional Link Neural Network (FLNN). The proposed FLNN model is integrated with a metaheuristic-based searching algorithm called Accelerated Particle Swarm Optimization (APSO). The performance of the proposed Accelerated Particle Swarm Optimization Functional Link Neural Network (APSOFLNN) model is validated with various medical datasets and compared to traditional techniques such as Accelerated Particle Swarm Optimization Functional Link Back-Propagation (APSOFLBP), and Artificial Bee Colony Functional Link Neural Network (ABCFLNN). The simulation results showed that the proposed APSOFLNN algorithm for the used benchmarked datasets shows good results in terms of the mean square error (MSE) and accuracy in comparison to the traditional techniques. [ABSTRACT FROM AUTHOR]

Particle Swarm Optimization (PSO) provides a metaheuristic optimization technique for real-life functions with complex behavior. Inspired by the metaphor of social behavior as exhibited by swarms operating in natural surroundings, the algorithm captures the Emergent Complexity demonstrated by individual components of large groups which work together using simple rules and create complex, yet efficient, adaptive, and self-organizing systems. The paper seeks to rigorously analyze the hyperparameters of the algorithm to find the relative importance of cognitive(personal) vis-à-vis social (swarm) parameters of the algorithm so as to gain a perfect understanding of the importance of exploitation versus exploration parameters thus enabling us to enhance the application efficiency of the algorithm. The paper further suggests and applies a rolling coefficient updating technique to the algorithm parameters so as to use a formal statistical procedure in the initialization and subsequent iterations for updating coefficients rather than leaving it on trial and error or on a practitioner's knowledge. Results suggest that the technique employed provides an enhancement in the efficiency of the algorithm by creating a dynamic Emergent Complexity environment. [ABSTRACT FROM AUTHOR]

The widespread development of monitoring devices in power system has indeed led to the generation of large amounts of power consumption data. Storing and transmitting this enormous volume of data has become a significant challenge for power system operators and researchers. Although high data rates are available for transmission, data compression is still necessary for power system applications to lessen the load of data transmission and storage. The wavelet transform plays an important role in data compression for power system applications. This paper presents an adaptive data compression algorithm based on the discrete wavelet transform (DWT) for power system applications. In general, some wavelet coefficients are neglected to produce DWT-based data compression by using hard or soft thresholds. But the volume of compressed data differs for various threshold values. In this context, selecting an optimal threshold is a challenging task in power system data compression. This paper proposes a multi-objective particle swarm optimisation (MO-PSO) for optimal threshold selection. The proposed approach is tested using IEEE power quality wave data sets and Dutch Residential Energy Datasets (DRED). The proposed MO-PSO algorithm finds the global optimum threshold, and it outperforms the other existing algorithms. The proposed algorithm efficiently compresses the test dataset with a maximum compression ratio (CR) of 2.07. • The development of an adaptive algorithm for data compression is applied in power system data. • MO-PSO algorithm is proposed to find the optimal threshold in WT based data compression. • Results are compared with recent research works. • The efficiency of data compression algorithm is evaluated by using compression ratio, mean square error and signal-to-noise ratio. [ABSTRACT FROM AUTHOR]

• In this paper, the optimized GWO-MCSVM assessment model is constructed step by step, and the nonlinear convergence factor is used to replace the conventional convergence factor in the Grey Wolf algorithm and the thought of parameter initialization by tent chaotic mapping, which makes it more suitable for the data analysis of transformers. The improved GWO-MCSVM model ensures the rapidity and reliability of assessment. • The initialization of model parameters based on Tent chaotic map completes the preprocessing of model input data, determines the initial parameter selection of GWO parameter optimization process, and improves the optimization speed of the algorithm. • The parameters of GWO-MCSVM model are optimized through training samples of transformer operation parameters in practical projects, and the GWO-MCSVM model is tested through groups of test samples. Compared with the existing GA-SVM model and PSO-SVM model, it is verified that the model has high accuracy (accuracy rate is more than 90%) in transformer condition assessment, is superior to the existing assessment model, and has bright scalability. The continuous and reliable operation of the transformer is the basis to ensure the normal operation of the power system. Relevant departments collect multi-dimensional and multi-source heterogeneous parameter data during the operation, maintenance and repair of transformers. The effective information contained in the parameter data can directly reflect the current operating status of the transformer. On the basis of support vector machine and grey wolf algorithm, an improved GWO-MCSVM algorithm based on nonlinear convergence factor and Tent chaotic mapping is proposed. The algorithm parameters are optimized through training samples, and the results are evaluated and verified in the algorithm itself, so as to improve the accuracy of the status assessment results. Finally, the accuracy of assessment results of the algorithm proposed in this paper, existing genetic algorithms and particle swarm optimization algorithms are compared by evaluating multiple sets of measured samples. By comparison, the effectiveness of the algorithm proposed in this paper for transformer condition assessment has been verified. [ABSTRACT FROM AUTHOR]

Aiming at the problems of single optimization strategy and poor comprehensive performance of MOFA, multi-objective firefly algorithm with adaptive region division is proposed in this paper. By leveraging the convergence index, our algorithm intelligently divides the dominant and non-dominant solution groups into three sub-regions, namely balance, exploration, and development areas, each with a distinct learning strategy that complements the strengths of fireflies. Specifically, fireflies in the balance area learn from global optimal particles with diversity to achieve a balanced exploration and development ability. Fireflies in the exploration area jointly learn from globally optimal particles with convergence and diversity, increasing the algorithm's likelihood of discovering Pareto optimal solutions. Lastly, fireflies in the development area rapidly converge under the guidance of the globally optimal particle of convergence, thus improving the algorithm's development ability. To further enhance the comprehensive optimization performance, we introduce a novel fusion index as an external archive update strategy that preserves solutions with superior convergence and diversity. Our experiments on 20 benchmark functions and a multi-objective optimization power flow example demonstrate that our algorithm outperforms other multi-objective optimization algorithms, highlighting its superior optimization performance. • This paper proposes a multi-objective firefly algorithm with adaptive region division. • Based on the idea of adaptive region division, the firefly population was divided into adaptive regions and regions, and multiple learning strategies were integrated. • Our algorithm has higher performance than the classical MOEA on instances of benchmarking functions and multi-objective optimization currents. [ABSTRACT FROM AUTHOR]

• This paper aims to enhance the optimality and rapidity of three dimensional IoDs. • Monte Carlo simulation is used to compare different CIPSO algorithms. • The proposed algorithm shows improvement in convergence speed and optimal solution. Drones flights have been investigated widely. In the presence of high density and complex missions, collision avoidance among swarm of drones and with environment obstacles becomes a challenging task and indispensable. This paper aims to enhance the optimality and rapidity of three dimensional IoD path generation by improving the particle swarm optimization (PSO) algorithm. The improvements include using chaos map logic to initialize the population of PSO. Also, adaptive mutation is utilized to balance local and global search. Then, the inactive particles are replaced by new fresh particles to push the solution toward global optimal. Furthermore, Monte Carlo simulation is carried out and the results are compared with slandered PSO and with recent work CIPSO. The results exhibit significant improvement in convergence speed as well as optimal solution which prove the ability of proposed method to generate safety path for IoD formation without collision with terrain obstacle and among drones. [ABSTRACT FROM AUTHOR]

The prediction of short term power load owns a great influence on performance of the whole electric system. Raising the result of power load forecasting is always a research spot. This paper proposes a method combined Elman neural network (ENN) and the particle swarm optimization (PSO) for the short-term power load forecasting. Firstly, this paper introduces the principle of ENN and PSO algorithm respectively and analyzes performance of network influenced by parameters of ENN. Then the particle swarm optimization algorithm is applied to searching the optimal learning rate of ENN. To study the capability of the method proposed in this paper, the method is utilized for the short-term power load forecasting, which is suitable to be solved by ENN. Besides, a comparison experiment on this method (PSO–ENN) with general regression neural network (GRNN), the original ENN and the traditional back-propagation neural network (BPNN) is given out to illustrate effectiveness of PSO–ENN. [ABSTRACT FROM AUTHOR]

The Pichia pastoris fermentation process is with highly nonlinear and time-varying and strong coupling characteristics, traditional control methods such as classic PID cannot satisfy the actual needs of the fermentation process control. In order to effectively solve the control problem of the Pichia pastoris fermentation process, a multi-model predictive control method is presented based on the relative error weighting algorithm. First, the prior sample data are divided into multiple training sample sets (sample cluster) by fuzzy C-means clustering algorithm (FCM). Then, the corresponding sub prediction model is obtained by using least square support vector machine (LSSVM) and Improved particle swarm optimization (IPSO) algorithm for each sample cluster. Finally, the control strategy of predictive model is constructed based on multi model relative error weighting algorithm. The simulation in the Pichia pastoris fermentation process shows that the algorithm proposed in this paper could improve the transient response and perform good output tracking in a wide range. It improves the adaptive ability of the model and makes it more accurate to describe the actual state of the nonlinear system. [ABSTRACT FROM AUTHOR]

• A novel MPPT controller based on yellow saddle goatfishes algorithm (YSGA) for energy optimization of PV systems. • Qualitative and quantitative comparison of YSGA with BAT,GWO,SOA,PSO, and P&O under partial shading condition. • Statistical analysis based on: the average best so far (AB), the median best so far (MB), and standard deviation (SD). • Wilcoxon test with 5% significance level based on the median value is applied to verify the superiority of the algorithm. This paper proposes a novel maximum power point tracking (MPPT) technique based on a new optimization algorithm called yellow saddle goatfish algorithm (YSGA). The photovoltaic system loses a significant amount of power under partial shading conditions (PSC). Because of the presence of bypass diodes, several maximums appear in the Power-Voltage characteristic, making tracking the global maximum power point (GMPP) extremely difficult. A yellow saddle goatfish-based MPPT algorithm is proposed and implemented to address this issue and improve the efficiency of the PV system. This algorithm employs a subgroup research methodology and a very interesting strategy of particle collaboration during GMPP tracking, providing a balance between the exploration and exploitation phases of the research process. To investigate its performance, tests were conducted using six different partial shading patterns and a fast irradiance variation. The simulation was carried out in MATLAB/Simulink using a series of MSX60 solar panels. The results were compared to well-known and efficient algorithms such as the Grey wolf optimization algorithm (GWO), the Bat algorithm (BAT), particle swarm optimization (PSO), the Seagull optimization algorithm (SOA), and the Perturb and observe (P&O) algorithm. The findings demonstrate the proposed method's high robustness, as well as its high dynamic and accuracy in tracking the GMPP. Furthermore, a quantitative and statistical analysis of 100 tests revealed that it outperformed the other algorithms in terms of efficiency, success rate, convergence time, and solution dispersion. [ABSTRACT FROM AUTHOR]

This paper proposes a novel methodology for the detection of partial shading conditions in photovoltaic (PV) arrays based on the experience gained in the preliminary step of the detection algorithm. In the first stage of the problem, the periodic partial shading detection (PSD) problem is solved to detect the periodic partial shading condition (PSC) and to determine the optimal number of executing point of MPPT algorithm during PSC. The second stage of the PSD problem solves the maximum power point tracking (MPPT) problem to extract the maximum power from PV array at the executing point. The PSD problem is solved using the sine cosine algorithm (SCA) and to determine the global maximum operating point under various partial shading conditions, the improved sine cosine algorithm (ISCA) is proposed. The proposed method is guaranteed to find periodic shade and the global maximum operating point, avoiding the local operating point obstacle. Using MATLAB, the algorithm is implemented and tested in a simulation model. An experimental 2 kW PV system is developed to validate the operating point of the PV system under various partial shading patterns. The results demonstrate that the proposed algorithm outperforms the genetic algorithm and particle swarm optimization-based partial shading detection problem. • Paper proposes a novel methodology for detection and assessment of partial shading conditions in PV arrays. • In Stage I, periodic partial shading detection (PSD) problem is proposed to solve using the sine cosine algorithm (SCA). • The PSD problem is to detect the periodic partial shading condition and optimize the executing point of MPPT algorithm. • In Stage II, the PSD problem solves the MPPT problem to extract the maximum power at the executing point. • The simulation and experimental results demonstrate that the proposed algorithm outperforms the other methods. [ABSTRACT FROM AUTHOR]

Being sensitive to initial position and noise is the key problem that must be solved in point cloud registration. To improve the overall performance of registration methods, a point cloud registration method based on the Dark Forest Algorithm is proposed in this paper. The introduction of swarm intelligence enhances the adaptability of the registration method to the initial position and improves the robustness of the point cloud registration system. Furthermore, the application of the Dark Forest Algorithm with four capability enhancement strategies: the hierarchical elite, civilization self-decision, suspicion chain, and technology explosion has improved the comprehensive competitiveness in point cloud registration. The mentioned strategies have brought a great positive impact on the registration methods in solving the far initial position, breaking away from the local optimal solution, and weakening the noise interference. The paper aims to provide the Dark Forest Algorithm and the point cloud registration method based on it, which are elaborated on in detail and compared to other existing algorithms to prove the comprehensive performance, respectively. Then, the point cloud registration experiment for coal-wall point clouds was carried out and the results indicate that the proposed registration algorithm is better than other algorithms for standard point cloud dataset and coal-wall point cloud, which demonstrates that the proposed registration method has strong potential competitiveness. • Proposed a point cloud registration based on a novel meta-heuristic algorithm. • Dark Forest Algorithm is proposed with the higher accuracy and stronger adaptability. • Cloud registration based on the DFA demonstrates potential competitiveness. [ABSTRACT FROM AUTHOR]

Extracting relevant information from a large amount of data is a challenging task. Automatic text summarization is a potential solution for obtaining this information. In this paper, a nature inspired swarm intelligence-based algorithm viz. firefly algorithm for multi-document text summarization is proposed. A new fitness function consisting of three features viz. topic relation factor, cohesion factor and readability factor is utilized. The experiments are performed on datasets from Document Understanding Conference i.e. DUC-2002, DUC-2003 and DUC-2004. The performance of the algorithm has been evaluated using ROUGE score. The performance of the proposed algorithm is compared with some other nature inspired ones such as particle swarm optimization (PSO) and genetic algorithm (GA). The performance of the proposed algorithm outperforms the other adopted ones. [ABSTRACT FROM AUTHOR]

• An advanced shuffled frog leaping algorithm (DSSRLFLA) is developed for model evaluation and feature selection. • A dynamic step size adjustment strategy based on historical information is designed to balance exploration and exploitation. • Specular reflection learning mechanism increases the possibility of searching for valid solutions and enhances the search ability. • An improved simulated annealing strategy is executed for each memetic to improve the efficiency of local exploitation. • DSSRLFLA can obtain higher quality optimal solutions compared to some competitive algorithms. The shuffled frog leaping algorithm is a new optimization algorithm proposed to solve the combinatorial optimization problem, which effectively combines the memetic algorithm based on a memetic algorithm and the particle swarm algorithm based on population behavior. The algorithm is widely used because it is easy to implement and requires few parameters to be adjusted. However, there are still some characteristics of this method that need to be improved because it is easy to fall into local optimization or poor search ability. To alleviate this limitation, a new version of the improved SFLA is proposed in this paper, which incorporates a dynamic step size adjustment strategy based on historical information, a specular reflection learning mechanism, and a simulated annealing mechanism based on chaotic mapping and levy flight. Firstly, the dynamic step size adjustment strategy based on historical information effectively helps to balance local exploration and global exploitation and alleviates the problem of falling into local optimum. Second, the specular reflection learning mechanism increases the possibility of searching for valid solutions in feasible domains and enhances the search ability of individuals in the population. Finally, an improved simulated annealing strategy is executed for each memetic, which improves the efficiency of local exploitation. In order to test the performance of the proposed algorithm, 31 test functions were selected from IEEE CEC2014 and 23 essential benchmark functions, and comparative experiments were carried out from the two dimensions of 30 and 100. Furthermore, a series of competing algorithms are selected, which involve nine classical standard algorithms, including PSO, BA, SSA, FA, SCA, WOA, GWO, MFO, and SFLA, as well as, six well-known improved algorithms, including LSFLA, DDSFLA, GOTLBO, ALCPSO, BLPSO, CLPSO. Furthermore, Wilcoxon signed-rank test and Friedman test are used as testing tools to illustrate the scalability of the proposed algorithm. From the analysis of the results, it can be seen that this proposed method has been effectively improved concerning stability and the quality of the optimal solution obtained from the search, both in low and high dimensions, and the ability to jump out of the local optimum has also been enhanced. In addition, to prove that this method has a reliable performance in discrete problems and continuous problems, DSSRLFLA is mapped into a discrete space, and 24 UCI data sets are also selected to evaluate the performance of the new feature selection method. The experimental results illustrate that this improved method can obtain fewer features and higher classification accuracy than some well-known feature selection methods. [ABSTRACT FROM AUTHOR]

Decision tree induction is a simple, however powerful learning and classification tool to discover knowledge from the database. The volume of data in databases is growing to quite large sizes, both in the number of attributes and instances. Some important limitations of decision trees are instability, local decisions, and overfitting for this extensive data. The simple, effective and non-convergence nature of the African Buffalo Optimization (ABO) algorithm makes it suitable to solve complex optimization problems. In this paper, we propose the African Buffalo Optimized Decision Tree (ABODT) algorithm to create globally optimized decision trees using the intelligent and collective behaviour of African Buffalos. The modified African Buffalo optimization algorithm is used to create efficient and optimal decision trees. To evaluate the efficiency of the proposed African Buffalo Optimized Decision Tree algorithm, experiments are performed on 15 standard UCI learning repository datasets that are of various sizes and domains. Results show that the African Buffalo Optimized Decision Tree algorithm globally optimizes decision trees, increases accuracy and reduces the size of a decision tree. These optimized trees are stable and efficient than conventional decision trees. [ABSTRACT FROM AUTHOR]

Fractional order filters offer greater freedom of design and a precise control over stopband attenuation in electronic circuits and systems. This paper presents the design of a fractional order low pass Chebyshev filter (FOLCF) that achieves near-ideal response characteristics. The methodology introduced utilizes metaheuristic optimization methods, including particle swarm optimization, firefly algorithm, and grey wolf optimization. These techniques are employed to precisely adjust the filter coefficients for the orders (1+α), (2+α), and (3+α). The adjustment is carried out by comparing the desired behaviour of the FOLCF with generalized fractional order low pass transfer functions. Throughout these instances, the parameter α is varied within the range of (0, 1). The designed filters are then tested and compared on the basis of various factors. Simulation results demonstrate that the designed filters closely follow the behaviour of an ideal Chebyshev filter with maximum passband and stopband magnitude errors being −31.93 dB and −52.74 dB respectively for (1+α) order filters. These values for (2+α) and (3+α) order FOLCF have been observed to be −30.04 dB and −55.91 dB; −17.72 dB and −49.52 dB respectively. Furthermore, it has been observed that the proposed work outperforms existing state-of-the-art approaches in various aspects, including magnitude error, stopband attenuation, and cut-off frequency. The stability of the designed filters has been verified through stability analysis. Additionally, practical feasibility of the proposed FOLCF is demonstrated through SPICE simulations for α = [0.2,0.5,0.8] using second generation current conveyor (CCII) and operational transconductance amplifier (OTA) based topologies while approximating the constant phase element using fifth order continued fraction expansion. The SPICE implementations closely follow the behaviour of ideal filter with −48.67 dB and −62.8 dB as mean square errors for CCII and OTA circuits respectively, showcasing the proposed filters' superiority and practical applicability in advanced electronic design. • A generalized design of Fractional order low Pass Chebyshev filters having near idle response has been proposed. • Nature inspired Algorithms: particle swarm optimization (PSO), firefly algorithm (FA) & grey wolf optimization (GWO) are used. • Comparisons with existing literature on basis of magnitude errors, stopband attenuation and cut off frequencies has been made. • Stability analysis for all the designed filters has been done by converting s-plane to W-plane. • Realization of proposed filters has been done by using CCII and OTA based circuits to test feasibility. [ABSTRACT FROM AUTHOR]

In recent years, there have been notable advancements in the theoretical research of existing meta-heuristic algorithms and in the development of novel algorithms. However, the research on the definition and construction methods of the so-called "mutation" operator, a concept widely used in existing meta-heuristic algorithms, remains notably insufficient. In addition, how to directly construct a meta-heuristic algorithm under the guidance of stability and invariance analysis continues to pose a challenge that has yet to resolve. This paper carefully investigates and rigorously defines the concepts of "mutation operator" and "mutation-driven meta-heuristic algorithm" as found in the literature. According to these definitions, a novel meta-heuristic algorithm, called Multi-direction guided Mutation-driven Stable swarm Intelligence algorithm with Translation and Rotation invariance (M2SITRI) is proposed, and the corresponding mutation operator is carefully designed based on the analysis of translation invariance, rotation invariance, order-1 stability, and order-2 stability. The stability and invariance properties of the M2SITRI algorithm are validated through numerical simulations, and its superior solving performance is demonstrated by benchmarking it against several other well-known existing meta-heuristic algorithms across a variety of test problems. • Mutation operator and mutation-driven meta-heuristic algorithm concepts are defined. • A novel translation and rotationally invariant meta-heuristic algorithm termed M2SITRI is proposed. • The invariance and stability properties and the excellent solving performance of M2SITRI algorithm are verified. [ABSTRACT FROM AUTHOR]

This paper considers the inverse p -median location problem with variable edge lengths and variable vertex weights on general graphs in which the modification costs are the fuzzy random variables. We present a model for the problem in fuzzy random environment in which the objective value is computed by conditional value at risk criterion. Then, we show that the problem is NP-hard under this criterion. Therefore, a new hybrid modified particle swarm optimization algorithm is proposed to obtain the approximate optimal solution of the proposed model. Finally, computational experiments are given to illustrate high efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

• Differential privacy and deep learning are combined to alleviate the problem of model privacy leakage. • Differential evolution is used to optimize the learning rate, accelerate the model convergence, and avoid the privacy loss. • The particle swarm optimization method is used to find the optimal weight that satisfies the privacy. • The algorithm in this paper is verified on three data sets, and the accuracy and efficiency are better. In deep learning differential privacy protection, adding noise based on gradient has become a mainstream algorithm, but excessive gradient perturbation noise causes accuracy degradation. To solve this problem, a differential privacy protection algorithm based on differential evolution and particle swarm optimization is proposed to realize hyperparameter optimization in differential privacy, reduce the impact of noise on the model, and effectively improve the accuracy. On the one hand, the differential evolution scheme performs selection, crossover and mutation on learning rate η , make it approach the global optimal solution, and improve the computational efficiency of the algorithm. On the other hand, the particle swarm optimization scheme is adopted. Without changing the parameters and gradient structure, the parameters are optimized by using the network propagation attributes, which reduces the influence of noise on the accuracy. Experiments are performed on three datasets: Cifar10, Mnist and FashionMnist. Compared with the existing differential privacy algorithms, under the same privacy budget, the proposed algorithm has better accuracy and higher efficiency. [ABSTRACT FROM AUTHOR]

PSO (particle swarm optimization), is an intelligent search method for finding the best solution according to population state. Various parallel implementations of this algorithm have been presented for intensive-computing applications. The ALC-PSO algorithm (PSO with an aging leader and challengers) is an improved population-based procedure that increases convergence rapidity, compared to the traditional PSO. In this paper, we propose a low-power heterogeneous parallel implementation of ALC-PSO algorithm using OmpSs and CUDA, for execution on both CPU and GPU cores. This is the first effort to heterogeneous parallel implementing ALC-PSO algorithm with combination of OmpSs and CUDA. This hybrid parallel programming approach increases the performance and efficiency of the intensive-computing applications. The proposed approach of this article is also useful and applicable for heterogeneous parallel execution of the other improved versions of PSO algorithm, on both CPUs and GPUs. The results demonstrate that the proposed approach provides higher performance, in terms of delay and power consumption, than the existence implementations of ALC-PSO algorithm. [ABSTRACT FROM AUTHOR]

Task scheduling is one of the major issues in cloud computing environment. Efficient task scheduling is substantial to attain cost-effective execution and improve resource utilization. The task scheduling problem is classified to be a nondeterministic polynomial time (NP)-hard problem. This feature attracts researchers to utilize nature inspired metaheuristic algorithms. Initializing searching solutions randomly is one of the key features in such optimization algorithms. However, assisting metaheuristic algorithms with effective initialized solutions can significantly improve its performance. In this paper, an improved initialization of particle swarm optimization (PSO) using heuristic algorithms is proposed. Longest job to fastest processor (LJFP) and minimum completion time (MCT) algorithms are used to initialize the PSO. The performance of the proposed LJFP-PSO and MCT-PSO algorithms are evaluated in minimizing the makespan, total execution time, degree of imbalance, and total energy consumption metrices. Moreover, the performance of the proposed algorithms is compared with recent task scheduling methods. Simulation results revealed the effectiveness and superiority of the proposed LJFP-PSO and MCT-PSO compared to the conventional PSO and comparative algorithms. [ABSTRACT FROM AUTHOR]

Load balancing of tasks on the cloud environment is an important aspect of distributing resources from a data centre. Due to the dynamic computing through the internet; cloud computing agonizes from overloading of requests. Load balancing has to be carried out in such a manner that all virtual machines (VM) should have balanced load to achieve optimal utilization of its capabilities. This paper proposes a novel methodology of dynamic balancing of load among the virtual machines using hybridization of modified Particle swarm optimization (MPSO) and improved Q-learning algorithm named as QMPSO. The hybridization process is carried out to adjust the velocity of the MPSO through the gbest and pbest based on the best action generated through the improved Q-learning. The aim of hybridization is to enhance the performance of the machine by balancing the load among the VMs, maximize the throughput of VMs and maintain the balance between priorities of tasks by optimizing the waiting time of tasks. The robustness of the algorithm has been validated by comparing the results of the QMPSO obtained from the simulation process with the existing load balancing and scheduling algorithm. The comparison of the simulation and real platform result shows our proposed algorithm is outperforming its competitor. [ABSTRACT FROM AUTHOR]

An accurate and efficient control of the Maximum Power Point Tracking (MPPT) and pitch angle for the Wind Turbine (WT) system can provide more energy while also protecting the material. Thus, considering these economic aspects, many controllers are proposed to guarantees their performances. The most studied strategy is the classical PID controller. However, its performance is limited due to the nonlinear model and the difficult wind speed form, which inflict many uncertainties. To solve these drawbacks, an advanced controller named Type-2 Fractional Order Fuzzy PID (T2-FOPID) controller is suggested in this paper to improve the exigence controls. Meanwhile, an efficient optimization technique named the Salps Swarm Algorithm (SSA) has been introduced in order obtaining the best controller parameters. The efficiency of the proposed controller is tested to the 10 kW-WT under various wind speed scenarios. The derived results explicitly indicate that the proposed strategy outperforms the PID controller and other controllers, in terms. the minimum of error, the overshoot and the settling time. • The pricipal controls of the wind turbine system are are the MPPT and the pitch angle. • The authers proposed the Type-2 Fractional order PID controller based on salps swarm algorithm. • The results proved the superiority of proposed controller than the classical PID controller and others are largely suggested in the literature. [ABSTRACT FROM AUTHOR]

In this paper, a new approach is proposed for the smooth path planning of mobile robot based on a new quartic Bezier transition curve and an improved particle swarm optimization (PSO) algorithm. First, a dedicatedly constructed quartic Bezier transition curve with three overlapped control points is developed to fulfil the G 3 -continuity of the smooth path at the joints of the path segments, so as to guarantee the high-order smoothness of the path for the movement of mobile robot. Then, the smooth path planning of mobile robot is formulated mathematically as an optimization problem under several criteria and constraints of the smooth path, e.g. length, smoothness, safety and robot kinematics. Furthermore, an improved PSO with adaptive weighted delay velocity (PSO-AWDV) algorithm is presented for the optimization problem of smooth path planning, where the parameter relationship to ensure the convergence of PSO-AWDV is derived through the stability analysis of the algorithm. Finally, several simulation experiments are carried out to confirm the effectiveness and superiority of the proposed new approach combined with the new quartic Bezier transition curve and the improved PSO-AWDV algorithm. [ABSTRACT FROM AUTHOR]

Population-based algorithms are among the most successful approaches to optimization. These algorithms require high computational capacities such as memory storage. During the last decade, an alternative approach, called compact optimization, was developed. In real-valued compact algorithms, the population is represented by a probabilistic distribution function. Real-valued compact genetic algorithm was first developed and then the idea was extended to other population-based algorithms, like differential evolution, particle swarm optimization and teaching-learning-based optimization. In this paper, we introduce a set of new compact firefly algorithms (cFAs) with minimal computational costs. Our primary aim is to reduce the computational capacity and storage required by the classical variants of FA. The proposed approaches lead to the reduction of the complexity of the attraction model used in FA. The proposed cFAs achieve the optimization with a minimal number of attractions. Several propositions are investigated and reported; such as: elitism strategies, Lévy movements, and opposition-based learning. The proposed algorithms consist of: permanent elitism-based compact firefly algorithm (pe-cFA), non-permanent elitism-based compact firefly algorithms (ne-cFA), permanent elitism-based compact Lévy-flight firefly algorithms (pe-cLFA), non-permanent elitism-based compact Lévy-flight firefly algorithms (ne-cLFA), opposition-based compact firefly algorithms (OBcFA) and opposition-based compact Lévy-flight firefly algorithms (OBcLFA). All the known compact algorithms use normal probability of density function (NPDF) to represent the population. In this paper, a new way is investigated. The alternative solution proposed here is based on uniform PDF (UPDF). Thus, two categories of cFAs are presented: NPDF-based cFAs and UPDF-based cFAs. Hence, for each proposed algorithm, two versions are presented and analyzed. The proposed set of twelve algorithms are tested on the IEEE CEC2014 benchmark functions and compared to the state-of-art of compact evolutionary algorithms (cEAs), swarm intelligent algorithms (SIAs), and the most advanced evolutionary algorithms (EAs). The obtained results show that the proposed cFAs are very competitive and that the uniform distribution is very efficient. The case study of this paper concerns the optimal swing-up control of a gymnastic humanoid robot hanging on a bar. [ABSTRACT FROM AUTHOR]

This paper proposes a combined model of Multi-Objective Dynamic Economic and Emission Dispatch (MODEED) with Demand Side Management (DSM) to investigate the benefits of DSM on generation side. This model considers a day ahead based load shifting DSM approach. In order to analyse the effect of DSM on the generation side, the objectives of dynamic economic and emission dispatch problem were minimized individually and simultaneously with and without DSM. A test system with six thermal generating units was considered for the validation of the proposed method. In this paper, authors used Multi-Objective Particle Swarm Optimization (MOPSO) algorithm to minimize the objectives of MODEED problem simultaneously. The simulation results of the MOPSO algorithm have also been compared with the non-dominated sorting genetic algorithm (NSGA-II). It is clear from the results that the proposed combined model is able to give benefits to both utilities and generating companies. [ABSTRACT FROM AUTHOR]

Artificial rabbits optimization (ARO) is a swarm intelligence-based algorithm inspired by the survival strategies of rabbits. Although ARO has a good convergence rate, it is prone to get stuck in the local optima and converge prematurely. To overcome this, the present paper redesigns the exploration operator of the ARO algorithm with the roulette fitness-distance balance (RFDB) and dynamic fitness-distance balance (d FDB) strategies. In this context, three different versions of the fitness-distance balance-based artificial rabbits optimization (FDBARO) algorithm are developed. The performance of the original ARO and FDBARO versions (FDBARO-1, FDBARO-2, and FDBARO-3) are evaluated on CEC 2017 and CEC 2020 benchmark functions. The obtained results are analyzed with the Wilcoxon and Friedman statistical tests. Statistical and convergence analysis results showed that the FDBARO-3 algorithm designed with the d FDB selection method can explore the search space more successfully compared to other algorithms. This version was named the dynamic FDBARO (d FDBARO) algorithm. Moreover, the practicability of the proposed d FDBARO is highlighted by the solution of the optimal power flow (OPF) problem formulated with renewable energy sources (RESs) and flexible alternating current transmission system (FACTS) devices considering fixed and uncertain load demands. Experimental results showed that the proposed d FDBARO is a competitive algorithm for solving global optimization and constrained OPF problems. The source code of the d FDBARO algorithm is available at https://www.mathworks.com/matlabcentral/fileexchange/154845-dfdbaro-an-enhanced-metaheuristic-algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes a novel hybrid algorithm which is mathematically modelled by amalgamating the superior features of recently developed Grey Wolf Optimizer (GWO), Sine Cosine Algorithm (SCA), and Crow Search Algorithm (CSA). Researchers have already implemented the aforementioned three algorithms and obtained superior quality results for solving diverse optimization problems. The novel hybrid Variegated GWO Algorithm (VGWO) developed in this proposed research work is initially realized and validated for solving IEEE CEC-C06 2019 benchmark functions. Thereafter, the proposed VGWO is utilized as an optimization tool to solve three emerging and complex power system optimization problems which includes energy management of microgrid systems operated in both islanded and grid-connected mode, dynamic economic emission dispatch and reactive power planning (RPP) problem. A comparative analysis of the proposed VGWO approach with other established metaheuristics is undertaken for each optimization problem. Numerical results show that the novel hybrid VGWO algorithm outperformed an ample number of optimization techniques in providing better quality solutions. The proposed hybrid algorithm yielded a 36.93% reduction in active power loss and 36.80% reduction in operating cost with respect to base case condition for RPP problem. Likewise while solving microgrid energy management problems 9–30% savings was realized in the generation cost compared to the ones mentioned in literature. The capability of handling many complex constraints within a minimum amount of computational time to provide consistently best solutions prioritize the proposed hybrid algorithm among its kinds. Statistical analysis validates the authenticity and viability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Many real-world problems can be abstracted as multimodal global optimization, which is one of the main challenges for optimization algorithms due to its complexity. The fireworks algorithm (FWA) is a swarm intelligence optimization algorithm that has been widely studied and applied by virtue of the synergistic property among fireworks. Current FWA variants have poor exploitation capability to handle some locally complex multimodal functions, which greatly limits the application of the FWA to practical problems. To solve the above problems, in this paper, we propose the multi-guiding spark fireworks algorithm (MGFWA) to solve multimodal functions by enhancing FWA exploitation capabilities. Three different strategies which are boosted guiding vector, multi-guiding sparks, and population-based random mapping are designed to boost the guiding vector, enrich the guiding spark diversity, and fix the mapping function, separately. The validity and parameter setting of MGFWA are theoretically analyzed. Experimentally, the results on the CEC2013 and CEC2017 single objective optimization benchmarks illustrate the remarkable performance of the MGFWA compared to other typical optimization algorithms and FWA variants. Moreover, the ablation study shows each of the three parts plays an important role in the algorithm and the efficiency experiment shows the MGFWA can improve the efficiency of guiding sparks by 10%. We believe that the MGFWA can be considered the SOTA variant of the FWA. • Utilizing boosted guiding vector, multi-guiding sparks, and population-based random mapping to enhance the exploitation capability of the fireworks algorithm. • State-of-the-art performance among fireworks algorithm variants. • Superior performance on multimodal global optimization among several typical swarm intelligence optimization algorithms and evolutionary algorithms. • Extensive experiments (about 60 test functions) and theoretical analyses to demonstrate the effectiveness. [ABSTRACT FROM AUTHOR]

This paper presents an efficient inverse design method of arrayed waveguide grating (AWG) based on BPNN-PSO. Five important structural parameters of AWG are selected as inputs, and the spectral responses of three output channels are used as outputs. A forward network is trained, and the prediction accuracy of the network is improved by optimizing the number of hidden layer neurons. By combining the forward network with the traditional particle swarm optimization (PSO) algorithm, a series of structure designs targeting the desired performance can be generated. This method significantly improves the efficiency and accuracy of the PSO algorithm by introducing neural networks, making it suitable for efficient inverse design and multi-structure analysis of AWG. • Combining BPNN and PSO for AWG inverse design. • Training the forward network to replace the electromagnetic simulation process significantly reduces design time. • The design requirements for AWG allow for both spectral response and desired performance. • This method enables the multi-solution design of AWG according to the desired performance. [ABSTRACT FROM AUTHOR]

Natural frequencies, which are relatively easy parameters to obtain, provide efficient information about the dynamic behavior of structures. Controlling these parameters can help to minimize the destructive effect of dynamic loads on structures. However, the optimal design of the size and shape of truss structures with controlling dynamic constraints is an expensive problem. While frequency constraints are nonlinear and non-convex, handling natural frequencies as constraints is a challenging task, which prevents the phenomenon of resonance, large deformations, and destruction of a structure. Also, reducing the vibration amplitude of a structure would reduce the stress and deflections. In this paper, the Improved Marine Predators Algorithm (IMPA) is proposed and implemented for size and shape optimization of truss structures subject to natural frequency constraints. In this method, a Novel CF (NCF) factor is introduced to control the predator's step size when looking for prey. To evaluate the performance of IMPA, the optimum weight of structures under dynamic constraints was computationally investigated. To demonstrate the efficiency and robustness of IMPA, 37-bar truss bridge, 52-bar dome, 72-bar space truss, 120-bar dome, 200-bar planar truss, and 600-bar dome truss were optimized. Compared to other state-of-the-art algorithms, the results indicate that IMPA performs better in solving these nonlinear structural optimization problems. • Marine Predators Algorithm Improved based on a new strategy. • A novel formula is proposed for CF factor. • engineering problems with dynamic constraints are investigated to prove the capabilities of new swarm algorithm. • The results are compared with state-of-the-art swarm algorithms. [ABSTRACT FROM AUTHOR]

Particle Swarm (PSO) and Bacterial Foraging (BF) Optimizers are two widely used optimization techniques. A proper combination of these two algorithms would improve their search capability while minimizing their shortcomings, such as parameter dependency and premature convergence. This paper presents a hybrid optimization algorithm that combines PSO and BF (HPSBF) to ensure security and the system's stability following faults and disturbances. The formulated objective function is claimed to be innovative and straightforward. The set objectives are to minimize the dropped load by shedding relays while maximizing the lowermost swing frequency. The optimal operation of Under-Frequency Load-Shedding (UFLS) Relays is driven by the HPSBF technique as a bounded optimization with bounds representing the limits of the system's state variables. The viability of the HPSBF is verified against conventional-, PSO-, and BF-UFLS approaches. The standard IEEE 9-bus and IEEE 39-bus systems are exploited to examine the response of the developed UFLS techniques. The tested systems are exposed to various operational scenarios such as loss of power plants and a considerable abrupt load increase. The DigSilent power factor software is used to simulate the IEEE 9- and 39-bus systems, while MATLAB code was implemented to obtain optimal operational points for the implemented algorithms. The HPSBF accomplished the uppermost swing frequency and the lowermost quantity of the disconnected load. Furthermore, the computational times of HPSBF are equivalent to those of the PSO. [ABSTRACT FROM AUTHOR]

l An improved treble-level assisting optimization strategy based on random walk algorithm with compulsive evolution is proposed. l Three levels with different search functions are complementary and achieve the deep optimization of global and local search. l The quantified data shows the proposed method could obtain high quality and efficiency designs. Heat exchanger network synthesis is widely used for saving energy in the chemical engineering field. In the design stage, a multiple-level strategy is useful for assisting the optimization to guarantee the global search ability and protect the evolution process of the optimal solution. The authors have introduced a tri-level protection strategy based on the Random walk algorithm with compulsive evolution. However, the potential solutions in the middle level may still suffer from the operation of accepting the imperfect solution. The main deficiency of the tri-level protection strategy is that solutions are transferred to the elite level only from the protective level, ignoring the solutions with lower cost yield at the basic level. The strategy failed to fulfil the perfect protection and caused low computational efficiency. Therefore, an improved treble-level assisting optimization method is proposed in this paper, where the function of each level is redefined. Based on the advantages of the previous work, the efficiency is improved in the proposed strategy. The quantified data shows that the two cases are 2,782 $/yr and 7,134 $/yr lower than those reported in the literature, which verifies that the proposed strategy strengthens the global and local search abilities. [Display omitted] Main flow chart of T-RWCE [ABSTRACT FROM AUTHOR]

Find the global optimal solution of the model is one promising research topic in computational intelligent community. Dependent on analogies to natural processes, the evolutionary swarm intelligent algorithms are widely used for solving global optimization problems which directed by the fitness values. In this paper, we propose one efficient fractional global learning machine (Fragmachine) which includes two stages (descending and ascending) to determine the optimal search path. The neural network model is used to approach the given fitness value. Specifically, for the descending stage, the integer gradient of the network output with respect the current location is employed to find the next descending point, while for the ascending stage, the fractional gradient is implemented to climb and escape from the local optimal point. We further propose one adaptive learning rate during training which relies on both the current gradient (integer or fractional) information and the fitness value. Finally, a series of numerical experiments verify the effectiveness of the proposed algorithm, Fragmachine. [ABSTRACT FROM AUTHOR]

It is a common occurrence nowadays for a network to be gigantic in size and complex in architecture. Network navigation thus faces many new problems in terms of routing and resource utilization, one of which arises in multi-domain networks. This paper focuses on the Inter-Domain Path Computation under Node-defined Domain Uniqueness Constraint (IDPC-NDU) problem, whose purpose is to find the shortest path between two nodes in a network under a constraint that such a path is only allowed to traverse each domain at most once. Considering that this is an NP-Hard problem, an approximate approach is more practical than an exact one. Meanwhile, Particles Swarm Optimization Algorithm (PSO) has been long known for its powerful ability to discover near-optimal solutions in a reasonable time; however, its application in discrete search space is limited. Therefore, we decide to use the multi-population framework, a sub-branch of multitasking optimization which allows information exchange not only between problems but also between different optimization heuristics, to improve upon the basic PSO method. Specifically, this paper introduces a hybridization between PSO and Variable Neighborhood Search (VNS). The encoding and decoding method are created specifically for the IDPC-NDU problem and for the PSO algorithm, and VNS serves to enhance further the algorithm's ability to escape local optima. Experiments are carried out to prove the new algorithm's efficacy, especially in the context of similar multitasking methods. • Propose a multi-tasking technique for IDPC-NDU. • Propose novel encoding and decoding methods for the IDPC-NDU problem. • Integrate PSO and VNS into a multi-population-based approach to solve the IDPC-NDU problem. • Evaluate the efficiency of the proposed algorithm on various instances. [ABSTRACT FROM AUTHOR]