Search

Data availability: Data will be made available on request. In this work, a sequential switching quadratic particle swarm optimization (SSQPSO) scheme is investigated, where the velocity update mechanism is improved to enhance the convergence performance. Considering the sequential characteristics (related to evolution factors) of the evolution process, a Markov chain with special probability transition matrix is employed to characterize the switching of evolution state. With the help of the mean distance, the concept of population density is first put forward in the dynamic search region enclosed by all particles. Then, taking into account the change of the population density in different generations, two quadratic acceleration terms are introduced into the velocity update model based on the Hadamard product, where four evolution-state-dependent acceleration coefficients are also adopted. The positivity or negativity of the quadratic acceleration terms is retained by resorting to the matrix sign functions. Several widely utilized benchmark functions (including two unimodal and multimodal functions) are employed to evaluate the search capability of the studied SSQPSO scheme. The experimental consequences illustrate that the performance of the developed SSQPSO scheme is superior to that of some popular particle swarm optimization (PSO) schemes. To further demonstrate the effectiveness in practical engineering, the addressed SSQPSO scheme is successfully applied to achieve the fast parameter tuning of the proportional-integral-derivative controller in a spring-mass-damper system. This research work was funded by Institutional Fund Projects under grant no. (IFPIP: 33-135-1443). The authors gratefully acknowledge the technical and financial support provided by the Ministry of Education and King Abdulaziz University, DSR, Jeddah, Saudi Arabia.

Aquila Optimization Algorithm (AQUILA) is a newly emerged metaheuristic optimizer for solving global optimization problems, which is based on intrinsic hunting behaviors of the foraging aquila individuals. However, this stochastic optimization method suffers from some algorithm-specific drawbacks, such as premature convergence to the local optimum points over the search hyperspace due to the lack of solution diversity in the population. To conquer this algorithmic deficiency, an ensemble of Wavelet mutation operators has been implemented into the standard AQUILA to enhance the explorative capabilities of the algorithm by diversifying the search domain as much as possible. Furthermore, a brand-new local search scheme empowered by the synergetic interactions of elite opposition-based learning and a simple-yet-effective exploitative manipulation equation is introduced into the base AQUILA to intensify on the previously visited promising regions. The proposed learning schemes are stochastically applied to the obtained solutions from the base Aquila algorithm to refine the overall solution quality and amend the premature convergence problem. It is also aimed to investigate whether the collective application of Wavelet mutation operators with different types entails a significant improvement in the general search effectivity of the algorithm rather than their individual efforts. Numerical experiments made on a suite of unconstrained unimodal and multimodal benchmark functions reveal that this hybridization with AQUILA has improved the general solution accuracy and stability to very high standards, outperforming its contemporary counterparts in the comparative statistical analysis. Furthermore, an exhaustive benchmark analysis has been performed on fourteen constrained real-world complex engineering problems.(c) 2022 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.

Mobile Edge Computing (MEC), which is the main technology behind 5th Generation (5G) networks, is a nascent paradigm that meets the demands of IoT (Internet of Things) and localized computing. From an end-user point of view, it can be regarded as a refinement of cloud computing and Fog computing. The transfer of computational tasks to the closet MEC servers leads to energy efficiency and low latency. It is important to apply the most suitable policies for scheduling, especially when configuring different modules of an IoT application in MEC. In this paper, three algorithms, namely the heuristic Bald Eagle Search Optimisation [BESO] algorithm, Particle Swarm Optimization algorithm [PSO], and Genetic Algorithm [GA], are presented to carry out heuristic offloading of computational tasks with a view to improving the latency and performance of MEC. However, the most effective algorithm must be adopted to conduct these tasks. As a result, this paper attempts to find an algorithm that is most appropriate for MEC. To demonstrate this. the three algorithms were tested in the Long-Term Evolution [LTE] based Orthogonal frequency-division multiplexing [OFDM] network during a period when the edge nodes had no adequate resources. The performance and efficiency of the three algorithms, BESO, PSO and GA, were determined and compared. After generating the results, the comparative results were evaluated. In terms of offloading the computational tasks, the BESO algorithm was discovered to perform better, with greater energy efficiency and lower latency, than the other two algorithms.

Artificial aeration system for aquaculture ponds becomes essential to meet the oxygen requirement posed by the aquatic species. The performance of an aerator is generally measured in terms of standard aeration efficiency (SAE), which is significantly affected by the different geometric and dynamic parameters of the aerator. Therefore, to enhance the aeration performance of an aerator, these parameters need to be optimized. In the present study, a perforated pooled circular stepped cascade (PPCSC) aerator was developed, and the geometric and dynamic parameters of the developed aerator were optimized using the hybrid ANN-PSO technique for maximizing its aeration efficiency. The geometric parameters include consecutive step width ratio (Wi-1/Wi) and the perforation diameter to the bottom-most radius ratio (d/Rb), whereas the dynamic parameter includes the water flow rate (Q). A 3–6-1 ANN model coupled with particle swarm optimization (PSO) approach was used to obtain the optimum values of geometric and dynamic parameters corresponding to the maximum SAE. The optimal values of the consecutive step width ratio (Wi-1/Wi), the perforation diameter to the bottom-most radius ratio (d/Rb), and the water flow rate (Q) for maximizing the SAE were found to be 1.15, 0.002 7 and 0.016 7 m3/s, respectively. The cross-validation results showed a deviation of 3.07 % between the predicted and experimental SAE values, thus confirming the adequacy of the proposed hybrid ANN-PSO technique.

In state-of-the-art, it has proven that multi-view ensemble learning performs better than classical machine learning algorithms, with the optimized setting of views (subsets of features) usually. Obtaining the appropriate number of views for a given dataset is a complex problem in multi-view ensemble learning (MEL). The finding of the total number of possible views is an NP-hard problem, i.e., equivalent to Bell number. Moreover, the complexity of multi-view learning increases over a higher number of views of the dataset. Therefore, it is highly required to consider a smaller number of views with higher accuracy for optimal performance of MEL. In this work, MEL using Multi-Objective Particle Swarm Optimization (MEL-MOPSO) method has been proposed. The two objectives (number of views of the data and classification accuracy of MEL) have considered where the trade-off between objectives has been performed while searching for an optimal solution using Particle Swarm Optimization (PSO) in the process of multiobjective optimization. The experiments have been done over sixteen high-dimensional datasets using four state-of-art view construction methods. The individual views of the dataset has been utilized to learn through a support vector machine algorithm. The quantitative and non-parametric statistical analyses show that the proposed method has performed effectively and efficiently.

The software systems with a well-documented architecture are easy to understand and evolve. However, in most cases, either the documented architecture is unavailable or get eroded badly. In these cases, to understand and evolve the software systems, developers often need to recover the architectural components from the system implementation code. Recently, a variety of heuristic-based multi-objective optimization algorithms (MoOAs) for software architecture recovery (SAR) have been introduced. Most of the existing SAR approaches are designed by adopting the traditional MoOAs. However, the performance of such approaches degrades drastically with large-scale many-objective SAR (LSMaO-SAR). To address the challenges the MoOAs caused by the LSMaO-SAR, we introduce a large-scale many-objective particle swarm optimization (LSM-PSO) by customizing the framework of the PSO algorithm. For this, we adopt various strategies such as Balance Fitness Evaluation (BFE), Quality Indicator (QI) based fitness evaluation, Fuzzy-Pareto dominance (FPD), and Two-archive external storage, and incorporate into the PSO model. To test the effectiveness of the LSM-PSO, it is applied over five software projects and compared with the existing SAR approaches. The results show that the proposed LSM-PSO outperforms the existing optimization-based SAR approaches.

Electromagnetic coil launch is an important branch of electromagnetic launch (EML) technology, which is suitable for launching anti-torpedo torpedo (ATT). This paper focuses on the EML parameters and the interception probability of the EML two ATTs salvo. Based on the launching model of a multi-stage coil launcher, the trajectory model of the ATT and the attacking torpedo, a calculation method for the EML two ATTs salvo parameters is proposed, with the conditions of capture and interception given reasonably. An adaptive particle swarm optimization (APSO) algorithm is proposed to calculate the optimal launching parameters, by designing the adaptive inertia weight and time-varying study factors. According to the analysis of the simulation with Monte Carlo method, EML will improve the interception probability effectively, and the interception probability is affected by the launching range. The results demonstrate good performance of the proposed APSO in calculating EML parameters for the two ATTs salvo in certain combat situation. Implications of these results are particular regarding the command and decision in the anti-torpedo combat.

This study proposes a group control system optimization strategy coupled with a refrigeration plant model for a primary pump variable flow system, in order to improve the automation level of the refrigeration plant and maximize the energy saving potential. First, the control variables, optimization objectives, and operational constraints of the entire system were analyzed. Then, by collecting the operational data for each component and combining these data with theoretical analysis, the sub models were designed and the input parameters, output parameters, and optimization variables of each sub-model were defined. Next, the sub-models were coupled and the control variables of the operational combination, leading to the lowest overall system energy consumption, were obtained using a particle swarm optimization algorithm. Finally, considering a medical building in North China as an example, the application effectiveness of the optimal control strategy of the refrigeration plant was analyzed. The results showed that the energy-savings of the group control system after the optimization of the refrigerator, chilled water pump, cooling water pump, and cooling tower could reach 9.42, 8.04, 5.67, and 14.64%, respectively. This is a remarkable energy-savings benefit. The research described in this study also provides some reference for the design of group control systems in refrigeration plants.

With the increasing of the scale of task or request and dynamic nature of cloud resources, it gives significant issues of load balancing, resource utilization, task allocation, and system performance and so on. To solve those problems many researchers have applied different types of scheduling techniques. But meta-heuristic scheduling is the most accomplish preferred outcomes over conventional heuristics and hybrid scheduling. Among various meta-heuristics algorithms, PSO is a famous metaheuristic technique to solved optimization issue. PSO is appropriate for dynamic task scheduling, workflow scheduling and load balancing. PSO has a strong worldwide searching capability toward the start of the run and a nearby pursuit close to the furthest limit of the run. Therefore, it has been generally utilized in different applications and has made incredible progress. In this paper a systematically reviews is done on different types of particle swarm optimization (PSO) based scheduling strategy with set of challenges and future direction.

There is a direct link between the extent of formation damage and the filtration volume of the drilling fluids in hydrocarbon reservoirs. The filtration volume could be diminished by adding different additives to the drilling fluids. Recently, nanoparticles have been extensively used for enhancing the filtration characteristics of the drilling fluids. However, there is no reliable model for investigating the influence of this class of additives on the performance of drilling fluids. Hence in this study, two powerful tools ELM (Extreme Learning Machine) and PSO-LSSVM (Particle Swarm Optimization-Least Square Support Vector Machine) are applied to determine the effect of various nanoparticles on the filtration volume. The assessment of the models is carried out by computing the statistical parameters and it was found that ELM has a greater ability to predict the filtration volumes, while PSO-LSSVM performs satisfactorily too. The model predictions and experimental results are in excellent agreement as suggested by the values of root mean squared error (RMSE = 0.2459), coefficient of determination (R2 = 0.999), and mean relative error (MRE = 2.028%) for the dataset. The statistical analysis showed that the suggested model can predict the filtration volume with great accuracy. Moreover, through sensitivity analysis of the input parameters, it was found that for a specified nanoparticle, the filtration volume is highly influenced by nanoparticle concentration and it is the essential variable for the optimization process.

In recent history, Convolutional Neural Networks have attained breakthroughs in addressing many intractable problems in the domain of image processing. But its performance builds upon its chosen hyper parameters and it is a tedious job to manually fine tune these hyper parameters. Hence, in this research, an Automated Hyper-parameter Optimized Convolution Neural Net is proposed which is further applied to uncover the class of skin cancer. The method has utilized a Grey Wolf Optimization algorithm for optimizing the hyper parameters of CNN, by adopting a proper encoding scheme. The effectiveness of the model is verified by comparing it with the performance of Particle Swarm Optimization and Genetic algorithm based hyper-parameter optimized CNN applied on the International Skin Imaging Collaboration skin lesion multi class data set. Simulation results infer that the proposed model is able to produce a testing accuracy up to 98.33% which is around 4% and 1% more compared to PSO and GA based models respectively. Similarly with the proposed model, the testing loss realized is around 0.17% which is 39.2% and 15% less compared to PSO and GA based models respectively. The experimental results clearly demonstrate that the proposed model performs competitively compared to other reported models.

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.

A flow-shop production environment is a widely used production setting in the industry, especially preferred when the variety of products and processes is limited. The constant development of technology and the increasing competition in the market compel researchers to seek ways to increase efficiency. Therefore, scheduling remains an important area of study for researchers. When the size of the problem increases, particularly in real-life contexts, it becomes almost impossible to work out a feasible solution to scheduling problems through current computer technologies. In such cases, solutions are often developed using heuristic or meta-heuristic methods. However, the performance of these methods may vary according to the problem or the components of the suggested method of solution. This study aimed to investigate the effect of local search strategies on the solution performance of hybrid firefly and particle swarm optimization algorithm, developed using chaotic local search. We used four different solution methods: the triple local search strategy consisting of insertion, swap and inversion, which were used frequently in earlier studies, and the individual use of each of these three strategies. In this study, the average relative difference values calculated using insertion, swap, inversion and triple strategy were found to be 3.03, 1.27, 2.54 and 1.20, respectively. As a result of the analyses carried out to compare the results of the solutions obtained in the flow-shop scheduling problems of Taillard, it was found that better results were obtained using the triple strategy. These findings can be a point of reference for future research.

In this article, a new implementation of Artificial Ecosystem Optimizer (AEO) technique is developed for distributed generators (DGs) and capacitors allocation considering the Reconfiguration of Power Distribution Systems (RPDS). The AEO is inspired from three energy transfer mechanisms involving production, consumption, and decomposition in an ecosystem. In the production mechanism, the production operator allows AEO to produce a new individual randomly, whereas the search space exploration can be improved as illustrated in the consumption mechanism and exploitation can be performed in the decomposition. A practical case study of 59-bus Cairo distribution system in Egypt is simulated with different loading percentages. For optimizing the performance of that practical network, the AEO algorithm is employed for different scenarios. Besides, the results obtained by recent optimization techniques which are Jellyfish Search Optimizer (JFS), Supply Demand Optimizer (SDO), Crow Search Optimizer (CSO), Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO) and Whale Optimization Algorithm (WOA) are compared with the developed AEO. The simulation results demonstrate the efficacies and superiority of the AEO compared to the others. It surpasses the other algorithms in terms of obtaining the best, mean, worst, and standard deviations. After optimal RPDS and DGs placements, the power losses are decreased by 78.4, 77.84 and 71.4% at low, nominal and high levels, respectively. However, the best scenario with its application prospects is mentioned after optimal RPDS, DGs, and capacitors where the power losses are decreased by 68.8, 85.87 and 89.91% at low, nominal and high levels, respectively.

Piles (kinds of geotechnical structures) are used for resisting various lateral loads including earthquakes and inclined loads. Hence, these structures' behavior under lateral load should be studied. Therefore, this investigation studies the lateral deflection (LD) of piles under different situations. 192 physical models were carried out by consideration of the most important factor on the lateral deflection amounts in dried sandy soils. Besides, a model of the Elman Neural Network (ENN) - Improved Arithmetic Optimizer (IAO) algorithm was suggested for predicting the piles' lateral deflection. For the intention of comparison, the Elman Neural Network model and Particle Swarm Optimization - Artificial Neural Network were utilized in lateral deflection amounts estimation. For evaluating the proposed model validity, some parameters like Variance Account For, determination coefficient, and Root Mean Squared Error were estimated. The results showed the ENN-IAO method is more reliable for lateral deflection prediction in a small-scale pile in comparison to the ENN method and PSO-ANN model.

For power generation management and power system dispatching, it is of big significance to predict the consumption of electric energy accurately. For the sake of improving the prediction accuracy of power consumption, taking the complex features of time series data into consideration, a novel neural network sandwich structure with an improved attention mechanism is inserted into the double-layer bidirectional long short-term memory network shortened as A-DBLSTM is put forward in this article. In A-DBLSTM, compared with traditional attention mechanism, the presented attention mechanism focuses on different features in each time unit and the A-DBLLSTM network extracts time information in sequence. The parameter optimization of A-DBLSTM is based on the method of particle swarm optimization (PSO). For confirming the effectiveness and feasibility of A-DBLSTM, case studies using two datasets of the hourly temperature values and power loads between 2012 and 2014 and the electric energy consumption are carried out. The experimental results indicate that the presented A-DBLSTM with the novel sandwich network structure achieves superior performance in the aspects of the mean square error, root mean square, the average absolute error and the mean absolute percentage error to other advanced methods. What is more, the factors that have the greatest impact on the prediction performance can be found through analyzing the heatmap of the attention layer.

Feature selection is a basic task for pattern recognition and classification. It enhances the performance of the classification algorithms with the help of removing the redundant features. Thanks to eliminating irrelevant features, the computational time is decreased. Thus, intensive works have been carried out in this area. This paper proposes a new standard error-based artificial bee colony (SEABC) algorithm for the feature selection problem, which is developed by integrating standard error-based new solution search mechanisms into the original artificial bee colony algorithm. The SEABC algorithm is used for feature selection. Shannon entropy function is used to serve as the objective function of the SEABC algorithm. Thirteen datasets are used from UCI machine learning datasets. Features are selected according to Shannon conditional entropy values and then a threshold process is implemented to find their best relevant subset. Support Vector Machines (SVMs) and k-Nearest Neighbor (KNN) are used as the optimal classifiers. The proposed SEABC algorithm is compared with genetic algorithm (GA), particle swarm optimization (PSO), ABC, improved ABC (I-ABC), Gbest-guided ABC (GABC), and PS-ABC algorithms. In general, it is observed that the SEABC algorithm achieves better classification results than other well-known algorithms.

A novel turbofan Direct Thrust Control (DTC) architecture based on Linear Parameter-Varying (LPV) approach for a two-spool turbofan engine thrust control is proposed in this paper. Instead of transforming thrust command to shaft speed command and pressure ratio command, the thrust will be directly controlled by an optimal controller with two control variables. LPV model of the engine is established for the designing of thrust estimator and controller. A robust LPV H∞ filter is introduced to estimate the unmeasurable thrust according to measurable engine states. The thrust estimation error system is proved to be Affinely Quadratically Stable (AQS) in the whole parameter box with a prescribed H∞ performance index γ. Due to the existence of overdetermined equations, the solving of controller parameters is a multi-solution problem. Therefore, Particle Swarm Optimization (PSO) algorithm is used to optimize the controller parameters to obtain satisfactory control performance based on the engine’s LPV model. Numerical simulations show that the thrust estimator can acquire smooth and accurate estimating results when sensor noise exists. The optimal controller can receive desired control performance both in steady and transition control tasks within the engine working states above the idle, verifying the effectiveness of the proposed DTC architecture’s application in thrust direct control problem.

Training an Artificial Neural Network (ANN) algorithm is not trivial, which requires optimizing a set of weights and biases that increase dramatically with the increasing capacity of the neural network resulting in such hard optimization problems. Essentially, over recent decades, stochastic search algorithms have shown remarkable abilities for addressing hard optimization problems. On the other hand, pragmatically, abundant real-world problems suffer from the imbalance problem, where the distribution of data varies considerably among classes resulting in more training biases and variances which degrades the performance of the learning algorithm. This paper introduces three stochastic and metaheuristic algorithms for training the Multilayer Perceptron (MLP) neural network to solve the problem of imbalanced classifications. The utilized algorithms are the Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO), and the Salp Swarm Algorithm (SSA). The proposed GWO-MLP, PSO-MLP, and SSA-MLP are trained based on different objective functions; accuracy, f1-score, and g-mean. Whereas, it is evaluated based on 10 benchmark imbalanced datasets. The results show an advantage for f1-score, and g-mean fitness functions over the accuracy when the datasets are imbalanced.

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.

In recent years, Jaya optimization algorithm has been successfully applied in several optimization problems. This paper presents a novel feature selection (FS) approach based on Jaya optimization algorithm (FSJaya) along with supervised machine learning techniques to select the optimal features. This approach uses a search technique to find the best suitable features by updating the worst features to reduce the dimensions of the feature space. This improves the performance of supervised machine learning techniques. The effectiveness of the proposed approach is evaluated for ten benchmark datasets and compared with several FS approaches such as FS using genetic algorithm (FSGA), FS using particle swarm optimization algorithm (FSPSO), and FS using differential evolutionary (FSDE). The experimental result has shown that the average classification accuracy of FSJaya on most of the datasets is superior over the existing methods such as FSGA, FSPSO, and FSDE. The proof of statistical significance of the proposed approach has been validated by using Friedman and Holm test. This proposed approach is found efficient in selecting an optimal subset of features as compared to other counterparts.

Geochemical parameters are useful properties to enhance hydrocarbon exploration certainty. Though, attaining these parameters, for instance total organic carbon (TOC), volatile and residual hydrocarbon (S1 & S2) has a challenge for geologists due to high cost and time consumption. Therefore, addressing this issue has become an interesting subject for many researchers. As a result, on the ground of conventional well logs, vast kinds of methods, for example, back propagation artificial neural network (BPANN), have been introduced to solve this problem. Implementing these kinds of methods bring scientists tremendous amounts of information related to the richness of organic matter in a meantime. However, the precision of the aforementioned method is inadequate and BPANN is affected negatively by local optimum. Therefore, in the current study to cope with this issue and alleviate the uncertainty, Least Squares Support Vector Machine (LSSVM) and Adaptive-Neuro Fuzzy Inference System (ANFIS) algorithms cooperating with the particle swarm optimization (PSO) were suggested as a suitable method to increase the precision of estimating geochemical factors. The Data bank for this research was attained from available sources of Shahejie formation from Bohai bay basin located in China which consists of geochemical and well logging information. Outputs of this study illustrated that ANFIS-PSO and LSSVM-PSO have a great ability to estimate geochemical parameters. The values of R2 obtained for these two models in order to predict the output parameters of TOC, S1 and S2 are equal to 0.6846 & 0.785, 0.6864 & 0.778, and 0.7343 & 0.8128, respectively. The statistical comparison between these models shows that LSSVM-PSO shows a better performance compared to another model. Also, a new attempt was implemented to evaluate the impacts of input parameters on the outputs and the results of sensitivity analysis suggest that transit interval time had the greatest effect on the output parameters.

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.

This study is concerned with the concept of Ensemble Fuzzy Radial Basis Function Neural Networks (EFRBFNN) endowed with clustering techniques, polynomial-based LSE/WLSE learning as well as their optimization implemented by Multi-Objective Particle Swarm Optimization (MOPSO). The network architecture of the proposed EFRBFNN classifier is considered three types of clustering techniques and four forms of regression polynomials. The proposed classifier can not only fully capture the local distribution (feature) information contained in the data, but also choose effective network architecture for improving classification performance and compactness. Three classes of clustering techniques (such as iterative self-organizing data analysis techniques algorithm (ISODATA), affinity propagation (AP), and extended K-means) are considered to effectively produce membership degrees based on feature information extraction suitable to fit data characteristics. Least Square Error Estimation (LSE) and Weighted Least Square Error Estimation (WLSE)-based learning with four types of regression polynomials are considered to estimate to coefficients of polynomials. MOPSO is exploited for choosing the effective architecture among different clustering techniques, polynomials, and polynomial-based learning with multi-objective parametric optimization. MOPSO helps achieve a sound compromise between the preferred classification performance and the compactness realized with the aid of four objective functions such as a) classification accuracy (CA), b) complexity of clustering, c) complexity of polynomial and d) sum of squared coefficients (SSC). The improvement and effectiveness of the proposed network architecture are quantified on a basis of the comprehensive experimental results and also a comparative analysis is offered to demonstrate the superiority of the proposed classifier.

Reliable modeling of river sediments transport is important as it is a defining factor of the economic viability of dams, the durability of hydroelectric-equipment, river susceptibility to pollution, suitability for navigation, and potential for aesthetics and fish habitat. The capability of a new machine learning model, fuzzy c-means based neuro-fuzzy system calibrated using the hybrid particle swarm optimization-gravitational search algorithm (ANFIS-FCM-PSOGSA) in improving the estimation accuracy of river suspended sediment loads (SSLs) is investigated in the current study. The outcomes of the proposed method were compared with those obtained using the fuzzy c-means based neuro-fuzzy system calibrated using particle swarm optimization (ANFIS-FCM-PSO), ANFIS-FCM, and sediment rating curve (SRC) models. Various input combinations involving lagged river flow (Q) and suspended sediment (S) values were used for model development. The effect of Q and S on the model's accuracy also was assessed by including the difference between lagged Q and S values as inputs. The model performance was assessed using the root mean square error (RMSE), mean absolute error (MAE), Nash-Sutcliffe Efficiency (NSE), and coefficient of determination (R2) and several graphical comparison methods. The results showed that the proposed model enhanced the prediction performance of the ANFIS-FCM-PSO (or ANFIS-FCM) models by 8.14% (1.72%), 14.7% (5.71%), 12.5% (2.27%), and 25.6% (1.86%), in terms of the RMSE, MAE, NSE and R2, respectively. The current study established the potential of the proposed ANFIS-FCM-PSOGSA model for simulation of the cumulative sediment load. The modeling results revealed the potential effects of the river flow lags on the sediment transport quantification.

Function approximation is an important task in many different fields like economics, engineering, computing, classification, and forecasting. From a finite data set, the basic task of a function approximation method is to find a suitable relationship between variables and their corresponding responses. In the recent past, the improved neural networks including intuitive, interpretable correlated-contours fuzzy rules for classification tasks were proposed. However, the acquired data set can contain large volume of data and noise that degrades the classification ability of the model and increases the computational time. Thus, it is important to consider this problem which was not focused on recent existing works. Furthermore, there are also some neuron regularization issues in the second layer. To solve this issue in this proposed system Bat optimization based feature selection is proposed for optimal selection of features from the available dataset. Then classification is done by using enhanced neural network including intuitive and interpretable correlated-contours fuzzy rules (EC-FR). According to fuzzy rules extraction, an appropriate framework is built-in which similarity-based directional component of data partitioning and also a model to form cloud data is presented. Neurons weight and bias values are computed by adapting wavelet functions. Finally, parameters of the fuzzy neural networks are fine-tuned using the hybrid ant colony particle swarm optimization (HASO). Performance is evaluated primarily in accordance with the subsequent metrics like precision, recall, accuracy, and error rate.

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.

Cloud datacenters have become overwhelmed with data-intensive applications due to the limited computational capabilities of mobile terminals. Mobile edge computing is emerging as a potential paradigm to host application execution at the edge of networks to reduce transmission delays. Compute nodes are usually distributed in edge environments, enabling crucially efficient task scheduling among those nodes to achieve reduced processing time. Moreover, it is imperative to conserveedge server energy, enhancing their lifetimes. To this end, this paper proposes a novel task scheduling algorithm named Energy-aware Double-fitness Particle Swarm Optimization (EA-DFPSO) that is based on an improved particle swarm optimization algorithm for achieving energy efficiency in an edge computing environment along with minimal task execution time. The proposed EA-DFPSO algorithm applies a dual fitness function to search for an optimal tasks-scheduling scheme for saving edge server energy while maintaining service quality for tasks. Extensive experimentation demonstrates that our proposed EA-DFPSO algorithm outperforms the existing traditional scheduling algorithms, in terms of achieving reduced task completion time and conserving energy in an edge computing environment.

In the process of shale gas drilling, geo-steering plays an important role in shale gas drilling. This paper analyzes the constituent elements of shale formation, and selects the most suitable constituent elements of shale formation. A particle swarm optimization algorithm based on improved inertia weight and acceleration factor is proposed to optimize the parameters of support vector machine. The lithology identification model of shale formation is established based on IPSO-SVM. According to the experimental analysis based on the field historical data, the recognition rate of IPSO-SVM is increased by 17.79%, 10.17% and 8.05%, respectively, compared with SVM, GA-PSO and PSO-SVM. In terms of running time, the running time of IPSO-SVM is 13.76s and 9.5s shorter than that of GA-PSO, PSO-SVM, respectively. By comparing the experimental results of different models, IPSO-SVM has the advantages of strong robustness, strong reliability, high accuracy and fast convergence speed. It provides a theoretical basis for precise geo-steering and finding the optimal shale layer.

Face is an important characteristic for biometric identification and verification systems, as it holds the needed information about individual’s identity. However, it is the characteristic most impacted by aging process, and facial aging is the main effect which decreases significantly the performance of face recognition algorithms. The main idea of this study relies on the fact that aging affects facial components such as mouth, eyes and nose differently. Therefore, we suggest to consider face as an independent component set, and each facial component (eyes, mouth, and nose) will be processed separately, and we propose an effective component-based method for age-invariant face recognition using a Discriminant Correlation Analysis(DCA) as a feature-level fusion algorithm to combine Deep-based features computed from separated facial components, and a Support Vector Machine (SVM) as a classifier. To evaluate the proposed approach, a comprehensive experimental study is performed on a widely used face-aging database, namely FG-NET, also the proposed method has been compared with a Particle Swarm Optimization (PSO)-based score-level fusion method. Experimental results show that the proposed component-based system worked effectively for face recognition across age progression, as it achieves significant high mean accuracy rates.

The operation of connected platooning vehicles (CPVs) with V2V and V2I techniques has the potential to decrease the overall aerodynamic drag and reduce fuel consumption. One of the key technologies for CPVs is the spacing control which is heavily dependent on the drag force. However, the existing studies on drag coefficient of CPVs seldom pay attention to heterogeneous platoon, and most analysis only consider the effect of vehicle spacing and ignore key information such as cross-sectional area of adjacent vehicles. In addition, most research only focuses on qualitative research, without concluding a quick formula for calculating vehicle drag coefficient in a platoon. In this work, we investigate the modeling and estimation of drag coefficient in terms of the inter-vehicle distances, the platoon configurations, and the cross-sectional area of the adjacent vehicles. We calculate the drag coefficients for ten categories of vehicles with different inter-vehicle distances via numerical analysis in the software FLUENT. According to hundreds of the analysis results, we propose a model to estimate the drag correction factor online. A hybrid algorithm combining the BP neural network (BPNN) and particle swarm optimization (PSO) is employed to optimize the parameters in the model. The model is validated via three kinds of regression evaluation indexes and additional simulation tests with different platooning configurations and different types of vehicles. In terms of the comparison results, the developed model is effective to estimate the drag coefficients of CPVs.

The difference between load demand in the off-peak and peak period is usually high in the context of Nepal, and the high peak load for a short time is the main reason for insufficiency in electricity, frequent electricity outage, and poor power quality. This paper investigates the effectiveness of the time of use (TOU) strategy to reduce peak demand and to improve power quality. TOU electricity price is one of the electric demand response (DR) strategies, which may motivate the customers to reduce their consumption in peak periods and shift load in the off-peak period, which propel the electricity industry towards a higher efficiency compared to that of common flat prices. In this paper, a process based on an equal step length iteration algorithm is used to obtain an optimal period partition. Using the particle swarm optimization (PSO) algorithm, a TOU-based optimization model is proposed to find the optimal electricity price. Then, its impact on peak demand reduction and voltage fluctuation is analyzed. The impact of TOU price on peak demand reduction is investigated in the hourly load profile of Nepal, which indicates the significant reduction in peak demand. Similarly, the impact on voltage fluctuation is analyzed through a case study of the IEEE 33-bus radial distribution test system, which shows voltage profile is improved.

Numerical control electrical discharge machining (NC EDM) is one of the most widely used machining technologies for manufacturing a closed blisk flow path, particularly for three-dimensional (3D) curved and twisted flow channels. In this process, tool electrode design and machining trajectory planning are the key factors affecting machining accessibility and efficiency. Herein, to reduce the difficulty in designing the electrode and its motion path in the closed curved and twisted channels, a heuristic search hybrid optimisation strategy based on channel grids is adopted to realise the initial electrode trajectory design search and optimised size reduction. By transferring the trajectory optimisation constraints from the complex free-form surface to numbered grids, the search is found to be more orderly and accurate. The two trajectory indicators, namely argument angle and minimum distance, are analysed separately for the optimised results of the adaptive learning particle swarm optimisation algorithm, demonstrating that they can meet the actual processing requirements. Experimental results of NC EDM indicate that the motion path generated by this design method can meet the machining requirements of 3D curved and twisted flow channels.

To solve the problem energy deficit encountered in developing countries, Hybrid Renewable Energy System (HRES) appears to be a very good solution. The paper presents the optimal design of a hybrid renewable energy system considering the technical i.e Loss of Power Supply Probability (LPSP), economic i.e Cost of Electricity (COE) and Net Present Cost (NPC) and environmental i.e Total Greenhouse gases emission (TGE) aspects using Particle Swarm Optimization (PSO), hybrid Particle Swarm Optimization-Grey Wolf Optimization (PSOGWO), hybrid Grey-Wolf Optimization-Cuckoo Search (GWOCS) and Sine-Cosine Algorithm (SCA) for a Community multimedia center in MAKENENE, Cameroon; where inhabitants have to spend at times 3 to 4 days of blackout. Seven configurations (Scenarios) of hybrid energy systems including PV, WT, Battery and Diesel generator are analyzed considering an average daily energy load of 50.22 kWh with a peak load of 5.6 kW. Four values of the derating factor i.e 0.6, 0.7, 0.8 and 0.9 are used in this analysis and the best value is 0.9. Scenario 3 with LPSP, COE, NPC, TGE and RF of 0.003%, 0.15913 $/kWh, 46953.0485 $, 2.3406 kg/year and 99.8 % respectively when using GWOCS is found to be the most appropriate for the Community multimedia center. The optimal Scenario is obtained for a system comprising of 18 kW of P p v − r a t e d corresponding to 69 solar panels, 3 days of AD corresponding to a total battery capacity of 241 kWh and 1 of N d g .

In a large-scale wind farm, under the influence of the wake effect, the single-machine maximum power extraction control strategy would not be able to function at the ideal optimal value. It is important to study the coordinated operation strategy of the wind farm under the wake effect to improve the output power of wind farms and improve the economic benefit. In this paper, a practical wake model called the PARK model is used and a wake superposition model based on energy balance is derived. Based on these models, an optimization problem is formulated to maximize the output power of the wind farm considering the wake effect. Taking the Horns Rev offshore wind farm as an example, the stochastic points method, particle swarm optimization, and the pattern search algorithm are implemented and compared with the single-machine maximum power extraction algorithm. Test results show that the particle swarm optimization and the pattern search algorithm have better performance. The output power of the wind farm increases by about 10 percent. The particle swarm optimization requires less computation while the pattern search algorithm obtains better and more practical results. Finally, the pattern search algorithm is used to improve economic benefits under different wind conditions.

Focused energy delivery (FED) is a technique that can precisely bring energy to the specific region, which arouses wide attention in precision electronic warfare (PREW). This paper first proposes a joint optimization model with respect to the locations of the array and the transmitted signals to improve the performance of FED. As the problem is nonconvex and NP-hard, particle swarm optimization (PSO) is adopted to solve the locations of the array, while designing the transmitted signals under a feasible array is considered as a unimodular quadratic program (UQP) subproblem to calculate the fitness criterion of PSO. In the PSO-UQP framework established, two methods are presented for the UQP subproblem, which are more efficient and more accurate respectively than previous works. Furthermore, a threshold value is set in the framework to determine which method to adopt to take full advantages of the methods above. Meanwhile, we obtain the maximum localization error that FED can tolerate, which is significant for implementing FED in practice. Simulation results are provided to demonstrate the effectiveness of the joint optimization algorithm, and the correctness of the maximum localization error derived.

The research fields in the fields of information science and computer are very extensive, and there are many research hotspots. Intelligent optimization algorithm is one of the research hotspots. One of the key issues found in research papers in this field is how to effectively improve the search quality of intelligent optimization algorithms in a complex work environment. As a multi-functional swarm algorithm, particle swarm optimization has relatively few parameters, good convergence, and relatively fast working speed. It is a popular intelligent algorithm. In the process of studying the optimal operation of the combined cooling, heating and power system, in order to better dispatch the output of each device in the combined cooling, heating and power system, a combination of chaotic search based on Tent mapping and nonlinear adaptive particle swarm optimization is proposed Optimization algorithm. Taking the operating cost, pollutant emission and energy efficiency of the cogeneration system as the goals, a multi-objective optimization model was established. The simulation results show that the proposed cooling, heating and power cogeneration system optimization method can effectively improve economic benefits, reduce pollution emissions, and improve energy utilization. The traditional model cannot accurately analyze the environmental pollution mitigation effect. In order to avoid this problem, a modeling analysis of the impact of wind power photovoltaic clean energy on the mitigation of environmental pollution is proposed, thereby building a wind power photovoltaic clean energy organization structure and maintaining the application of wind power photovoltaic clean energy the stability of the range. Set wind power photovoltaic clean energy to alleviate environmental pollution factors, and determine the degree of environmental pollution limited by natural numbers under continuous use of polynomial constraints.

Clustering is a popular data analysis tool that groups similar data objects into disjoint clusters. Clustering algorithms have major drawbacks, such as: sensitivity to initialization and getting trapped in local optima. Swarm Intelligence (SI) have been combined with clustering techniques to enhance their performance. Despite their improvements, some SI methods, such as Particle Swarm Optimization (PSO) and its rivals, had their drawbacks, such as low convergence rates and generating low quality solutions. This is due to storing a single best solution about solution space, which can lead swarm members to local optima. Whale Optimization Algorithm (WOA) is a recent SI method, which has been proved as a global optimizer over multiple optimization problems. Unlikely, WOA uses the same concept as PSO, it uses the best solution to reposition swarm members. To overcome this problem, WOA needs to store multiple best solutions about solution space. Tabu Search (TS) is a meta-heuristic method, which uses memory components to explore and exploit search space. In this paper, we propose combining WOA with TS (WOATS) for data clustering. To assess the efficiency of WOATS, it has been applied in data clustering. WOATS uses an objective function inspired by partitional clustering to maintain the quality of clustering solutions. WOATS was tested over multiple real life datasets, which their sizes vary from small to large-sized datasets. WOATS was able to find centers with high quality in a small number of iterations regardless of the size of the dataset, which clarifies its ability to cover the solution space efficiently. The generated clusters were evaluated according to different outlier criteria: Davies-Bouldin Index and Dunn Index. According to these criteria, WOATS presented its superiority over multiple recent original and hybrid SI methods for different datasets. Results obtained by WOATS were better than the results of the other methods with big differences regarding to the different outlier criteria, which ensured the efficiency of WOATS.

This paper presents a new Reinforcement Learning (RL)-based control approach that uses the Policy Iteration (PI) and a metaheuristic Grey Wolf Optimizer (GWO) algorithm to train the Neural Networks (NNs). Due to an efficient tradeoff to exploration and exploitation, the GWO algorithm shows good results in NN training and solving complex optimization problems. The proposed approach is compared to the classical PI RL-based control approach using the Gradient Descent (GD) algorithm, and with the RL-based control approach which uses the metaheuristic Particle Swarm Optimization (PSO) algorithm. The experiments are conducted using a nonlinear servo system laboratory equipment. Each approach evaluated on how well it solves the optimal reference tracking control for an experimental servo system position control system. The policy NNs specific to all three approaches are implemented as state feedback with integrator controllers to remove the steady-state control errors and thus ensure the convergence of the objective function. Because of the random nature of metaheuristic algorithms, the experiments for GWO and PSO algorithms are run multiple times and the results are averaged before the conclusions are presented. The experimental results shows that for the control objective considered in this paper, the GWO algorithm represents a better solution compared to GD and PSO algorithms.

A wireless sensor network (WSN) includes more low-cost and less-power sensor nodes. All the sensor nodes are positioned in a particular area and form a wireless network by way of self-organizing. They has the ability to work normally at any of the special or wicked environ that people cannot close. However, the data transmission among nodes in an effective way is almost not possible due to various complex factors. Clustering is a renowned technique to make the transmission of data more effective. The clustering model divides the sensor nodes into various clusters. Every cluster in network has unique cluster head node, which send the information to other sensor nodes in cluster. In such circumstances, it is the key role of any clustering algorithm to choose the optimal cluster head under various constraints like less energy consumption, delay and so on. This paper develops a new cluster head selection model to maximize the lifetime of network as well as energy efficiency. Further, this paper proposes a new Fitness based Glowworm swarm with Fruitfly Algorithm (FGF), which is the hybridization of Glowworm Swarm Optimization (GSO) and Fruitfly Optimization algorithm (FFOA) to choose the best CH in WSN. The performance of developed FGF is compared to other existing methods like Particle swarm Optimization (PSO), Genetic Algorithm (GA), Artificial Bee Colony (ABC), GSO, Ant Lion Optimization (ALO) and Cuckoo Search (CS), Group Search Ant Lion with Levy Flight (GAL-LF), Fruitfly Optimization algorithm (FFOA) and grasshopper Optimization algorithm (GOA) in terms of alive node analysis, energy analysis and cost function and the betterments of proposed work is also proven.

Orthogonal Frequency Division Multiplexing (OFDM) is the best choice for wireless and wired high data rate communications. The OFDM system has many advantages such as high spectral efficiency, robustness to channel fading, and immunity to impulse interference. However, it has a main drawback, which is the Peak to Average Power Ratio (PAPR). Selecting Mapping (SLM) and Partial Transmit Sequences (PTS) are the two essential techniques for reducing the PAPR; however, they need to send side information to indicate how the transmitter generates signals. In this paper, Particle Swarm Optimization (PSO)-based dummy sub-carriers are inserted with the data to reduce PAPR without transmitting side information. The incorporation of PSO-based Dummy Sub-carriers Insertion (DSI) method on this system is performed by measuring the PAPR at the IFFT output (Inverse Fast Fourier Transform) after adding 6 adaptive sub-carrier sequences to the input data of IFFT. The PSO-based dummy algorithm decides to send the data once the PAPR of this data sequence and dummy sub-carrier is under a specific threshold. Using MATLAB as a mathematical simulation tool, simulation results are presented for a standard OFDM network model. The network model has been simulated in an Additive White Gaussian Noise (AWGN) channel environment to investigate PAPR and Bit-Error Rate (BER) performance. The simulation results show that the dummy sequence based on PSO reduces PAPR down to 4 dB compared to a conventional OFDM system and down to 3 dB compared with the clipping technique for the same BER performance.

This study provides a novel methodology to predict monthly water demand based on several weather variables scenarios by using combined techniques including discrete wavelet transform, principal component analysis, and particle swarm optimisation. To our knowledge, the adopted approach is the first technique to be proposed and applied in the water demand prediction. Compared to traditional methods, the developed methodology is superior in terms of predictive accuracy and runtime. Water consumption coupled with weather variables of the Melbourne City, from 2006 to 2015, were obtained from the South East Water retail company. The results showed that using data pre-processing techniques can significantly improve the quality of data and to select the best model input scenario. Additionally, it was noticed that the particle swarm optimisation algorithm accurately predicts the constants of the suggested model. Furthermore, the results confirmed that the proposed methodology accurately estimated the monthly data of municipal water demand based on a range of statistical criteria.

Since last few years, microarray technology has got tremendous application in many bio-medical researches. However, in order to efficiently recognize and apply this technology into the bio-medical areas is still very difficult and expensive. There are many metaheuristic approaches has been developed with different biological interpretation. Despite the existence of several approaches, there is always a requirement of development of more robust and efficient approach. In this work a new metaheuristic approach is proposed implementing binary shuffled frog leaping algorithm (BSFLA) for gene selection. To obtain an optimal gene subset, 20 different combination of gene subset is extracted from the original dataset. Out of which the optimal gene subset is identified implementing KNN classifier. Superiority of these gene set is shown using few other classifiers such as ANN and SVM. The model performance is also compared with few other metaheuristic approaches such as particle swarm optimization, differential evolution and genetic algorithm.

The design parameters of heat pumps are related to each other nonlinearly or in a complicated manner; therefore, it is difficult to determine the optimal combination of design parameters, such as superheat, subcooling, and refrigerant type, analytically. To address this limitation, three representative heuristic algorithms, namely the genetic algorithm (GA), particle swarm optimization (PSO), and simulated annealing (SA), are applied to optimize a heat pump under the given process conditions. Heuristic algorithms are driven based on randomness; thus, the consistency of the calculation results and computational time represent the decision criteria for the appropriate optimizer. The GA is unsuitable as a heat pump optimizer because it requires an excessive number of iterations. In contrast, PSO and SA have a similar capability of consistency and calculation time with a rational number of iterations. In conclusion, PSO exhibits a slightly better consistency and use of computational resources; therefore, PSO is selected as the heat pump design optimization algorithm in this study. The novelty of this work lies in that the related design parameters of the heat pump are simultaneously globally optimized with minimal physical background, and the heuristic algorithm that is most applicable to heat pump design optimization is determined.

Improved Fractional Order Darwinian Particle Swarm Optimization (FODPSO) has been proposed to identify the parameters of solar PV cells and modules. For this purpose, the traditional PSO algorithm has been adapted and an improved one using the fractional order calculus has been especially designed as well. The proposed FODPSO together with the PSO has been applied in both the single and double diode models to describe the specified PV units for purpose of comparison. To examine the advantages of the proposed FODPSO over conventional PSO, two approaches have been performed; the first approach is implementing the FODPSO and PSO algorithms using input data obtained from previous international publications for different types of PV cells/modules, then comparing the FODPSO algorithm's results to the results of PSO and the other previous optimization techniques that were using the same input data and identical PV cells/modules. The second validation approach is achieved by performing real measurements in outdoor conditions for another two types of PV modules (mono and poly crystalline Silicon) and inserting these measurements' readings as input data to the PSO and FODPSO algorithms. A comparative study has also been done for both algorithms' results. Enhanced results have been achieved using the FODPSO technique. It is worth mentioning that during the development of this work, other efforts have been made with different techniques that may result in similar or even better results, yet this paper is still introducing for the first time the FODPSO technique (as a modified technique of the PSO) as applied on the PV modeling problem, in addition the paper presents the benefits of the proposed FODPSO over the conventional PSO and presents a comparison that shows the superiority of the FODPSO over the conventional PSO.

Recently, the numerical optimization field has attracted the research community to propose and develop various metaheuristic optimization algorithms. This paper presents a new metaheuristic optimization algorithm called Honey Badger Algorithm (HBA). The proposed algorithm is inspired from the intelligent foraging behavior of honey badger, to mathematically develop an efficient search strategy for solving optimization problems. The dynamic search behavior of honey badger with digging and honey finding approaches are formulated into exploration and exploitation phases in HBA. Moreover, with controlled randomization techniques, HBA maintains ample population diversity even towards the end of the search process. To assess the efficiency of HBA, 24 standard benchmark functions, CEC’17 test-suite, and four engineering design problems are solved. The solutions obtained using the HBA have been compared with ten well-known metaheuristic algorithms including Simulated annealing (SA), Particle Swarm Optimization (PSO), Covariance Matrix Adaptation Evolution Strategy (CMA-ES), Success-History based Adaptive Differential Evolution variants with linear population size reduction (L-SHADE), Moth-flame Optimization (MFO), Elephant Herding Optimization (EHO), Whale Optimization Algorithm (WOA), Grasshopper Optimization Algorithm (GOA), Thermal Exchange Optimization (TEO) and Harris hawks optimization (HHO). The experimental results, along with statistical analysis, reveal the effectiveness of HBA for solving optimization problems with complex search-space, as well as, its superiority in terms of convergence speed and exploration–exploitation balance, as compared to other methods used in this study. The source code of HBA is currently available for public at https://www.mathworks.com/matlabcentral/fileexchange/98204-honey-badger-algorithm .

A medical or business representative visits and spends some time (termed ‘stay time’) at different cities(nodes) for optimum return. With the rapid development of infrastructures worldwide, several vehicles and routes are available for transport between nodes. Road logistic transportation contributes 10.5% of the total emitted carbon emission (CE). Heuristic method is applied to solve NP-hard problems with continuous/discrete variables. With these facts, here, CE/tour-time constrained profit maximization of green four-dimensional Travelling Salesman Problems (PMG4DTSPs) with both discrete (travel times between nodes) and continuous (stay-times at nodes) variables are formulated. A travelling salesman visits all cities using the appropriate routes and conveyances, spend some time at each node, and some revenues are earned and spent depending upon the stay time at those visiting places. There are toll plazas on the roads, where three types of fixed charges (online, offline, mixed online–offline) are collected as road taxes to maintain the roads. A green constraint is incorporated in the form of limited emission. Several connecting routes between the cities and conveyances at each city are available for travel. Thus, these (PMG4DTSPs) are mixed integer linear programming problems (NP-hard), and to solve them, two hybrid heuristic methods, GA-ABC and GA-PSO, are developed and used. Here, GA and ABC/PSO are used for optimum routing plan and stay time, respectively. The models are illustrated numerically. Multi-path justification, online payment advantage and tour time limitation effect on profit are presented. Some behavioural studies of Green models and managerial decisions are presented.

Mobile robots are playing an important role in modern industries. The deployment of robots which act as mobile helpers in a wireless network is rarely considered in the existing studies of the device-to-device (D2D) caching schemes. In this paper, we investigate the optimal caching scheme for D2D networks with multiple robot helpers with large cache size. An improved caching scheme named robot helper aided caching (RHAC) scheme is proposed to optimize the system performance by moving the robot helpers to the optimal positions. The optimal locations of the robot helpers can be found based on partitioned adaptive particle swarm optimization (PAPSO) algorithm. And based on these two algorithms, we propose a mobility-aware optimization strategy for the robot helpers. The simulation results demonstrate that compared with other conventional caching schemes, the proposed RHAC scheme can bring significant performance improvements in terms of hitting probability, cost, delay and energy consumption. Furthermore, the location distribution and mobility of the robot helpers are studied, which provides a reference for introducing robot helpers into different scenarios such as smart factories.