Search

To solve the problems of high storage resource consumption and low efficiency of the RRT exploration algorithm in the late stage of exploration, this paper proposes an Improved Artificial Fish Swarm based Optimize Rapidly-exploring Random Trees multi-robot Exploration Algorithm. Firstly, the efficiency of a single robot's exploration of nearby unknown regions is improved by dynamically adjusting the step size of the RRT tree.Secondly, the improved artificial fish swarm algorithm is used to delete the redundant nodes in the RRT tree and optimize the node state in the RRT tree, which reduces the occupation of memory resources and improves the exploration efficiency of the RRT tree in the narrow environment.Results from comparative experiments in simulation environments with different degrees of openness show that the optimized exploration algorithm can save significant storage resources and show better exploration performance in narrow environments compared to the original RRT exploration algorithm. [ABSTRACT FROM AUTHOR]

Among the indoor localization algorithms, the algorithm based on traditional Back Propagation Neural Network (BPNN) has the problems of slow convergence and easy to fall into local optimum. It is difficult to apply the algorithm in noisy environments. Therefore, in this paper, we propose a novel indoor localization algorithm where the whole localization process is divided into two parts: data preprocessing and localization output. Data preprocessing means using filtering algorithm to process the Received Signal Strength Indication (RSSI) sequence. It is considered that the initial value of the received sequence has a significant impact on the performance of Kalman Filter (KF). An improved Kalman Filtering algorithm (DBSCAN-KF) is proposed based on the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. First, the RSSI values that are seriously disturbed by noise in the sequence are removed using the DBSCAN algorithm, and then the RSSI sequences are processed using KF so that the RSSI values can be closer to the theoretical values. The localization output part is to reduce the localization error caused by the BPNN. In this paper, the Differential Evolution (DE) algorithm and Particle Swarm Optimization (PSO) algorithm are combined, and the Differential Evolution Particle Swarm Optimization (DE-PSO) algorithm is proposed. The BPNN weights and thresholds are optimized in parallel, which improves the speed and ability of global optimization search and further avoids the shortcomings of traditional BPNNs that are prone to fall into local optimization in the training process. Experimental results show that the BPNN localization algorithm based on DBSCAN-KF improves the average localization accuracy by 0.26m compared with the BPNN localization algorithm without filtering. After filtering, the localization algorithm based on DE-PSO improved BPNN (DE-PSO-BP) improves the average localization accuracy by about 24% compared with the localization algorithm based on DE-PSO-BP. The localization algorithm based on DE-PSO-BP improves the average localization accuracy by about 61% compared with the traditional BPNN. [ABSTRACT FROM AUTHOR]

Swarm intelligence optimization algorithm has been proved to perform well in the field of parameter optimization. In order to further improve the performance of intelligent optimization algorithm, this paper proposes an improved and adaptive tunicate swarm algorithm (IMATSA) based on tunicate swarm algorithm (TSA). IMATSA improves TSA in the following four aspects: population diversity, local search convergence speed, jumping out of local optimal position, and balancing global and local search. Firstly, IMATSA adopts Tent map and quadratic interpolation to initialize population and enhance the diversity. Secondly, IMATSA uses Golden-Sine algorithm to accelerate the convergence of local search. Thirdly, in the process of global development, IMATSA adopts Levy flight and the improved Gauss disturbance method to adaptively improves and coordinates the ability of global development and local search. Then, this paper verifies the performance of IMATSA based on 14 benchmark functions experiment, ablation experiment, parameter optimization experiments of Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT), Wilcoxon signed rank test and image multi-threshold segmentation experiment with the performance metrics are convergence speed, convergence value, significance level P-value, Peak Signal-to-Noise Ratio (PSNR) and Standard Deviation (STD). Experimental results show that IMATSA performs better in three kinds of benchmark functions; each component of IMATSA has a positive effect on the performance; IMATSA performs better in parameter optimization experiments of SVM experiment and GBDT; there is significant difference between IMATSA and other algorithms by Wilcoxon signed rank test; in image segmentation, the performance is directly proportional to the number of thresholds, and compared with other algorithms, IMATSA has better comprehensive performance. [ABSTRACT FROM AUTHOR]

The purpose of image segmentation is to select the target region from the existing image, which is the core technology for image understanding, description and analysis. When faced with some complicated problems, the image segmentation effect of the traditional method is often unsatisfactory. As a branch of the swarm intelligence optimization algorithm, Particle Swarm Optimization (PSO) provides a new power and direction for the development of image segmentation. However, the algorithm has a large probability of loss of particle diversity in the late stage, which makes the algorithm converge prematurely. Therefore, the purpose of this paper is to improve the problem existing in the PSO algorithm and apply the improved algorithm in image segmentation. In this paper, the whole population of PSO algorithm is divided into multiple sub-populations and co-evolution. The mutation operation from the genetic algorithm is introduced at the same time. The worst sub-population is mutated according to the mutation probability. The larger inertia factor is selected to speed the particles. Update, and then carry out simulation experiments on some classical test functions. Finally, combined with the improved PSO algorithm and fuzzy C-means clustering algorithm (FCM), the fuzzy clustering validity index is introduced, and the blood cell image is segmented by the algorithm. The experimental results show that the algorithm can find a reasonable number of cluster center segmentation categories and efficiently perform adaptive segmentation of images. [ABSTRACT FROM AUTHOR]

Metaheuristics are widely used in science and industry because it as a high-level heuristic technique can provide robust or advanced solutions compared to classical search algorithms. Flow Regime Algorithm is a novel physics-based optimization approach recently proposed, and it is one of the candidate algorithms for solving complex optimization problems because of its few parameter configurations, simple coding, and good performance. However, the population that initialized randomly may have poor diversity issues, resulting in insufficient global search, and premature convergence to local optimum. To solve this problem, in this paper, a novel enhanced Flow Regime Algorithm based on opposition learning scheme is proposed. The proposed algorithm introduces the opposition-based learning strategy into the generation of some populations to enhance the global search performance while maintaining a fast convergence rate. In order to verify the performance of the proposed algorithm, 23 benchmark numerical optimization functions were studied experimentally in detail and compared with six well-known algorithms. Experimental results show that the proposed algorithm outperforms all other metaheuristic algorithms in all unimodal functions with higher accuracy, and can obtain competitive results on more multimodal cases. A statistical comparison shows that the proposed algorithm has superiority. Finally, that the proposed algorithm can achieve higher quality alignment compared to most other metaheuristic-based systems and OAEI ontology alignment systems. [ABSTRACT FROM AUTHOR]

The use of intelligent college English writing training system will certainly promote the traditional teaching structure and realize a new and efficient English writing teaching mode. On the basis of machine learning and the herd effect algorithm, this article constructs an artificial intelligence-based English intelligent writing system. Moreover, in view of the shortcomings of traditional models and the characteristics of intelligent English writing, this paper proposes an improved algorithm for optimization of swarm particle walking paths. In addition, this article proposes a relative attractiveness to initialize the formation of small-scale groups based on the herd effect. Then, in the process of intelligent writing, by establishing an information sharing mechanism between groups, each group is continuously updated and reorganized according to the relative attractiveness of the group, so that the writing process can be simulated more realistically. From the experimental research, it can be seen that the model constructed in this paper has a certain degree of intelligence. [ABSTRACT FROM AUTHOR]

The smart teaching mode overcomes the shortcomings of traditional teaching online and offline, but there are certain deficiencies in the real-time feature extraction of teachers and students. In view of this, this study uses the particle swarm image recognition and deep learning technology to process the intelligent classroom video teaching image and extracts the classroom task features in real time and sends them to the teacher. In order to overcome the shortcomings of the premature convergence of the standard particle swarm optimization algorithm, an improved strategy for multiple particle swarm optimization algorithms is proposed. In order to improve the premature problem in the search performance algorithm of PSO algorithm, this paper combines the algorithm with the useful attributes of other algorithms to improve the particle diversity in the algorithm, enhance the global search ability of the particle, and achieve effective feature extraction. The research indicates that the method proposed in this paper has certain practical effects and can provide theoretical reference for subsequent related research. [ABSTRACT FROM AUTHOR]

Hyperspectral remote sensing combines spectrum, ground space and images organically to provide humans with unprecedented rich information. However, a prominent problem faced in the extraction and identification of hyperspectral remote sensing information is mixed pixels, and the method to solve mixed pixels is mixed pixel decomposition. The purpose of this paper is to study the swarm intelligence algorithm of spatial-spectral feature extraction and mixed pixel decomposition of hyperspectral remote sensing images. This paper first introduces two different methods for extracting spatial spectrum features, then studies linear and non-linear spectral hybrid models, and then studies end element extraction methods based on quantum particle swarm optimization. The degree inversion method, the experimental part is based on the accuracy of the quantum particle swarm optimization-based end-element extraction method and two spatial-spectrum feature extraction methods. The experimental results show that the algorithm proposed in this paper improves the effect of group pixel decomposition based on the swarm intelligence algorithm. The classification accuracy of the 3DLBP spatial spectrum feature proposed in this paper is 94.22%. [ABSTRACT FROM AUTHOR]

Bat Algorithm (BA) has been extensively applied as an optimal Feature Selection (FS) technique for solving a wide variety of optimization problems due to its impressive characteristics compared to other swarm intelligence methods. Nevertheless, BA still suffers from several problems such as poor exploration search, falling into local optima, and has many parameters that need to be controlled appropriately. Consequently, many researchers have proposed different techniques to handle such problems. However, there is a lack of systematic review on BA which could shed light on its variants. In the literature, several review papers have been reported, however, such studies were neither systematic nor comprehensive enough. Most studies did not report specifically which components of BA was modified. The range of improvements made to the BA varies, which often difficult for any enhancement to be accomplished if not properly addressed. Given such limitations, this study aims to review and analyse the recent variants of latest improvements in BA for optimal feature selection. The study has employed a standard systematic literature review method on four scientific databases namely, IEEE Xplore, ACM, Springer, and Science Direct. As a result, 147 research publications over the last ten years have been collected, investigated, and summarized. Several critical and significant findings based on the literature reviewed were reported in this paper which can be used as a guideline for the scientists in the future to do further research. [ABSTRACT FROM AUTHOR]

Through the researches on various item improvements of particle swarm optimization algorithm, the improved particle swarm optimization algorithm is proposed for the insufficient global searching ability. This paper has improved the parameters of velocity formula and introduced new distance calculation formula to modify various parameters in the velocity formula. The improved particle swarm optimization algorithm has been tested by adopting standard test function, and the result has been compared with other particle swarm optimization algorithms. The experimental result indicated that the proposed improved particle swarm optimization algorithm in this paper got the better result for function optimization problems. [ABSTRACT FROM AUTHOR]

Transfer learning methods exploit similarities between different datasets to improve the performance of the target task by transferring knowledge from source tasks to the target task. "What to transfer" is a main research issue in transfer learning. The existing transfer learning method generally needs to acquire the shared parameters by integrating human knowledge. However, in many real applications, an understanding of which parameters can be shared is unknown beforehand. Transfer learning model is essentially a special multi-objective optimization problem. Consequently, this paper proposes a novel auto-sharing parameter technique for transfer learning based on multi-objective optimization and solves the optimization problem by using a multi-swarm particle swarm optimizer. Each task objective is simultaneously optimized by a sub-swarm. The current best particle from the sub-swarm of the target task is used to guide the search of particles of the source tasks and vice versa. The target task and source task are jointly solved by sharing the information of the best particle, which works as an inductive bias. Experiments are carried out to evaluate the proposed algorithm on several synthetic data sets and two real-world data sets of a school data set and a landmine data set, which show that the proposed algorithm is effective. [ABSTRACT FROM AUTHOR]

Multi-Pursuers Multi-Evader Game (MPMEG) is considered as a multi-agent complex problem in which the pursuers must perform the capture of the detected evaders according to the temporal constraints. In this paper, we propose a metaheuristic approach based on a Discrete Particle Swarm Optimization in order to allow a dynamic coalition formation of the pursuers during the pursuit game. A pursuit coalition can be considered as the role definition of each pursuer during the game. In this work, each possible coalition is represented by a feasible particle's position, which changes the concerned coalition according to its velocity during the pursuit game. With the aim of showcasing the performance of the new approach, we propose a comparison study in relation to recent approaches processing the MPMEG in term of capturing time and payoff acquisition. Moreover, we have studied the pursuit capturing time according to the number of used particles as well as the dynamism of the pursuit coalitions formed during the game. The obtained results note that the proposed approach outperforms the compared approaches in relation to the capturing time by only using eight particles. Moreover, this approach improves the pursuers' payoff acquisition, which represents the pursuers' learning rate during the task execution. [ABSTRACT FROM AUTHOR]

Oversampling ratio N and the minority class' nearest neighboring number k are key hyperparameters of synthetic minority oversampling technique (SMOTE) to reconstruct the class distribution of dataset. No optimal default value exists there. Therefore, it is of necessity to discuss the influence of the output dataset on the classification performance when SMOTE adopts various hyperparameter combinations. In this paper, we propose a hyperparameter optimization algorithm for imbalanced data. By iterating to find reasonable N and k for SMOTE, so as to build a balanced and high-quality dataset. As a result, a model with outstanding performance and strong generalization ability is trained, thus effectively solving imbalanced classification. The proposed algorithm is based on the hybridization of simulated annealing mechanism (SA) and particle swarm optimization algorithm (PSO). In the optimization, Cohen's Kappa is used to construct the fitness function, and AdaRBFNN, a new classifier, is integrated by multiple trained RBF neural networks based on AdaBoost algorithm. Kappa of each generation is calculated according to the classification results, so as to evaluate the quality of candidate solution. Experiments are conducted on seven groups of KEEL datasets. Results show that the proposed algorithm delivers excellent performance and can significantly improve the classification accuracy of the minority class. [ABSTRACT FROM AUTHOR]

Structure learning is the core of graph model Bayesian Network learning, and the current mainstream single search algorithm has problems such as poor learning effect, fuzzy initial network, and easy falling into local optimum. In this paper, we propose a heuristic learning algorithm HC-PSO combining the HC (Hill Climbing) algorithm and PSO (Particle Swarm Optimization) algorithm, which firstly uses HC algorithm to search for locally optimal network structures, takes these networks as the initial networks, then introduces mutation operator and crossover operator, and uses PSO algorithm for global search. Meanwhile, we use the DE (Differential Evolution) strategy to select the mutation operator and crossover operator. Finally, experiments are conducted in four different datasets to calculate BIC (Bayesian Information Criterion) and HD (Hamming Distance), and comparative analysis is made with other algorithms, the structure shows that the HC-PSO algorithm is superior in feasibility and accuracy. [ABSTRACT FROM AUTHOR]

This paper proposes a photovoltaic (PV) dynamic maximum power point tracking algorithm based on improved PSO (particle swarm optimization) optimization in response to the problems associated with low tracking accuracy, poor immunity, and the ease of falling into local optimization, as well as the failure of the traditional MPPT algorithm (maximum power point tracking algorithm) under partial shading conditions. Firstly, three traditional MPPT algorithms are compared and analyzed, followed by simulation testing under standard and partial shading conditions. The advantages and disadvantages of three traditional algorithms are analyzed. Secondly, it is proposed that dynamic inertia weights and learning factors be applied synchronously during the optimization process in order to speed up the tracking speed of particle swarm optimization. In order to evaluate the effectiveness of different algorithms, it is best to simulate them under static and dynamic conditions. In comparison to the standard particle swarm algorithm and three other traditional algorithms, the proposed algorithm is capable of tracking the maximum power point quickly and accurately under conditions of uniform illumination and static and dynamic partial shading. There is a faster convergence speed as well as a greater degree of accuracy at steady state. [ABSTRACT FROM AUTHOR]

In the context of this paper a three phase grid connected Photo-Voltaic (PV) system that is used to design with MPPT and developed Grey Wolf optimization (GWO) algorithm for analyzing the power quality issues in the grid system. The proposed Grey Wolf optimization (GWO) algorithm is incorporated in the prototype model and compared with other related optimization algorithms namely Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). The various loading conditions as well as solar irradiances are modeled by using MATLAB simulation and experimentally validated by a DSPIC (DS 1104) based prototype model. A three phase PV grid connected non-linear load is observed in different operating environmental conditions. The optimization control algorithms was developed and implemented in Super-Lift Inverter (SLI) grid connected system. The findings of this work are, grid reactive power demand is compensated using DSTATCOM, and also from the real power of renewable energy system. But, majority of the active power is provided or absorbed by DSTATCOM component. The objective of this proposed work is that the three optimization control algorithms are examined, and the PV integrated grid tied system maintains a compensation power at Unity Power Factor (UPF). The proposed optimization methods produce load output power factor values such as 0.89 (GWO), 0.88, (PSO) and 0.86 (GA). [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) as a successful optimization algorithm is widely used in many practical applications due to its advantages in fast convergence speed and convenient implementation. As a population optimization algorithm, the quality of initial population plays an important role in the performance of PSO. However, random initialization is used in population initialization for PSO. Using the solution of the solved problem as prior knowledge will help to improve the quality of the initial population solution. In this paper, we use homotopy analysis method (HAM) to build a bridge between the solved problems and the problems to be solved. Therefore, an improved PSO framework based on HAM, called HAM-PSO, is proposed. The framework of HAM-PSO includes four main processes. It contains obtaining the prior knowledge, constructing homotopy function, generating initial solution and solving the to be solved by PSO. In fact, the framework does not change the PSO, but replaces the random population initialization. The basic PSO algorithm and three others typical PSO algorithms are used to verify the feasibility and effectiveness of this framework. The experimental results show that the four PSO using this framework are better than those without this framework. [ABSTRACT FROM AUTHOR]

In today's era, cloud computing has played a major role in providing various services and capabilities to a number of researchers around the globe. One of the major problems we face in cloud is to identify the various constraints related with the delay in the Task accomplishment as well as the enhanced approach to execute the task with high throughput. Many studies have shown that it is almost difficult to create an ideal solution but it seems feasible to provide a sub-optimal solution utilizing heuristic algorithms. In this paper, compared to previously used particle swarm optimization (PSO), heuristic approaches, and improved PSO algorithm for efficient task scheduling, we propose "Modified Filtering Algorithm" for task scheduling on cloud setting. Comparing all these three algorithms, we strive to build an optimum schedule to reduce the completion period of execution of activities. [ABSTRACT FROM AUTHOR]

In smart city wireless network infrastructure, network node deployment directly affects network service quality. This problem can be attributed to deploying a suitable ordinary AP node as a wireless terminal access node on a given geometric plane, and deploying a special node as a gateway to aggregate. Traffic from ordinary nodes is to the wired network. In this paper, Pareto multi-objective optimization strategy is introduced into the wireless sensor network node security deployment, and an improved multi-objective particle swarm coverage algorithm based on secure connection is designed. Firstly, based on the mathematical model of Pareto multi-objective optimization, the multi-target node security deployment model is established, and the security connectivity and node network coverage are taken as the objective functions, and the problems of wireless sensor network security and network coverage quality are considered. The multi-objective particle swarm optimization algorithm is improved by adaptively adjusting the inertia weight and particle velocity update. At the same time, the elite archive strategy is used to dynamically maintain the optimal solution set. The high-frequency simulation software Matlab and simulation platform data interaction are used to realize the automatic modeling, simulation analysis, parameter prediction and iterative optimization of wireless network node deployment in smart city based on adaptive particle swarm optimization. Under the premise of meeting the performance requirements of wireless network nodes in smart cities, the experimental results show that although the proposed algorithm could not achieve the accuracy of using only particle swarm optimization algorithm to optimize the parameters of wireless network nodes in smart cities, the algorithm is completed. The antenna parameter optimization process takes less time and the optimization efficiency is higher. [ABSTRACT FROM AUTHOR]

To solve the problem that the K-means algorithm is sensitive to the initial clustering centers and easily falls into local optima, we propose a new hybrid clustering algorithm called the IGWOKHM algorithm. In this paper, we first propose an improved strategy based on a nonlinear convergence factor, an inertial step size, and a dynamic weight to improve the search ability of the traditional grey wolf optimization (GWO) algorithm. Then, the improved GWO (IGWO) algorithm and the K-harmonic means (KHM) algorithm are fused to solve the clustering problem. This fusion clustering algorithm is called IGWOKHM, and it combines the global search ability of IGWO with the local fast optimization ability of KHM to both solve the problem of the K-means algorithm's sensitivity to the initial clustering centers and address the shortcomings of KHM. The experimental results on 8 test functions and 4 University of California Irvine (UCI) datasets show that the IGWO algorithm greatly improves the efficiency of the model while ensuring the stability of the algorithm. The fusion clustering algorithm can effectively overcome the inadequacies of the K-means algorithm and has a good global optimization ability. [ABSTRACT FROM AUTHOR]

The paper presents a study on the efficiency of Ant Colony Communities (ACC) used to solve the Travelling Salesman Problem. The ACC is an approach to parallelize the Ant Colony Optimization algorithm (ACO). An ACC is made up of a Community Server that coordinates the work of a set ant colony clients. Each client implements a classical ACO algorithm. The individual colonies process cargos of data obtained from the server and send them back the as partial results. The paper presents a general description of the ACC concept and describes in details two ways of implementing it. The first one uses an inhomogeneous environment of traditional computers working in an asynchronous mode. The second one uses the homogenous Hadoop environment and the processing is done in a synchronized mode. The performance of the Communities is estimated by low level measures: their power and scalability. The high level measure deals with the length of obtained routes. The paper presents also the taxonomy of parallel implementations of the Ant Colony Optimization. [ABSTRACT FROM AUTHOR]

This paper focuses on Fuzzy rough set, which is the fusion of fuzzy sets and rough sets theory for doing feature selection. For selecting the appropriate feature subset, swarm algorithms are used. The fitness function used here is Fuzzy Rough Dependency Measure. This paper demonstrates that by optimizing the fitness function, swarm algorithms are capable to select the best subset of features. Further, in this paper, an attempt has been made to improve the capability of the swarm based algorithms such as Intelligent Dynamic Swarm (IDS) and Particle Swarm Optimization (PSO) through modified initialization of solutions, for picking the appropriate features for the feature selection task. Improvement in the size of reducts and classification accuracy of these reducts are observed when initialization is done using the proposed method. Statistical t-tests have also been performed for the validation of the results. [ABSTRACT FROM AUTHOR]

This paper proposes a fuzzy cognitive map scheme for real-time online data prediction. The fuzzy cognitive maps (FCMs) are constructed on the basis of abstracting a numerical time series into a limited number of nodes (concepts), and used as a modeling tool for predicting time series. By representing time series in terms of information granules constructed in the space of amplitude and change of amplitude of the time series, a fuzzy cognitive map is dynamically constructed by using the set of information granule, where the particle swarm optimization (PSO) is utilized to study the parameters. In order to find better weights in the global search process, each parameter of the particle swarm algorithm (PSO) is not set to a fixed value but adaptively changes. In this paper, a dynamic fuzzy C-means clustering algorithm is used to online adjust the cluster center and weight according to the impact of the incoming data at the current moment such that the model can capture real-time changes in the data information. The proposed approach is illustrated in detail by a series of experiments using a collection of publicly available data. [ABSTRACT FROM AUTHOR]

Intelligent systems generally face optimization problems when solving specific problems, and complex optimization problems are usually non-deterministic polynomial complete (NPC) problems. To solve such problems, approximation methods are generally adopted. This paper presents an accurate method for finding an optimal solution to probability 1 in polynomial time. It combines intelligent optimization algorithms such as ordinal optimization, simulated annealing, genetic algorithm (differential evolution algorithm), tabu search, ant colony algorithm, particle swarm optimization, space neighborhood sampling, time neighborhood sampling, number neighborhood sampling (knowledge neighborhood sampling). Then it draws on the matrix ideas of Riemann Hypothesis, prime distribution formula, random number generator, maximum entropy heuristics (proposed by this paper), and combines a new group ordinal optimization algorithm framework proposed by this paper to Traveling Salesman Problem (TSP, a NPC problem) as an example and constructs a polynomial algorithm. The theoretical time complexity is O(N^4) (considering parallel computing), and is verified based on some examples. [ABSTRACT FROM AUTHOR]

In this paper, an interactive fuzzy satisfying method based on fuzzy adaptive chaotic binary particle swarm optimization (FACBPSO) algorithm is proposed to investigate the multi-objective Generation and Transmission Expansion Planning (G-TEP). The objective functions of the G-TEP problem, which are modeled by fuzzy sets, present the total investment/ operation cost and the total pollutant emission. In modern power systems, the necessity of considering the wind/solar energy resources in Generation Expansion Planning (GEP) studies is important. In addition, HVDC links, transmitting renewable resource power from remote sites, should be considered in TEP problem. The use of the wind/solar energy due to the uncertainty of their generation and the integration of HVDC links would consequently impose more complexity to solution of the G-TEP problem. In this paper, the proposed algorithm is tested on an IEEE test system based on economic and environmental considerations to generate an optimal expansion plan. [ABSTRACT FROM AUTHOR]

Aiming at the disadvantages of slow convergence and the premature phenomenon of the butterfly optimization algorithm (BOA), this paper proposes a modified BOA (MBOA) called reverse guidance butterfly optimization algorithm integrated with information cross-sharing. First, the quasi-opposition concept is employed in the global search phase that lacks local exploitation capabilities to broaden the search space. Second, the neighborhood search weight factor is added in the local search stage to balance exploration and exploitation. Finally, the information cross-sharing mechanism is introduced to enhance the ability of the algorithm to jump out of the local optima. The proposed MBOA is tested in fourteen benchmark functions and three constrained engineering problems. The series of experimental results indicate that MBOA shows better performance in terms of convergence speed, convergence accuracy, stability as well as robustness. [ABSTRACT FROM AUTHOR]

Solving the shortest path problem is very difficult in situations such as emergency rescue after a typhoon: road-damage caused by a typhoon causes the weight of the rescue path to be uncertain and impossible to represent using single, precise numbers. In such uncertain environments, neutrosophic numbers can express the edge distance more effectively: membership in a neutrosophic set has different degrees of truth, indeterminacy, and falsity. This paper proposes a shortest path solution method for interval-valued neutrosophic graphs using the particle swarm optimization algorithm. Furthermore, by comparing the proposed algorithm with the Dijkstra, Bellman, and ant colony algorithms, potential shortcomings and advantages of the proposed method are deeply explored, and its effectiveness is verified. Sensitivity analysis performed using a 2020 typhoon as a case study is presented, as well as an investigation on the efficiency of the algorithm under different parameter settings to determine the most reasonable settings. Particle swarm optimization is a promising method for dealing with neutrosophic graphs and thus with uncertain real-world situations. [ABSTRACT FROM AUTHOR]

Context-Aware Recommender System (CARS) suggests more relevant services by adapting them to the user's specific context situation. Nevertheless, the use of many contextual factors can increase data sparsity while few context parameters fail to introduce the contextual effects in recommendations. Moreover, several CARSs are based on similarity algorithms, such as cosine and Pearson correlation coefficients. These methods are not very effective in the sparse datasets. This paper presents a context-aware model to integrate contextual factors into prediction process when there are insufficient co-rated items. The proposed algorithm uses Latent Dirichlet Allocation (LDA) to learn the latent interests of users from the textual descriptions of items. Then, it integrates both the explicit contextual factors and their degree of importance in the prediction process by introducing a weighting function. Indeed, the PSO algorithm is employed to learn and optimize weights of these features. The results on the Movielens 1 M dataset show that the proposed model can achieve an F-measure of 45.51% with precision as 68.64%. Furthermore, the enhancement in MAE and RMSE can respectively reach 41.63% and 39.69% compared with the state-of-the-art techniques. [ABSTRACT FROM AUTHOR]

In this paper, we study the forest harvesting problem (FHP). A forest is assumed to be divided into several identical square units, and each unit has its harvesting value based on its type. Harvesting a unit will affect the growth and values of its neighboring units. In this FHP, the best harvesting plan of a unit must be identified to maximize three various objectives simultaneously. The FHP is a multiobjective mathematical and an NP-hard problem. We apply three artificial intelligence algorithms, namely, immune algorithm, genetic algorithm, and particle swarm optimization, for maximizing the weighted objective to solve the FHP. We also solve the following two sets of test problems: (i) a set of randomly generated FHP problems and (ii) a practical problem in Taiwan. Numerical results show the performance of the three algorithms for the test problems. Finally, we compare and discuss the effects of various weights for the three objectives. [ABSTRACT FROM AUTHOR]

The problem of the optimal three-level location allocation of transfer center, processing factory and distribution center for supply chain network under uncertain transportation cost and customer demand are studied. We establish a two-stage fuzzy 0-1 mixed integer optimization model, by considering the uncertainty of the supply chain. Given the complexity of the model, this paper proposes a modified hybrid second order particle swarm optimization algorithm (MHSO-PSO) to solve the resulting model, yielding the optimal location and maximal expected return of supply chain simultaneously. A case study of clothing supply chain in Shanghai of China is then presented to investigate the specific influence of uncertainties on the transfer center, clothing factory and distribution center three-level location. Moreover, we compare the MHSO-PSO with hybrid particle swarm optimization algorithm and hybrid genetic algorithm, to validate the proposed algorithm based on the computational time and the convergence rate. [ABSTRACT FROM AUTHOR]

This paper studies the efficiency of the General Purpose Computation on Graphics Processing Units (GPGPU) technique for the implementation of a parallel Particle Swarm Optimization (PSO) algorithm applied for the optimization of electromagnetic field devices. Several sequential PSO algorithms are compared in order to find the optimal configuration of an electromagnetic device, the TEAM22 benchmark electromagnetic problem. The best PSO algorithm is parallelized by using a GPGPU technique using various configurations for kernels and threads per block. Details of the parallel implementations are explained. The sequential and parallel implementations are compared using as criteria the speed up and the solution quality. The most efficient approach turned to be the one with one thread per block, which was up to 4 times faster than a sequential implementation running on hardware architectures with processors much more advanced than the core processors of the GPU. [ABSTRACT FROM AUTHOR]

Consolidation of services is one of the key problems in cloud data centers. It consists of two separate but related issues: Virtual machine (VM) placement and VM migration problems. In this paper, a VMconsolidation scheme is proposed that turns the virtual machine consolidation (VMC) problem into a vector packing optimization problem based on deadlockfree migration (DFM) to minimize the energy consumptions. To solve this NP-hard and computationally infeasible for large data centers problem, a novel algorithm named Chicken Swarm Optimization based on deadlock-free migration (DFM-CSO) algorithm is proposed. The DFM-CSO algorithm is characterized by the 'one-step look-ahead with n-VMs migration in parallel (OSLA-NVMIP)' method, which carries out the VM migration validation and the rearrangement of target physical host, as well as records the migration order for each solution placement, so that VM transfer can be completed according to the migration sequence. The experimental results, for both real and synthetic datasets, show that the proposed algorithm with higher convergence rate is favourable in comparison with the other deadlock-free migration algorithms. [ABSTRACT FROM AUTHOR]

A lot of research has been directed to the new optimizers that can find a suboptimal solution for any optimization problem named as heuristic black-box optimizers. They can find the suboptimal solutions of an optimization problem much faster than the mathematical programming methods (if they find them at all). Particle swarm optimization (PSO) is an example of this type. In this paper, a new modified PSO has been proposed. The proposed PSO incorporates conditional learning behavior among birds into the PSO algorithm. Indeed, the particles, little by little, learn how they should behave in some similar conditions. The proposed method is named Conditionalized Particle Swarm Optimization (CoPSO). The problem space is first divided into a set of subspaces in CoPSO. In CoPSO, any particle inside a subspace will be inclined towards its best experienced location if the particles in its subspace have low diversity; otherwise, it will be inclined towards the global best location. The particles also learn to speed-up in the non-valuable subspaces and to speed-down in the valuable subspaces. The performance of CoPSO has been compared with the state-of-the-art methods on a set of standard benchmark functions. [ABSTRACT FROM AUTHOR]

It is important for Bayesian network (BN) structure learning, a NP-problem, to improve the accuracy and hybrid algorithms are a kind of effective structure learning algorithms at present. Most hybrid algorithms adopt the strategy of one heuristic search and can be divided into two groups: one heuristic search based on initial BN skeleton and one heuristic search based on initial solutions. The former often fails to guarantee globality of the optimal structure and the latter fails to get the optimal solution because of large search space. In this paper, an efficient hybrid algorithm is proposed with the strategy of two-stage searches. For first-stage search, it firstly determines the local search space based on Maximal Information Coefficient by introducing penalty factors p 1 , p 2 , then searches the local space by Binary Particle Swarm Optimization. For second-stage search, an efficient ADR (the abbreviation of Add, Delete, Reverse) algorithm based on three basic operators is designed to extend the local space to the whole space. Experiment results show that the proposed algorithm can obtain better performance of BN structure learning. [ABSTRACT FROM AUTHOR]

The clonal selection algorithm(CSA) is a core method in artificial immune system, which is famous for its intelligent evolution in artificial intelligence application. However, There are some shortcomings in the algorithm, such as local optima and low convergence speed, which make its practical effects not ideal. Culture algorithm(CA) is driven by knowledge, which can significantly improve the evolutionary efficiency. Chaos mechanism can make the algorithm have better problem space coverage ability. Therefore, a culture&chaos-inspired CSA(CC-CSA) is proposed in this paper to deal with the problems mentioned before. CC-CSA adopts the double-layer evolutionary framework of CA to extract knowledge and guide the crossover and chaotic mutation operation to complete the evolution process. The implicit knowledge is used to adaptively control the chaotic mutation scale, guide the individuals to jump out of the local optima, and realize the accurate search in the latter evolution cycle to gradually approach the optimal solution. It can be seen from the mathematical model analysis that CC-CSA can converge to the global optimal solution. Compared with the experimental results of the original CSA and its representative, up-to-date improved methods, CC-CSA has the fastest convergence speed and the best detection performances. It is also proved that CC-CSA can solve the problems of local optima and slow convergence speed by using the knowledge guidance of CA's double-layer framework and good coverage ability of chaos mechanism to the problem space. [ABSTRACT FROM AUTHOR]

There are numerous large-scale global optimization problems encountered in real-world applications including engineering, manufacturing, economics, networking fields. Over the last two decades different varieties of swarm intelligence and nature inspired based evolutionary algorithms (EAs) were developed and still. Among them, particles swarm optimization, Firefly algorithm, Ant colony optimization, Bat algorithm are the most popular and recently developed leading swarm intelligence based approaches. They are mainly inspired by the social and cooperative behaviors of swarm likewise herds of animals, flocking of birds, schooling of fish, ant colonies, herds of bisons and packs of wolves working together for their common benefit. Due to easy implementation and high capability in achieving of absolute optimum, swarm intelligence based algorithms have attained a great deal attention in both academic and industrial applications. This paper proposes a hybrid swarm intelligence (HSI) algorithm that employs the Bat Algorithm (BA) and the Practical Swarm Optimization (PSO) as constituents to perform their search process for dealing with recently designed benchmark functions in the special session of the 2017 IEEE congress of evolutionary computation (CEC'17) [3]. The approximate solutions for most of the CEC'17 benchmark functions obtained by the suggested algorithm in its twenty five independent runs of trails are much promising as compared to its competitors. [ABSTRACT FROM AUTHOR]

In this paper, we have designed a new optimization technique, which is named as the Improved Multi-verse Algorithm with Levy Flights (ILFMVO) algorithm. The quality of the population is an important factor that can directly or indirectly affect the strength of an algorithm in searching for the given search space for an optimal solution. Also, having an initialization of the initial population with randomly generated candidate solutions is not an effective idea in every case, especially when the search space is large. Hence, we have updated the Levy flights based Multi-verse Optimizer (LFMVO) by dividing initialization into two parts. To investigate the ability of ILFMVO, we have solved a constrained economic dispatch problem with a non-smooth, non-convex cost functions of three, six, and twenty thermal generator systems and two design engineering problems with nonlinear objectives and complex nonlinear constraints. We have compared our results with other standard algorithms. We have presented the sensitivity analysis to check the robustness and stability of our approach. The outcome demonstrated that ILFMVO has better accuracy, stability, and convergence. [ABSTRACT FROM AUTHOR]

This paper investigates feature selection methods based on hybrid architecture using feature selection algorithm called Adapted Fast Correlation Based Feature selection and Support Vector Machine Recursive Feature Elimination (AFCBF-SVMRFE). The AFCBF-SVMRFE has three stages and composed of SVMRFE embedded method with Correlation based Features Selection. The first stage is the relevance analysis, the second one is a redundancy analysis, and the third stage is a performance evaluation and features restoration stage. Experiments show that the proposed method tested on different classifiers: Support Vector Machine SVM and K nearest neighbors KNN provide a best accuracy on various dataset. The SVM classifier outperforms KNN classifier on these data. The AFCBF-SVMRFE outperforms FCBF multivariate filter, SVMRFE, Particle swarm optimization PSO and Artificial bees colony ABC. [ABSTRACT FROM AUTHOR]

Optimization demands exist everywhere in the real world especially in science studies and engineering practices, and it is important that the method to deal with intricacy optimization problems should itself be relative simple. Particle Swarm Optimization (PSO) and Differential Evolution (DE) both are simple evolutionary algorithms (EAs) which are proposed for single-objective optimization and both of them have been proved to be efficient methods for optimizing applications, however, there are still some weakness existing within them. A innovative evolutionary method named QUasi-Affine TRansformation Evolutionary (QUATRE) algorithm which is derived from, also tackles some weaknesses of PSO and DE algorithm, and obtains better performance on commonly used test suites. The key characteristic of QUATRE is that an automatically generated matrix named evolution matrix M is implemented in evolutionary process, which is taken as an alternative of employing the crossover rate CR. Here in this paper, we present a novel QUATRE variant, named IS-QUATRE, which can explore the search area in a better way comparison with the previous method, and relatively good optimization ability can be obtained by our proposed IS-QUATRE algorithm under CEC2013 test suit. And the conducted experimental results validate that our proposed IS-QUATRE is competitive with some other famous PSO and DE variants. [ABSTRACT FROM AUTHOR]

In this paper, an analytical model is proposed to predict the magnetic field and torque characteristics of flux-concentration cage-type eddy-current couplings with slotted conductor rotor topology. Due to the presence of discontinuous boundary conditions in permanent magnet rotor domain and conductor rotor domain, the accurate sub-domain method is employed in polar coordinates. The permanent magnet domain and the conductor domain are divided into different sub-domain according to the number of poles and slots. The magnetic vector potential in each domain is obtained by solving the field equation based on the separated variable method. Then the magnetic field distributions and output torque are computed. By using the nonlinear 2D and 3D finite element analysis, the validity of such model is proved, and the cause of deviation is discussed. In the end, the proposed formula is used for a design optimization using particle swarm optimization algorithm. [ABSTRACT FROM AUTHOR]

Group animation is a technology that simulates group behavior by computer. It matures with the continuous development of computer graphics. The things that need to be described are expressed in the form of anime, which not only clearly reflects the process of the event, but also shows a more realistic picture, and can also increase the cognitive range of group behavior to a certain extent. Based on the analysis of the advantages and disadvantages of artificial fish swarm algorithm, this paper improves the research on artificial fish swarm algorithm, and it is easy to fall into local optimum, and it is improved by using convergence and divergence behavior in social learning mechanism., to some extent, improve the search performance of the algorithm. Based on the collision detection and avoidance, the improved artificial fish swarm algorithm is used to plan the group behavior path, and the obtained path data is imported into Maya. The tools provided by Maya will be used to establish the characters, 3D scenes and planning. The paths are merged together to get the corresponding group animation effects. [ABSTRACT FROM AUTHOR]

Vehicle sideslip angle is the key parameter to evaluate the handling stability of the vehicle, and it is also one of the control targets of the vehicle stability, so the accurate estimation of the vehicle sideslip angle directly affects the safety of the vehicle. In order to improve the influence of particles degeneracy on the estimation of vehicle sideslip angle, and ensure the nonnegative qualitative of the covariance matrix and iterative stability of the unscented Kalman filter algorithm, in this paper, a vehicle sideslip angle estimation method based on singular value decomposition Unscented Kalman particle filtering algorithm (SVD-UPF) is proposed by using two-degrees-of-freedom nonlinear vehicle dynamics model, and the singular value decomposition Unscented Kalman filter algorithm is used to optimize the density distribution function. Using the hardware-in-the-loop simulation platform of distributed drive electric vehicle (HEV), the method of estimating the vehicle sideslip angle based on the unscented Kalman filter(UKF) and the SVD-UPF algorithm is compared and verified under the working condition of emergency double lane change, steering angle increase gradually, steering wheel angle stepping. The results show that the SVD-UPF estimator improves the accuracy of the unscented Kalman filter estimator and the effectiveness of the algorithm is verified. [ABSTRACT FROM AUTHOR]

This paper presents a novel Long-Term Load Forecasting (LTLF) technique based on the new heuristic method, namely Gravitational Search Algorithm (GSA). The objective of the suggested approach is establishing a more accurate LTLF model to minimize the average error of modeling. In order to estimate different fitting functions based on the proposed algorithm, two different case studies include Egyptian and Kuwaiti grids are selected. Also, the results are compared with a conventional approach, namely Least Squares (LS) method, and Particle Swarm Optimization (PSO) as a heuristic algorithm, to select the best LF model. Finally, based on the average and maximum errors arise from the estimations as a decision condition; the best function is selected for the LTLF problem. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to examine and evaluate a new mathematical model of vehicle routing problem in order to optimize fuel consumption and maximize commercial profitability under the conditions of uncertainty of distributor service to customers using robust approach under scenario. According to the real world, distribution companies are interested in minimizing consumption of fuel in the distribution of goods for two reasons: the first reason is that reducing the consumption of fuel will reduce the current costs of distribution companies and ultimately increase their profits. The second reason is that reducing fuel consumption will reduce the harmful effects of greenhouse gases and air pollution. Other words, distribution companies operate in a competitive environment that has more than one distributor in the distribution network, and start time for serving customers has a significant impact on the profitability of the distributors. To calculate the efficiency of the proposed model, we used differential evolution (DE) algorithm and Particle swarm optimization (PSO), and the results were compared in small and medium scales with the results of the exact solution method. To verify proceeds of proposed algorithms in large scales, a number of sample problems were created in large scales and the figures were evaluated. The computational results indicate that DE algorithm has a better computational function, but the PSO algorithm has better computational time. [ABSTRACT FROM AUTHOR]

Edge computing offers potential benefits to applications working in IoT (Internet of Things) and CPS (Cyber Physical Systems) environments by bringing the power of computing proximate to the devices, which demand high computational resources. As computational capabilities are currently untapped in edge devices like the IoT gateway, the computational intensive part of an application like a thread, a module or a task can be offloaded to the edge devices rather than to the cloud by the end devices. In this paper, an approach that employs Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) is used to determine the near optimal solution for scheduling offloadable components in an application, with the intent of significantly reducing the execution time of an application and energy consumption of the smart devices. With a new inertial weight equation, an Adaptive Genetic Algorithm – Particle Swarm Optimization (AGA-PSO) algorithm is proposed which uses GA's ability in exploration and PSO's ability in exploitation to make the offloading optimized without violating the deadline constraint of an application. [ABSTRACT FROM AUTHOR]

Task Scheduling is one of the most challenging problems in cloud computing. It is an NP-Hard and plays an important role in optimizing the use of available resources. Recently, Multi-Objectives Genetic Algorithm (MOGA) is proposed for cloud tasks scheduling. However, the execution time of the GA is higher than Particle Swarm Optimization (PSO), and the convergence is slower. PSO converges fast because it can be implemented without too many parameters and operators. In this paper, Multi-Objectives PSO (MOPSO) and MOPSO with Importance Strategy (IS) (MOPSO_IS) algorithms are proposed. MOPSO algorithm is integrated with the IS to select the global best leader. Furthermore, incorporating a mutation operator in MOPSO_IS resolved the problem of premature convergence to the local Pareto-optimal front. The performance of the proposed algorithms was compared with MOGA and produced better results. The results of the experiments showed that the proposed MOPSO and MOPSO_IS significantly minimized the total task time and average task time and obtained better distribution for tasks on the available resources in a minimal time. [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) is a population-based stochastic optimization technique that can be applied to solve optimization problems. However, there are some defects for PSO, such as easily trapping into local optimum, slow velocity of convergence. This paper presents the simple butterfly particle swarm optimization algorithm with the fitness-based adaptive inertia weight and the opposition-based learning average elite strategy (SBPSO) to accelerate convergence speed and jump out of local optimum. SBPSO has the advantages of the simple butterfly particle swarm optimizer to increase the probability of finding the global optimum in the course of searching. Moreover, SBPSO benefits from the simple particle swarm (sPSO) to accelerate convergence speed. Furthermore, SBPSO adopts the opposition-based learning average elite to enhance the diversity of the particles in order to jump out of local optimum. Additionally, SBPSO generates the fitness-based adaptive inertia weight ω to adapt to the evolution process. Eventually, SBPSO presents a approach of random mutation location to enhance the diversity of the population in case of the position out of range. Experiments have been conducted with eleven benchmark optimization functions. The results have demonstrated that SBPSO outperforms than that of the other five recent proposed PSO in obtaining the global optimum and accelerating the velocity of convergence. [ABSTRACT FROM AUTHOR]

Optimization is a process that is followed to improve an objective function. The aim of the optimization is to improve the solution of a problem developed by a scientist or an engineer. In any optimization algorithm, the initial conditions have a big effect on quality of the final found solution. One of the new optimization algorithms is See-See Partridge Chicks Optimization (SSPCO) algorithm, which is modeled upon the behavior of the partridge chicks. Chaotic behaviors are frequent in the natural phenomena. Indeed, many real world behaviors which resemble random, are chaotic. As these behaviors are highly sensitive to the initial conditions, they show such really random-like behaviors that can't be predicted (while they are not random at all). In this paper, we have implemented a chaotic SSPCO (CSSPSO) algorithm. We have used two different chaotic functions and we have lastly compared the results with the state of the art algorithms. The results indicate that chaos has a positive effect and the CSSPCO algorithm outperforms the state of the art algorithms. [ABSTRACT FROM AUTHOR]

For the disadvantage of particle swarm optimizer is not skillful at balancing the global and local search, a new algorithm is proposed in this paper, combining the time-varying acceleration coefficients. The new algorithm, based on particle swarm optimizer with constrict factor, employs the double constrict factors. The first constrict factor aims at adjusting the model of global and local search, and the second constrict factor concentrates on further balancing the global and local optima which influence the updates of the entire swarm. By comparing with particle swarm optimizer, particle swarm optimizer with constrict factor and chaos particle swarm optimizer, which evaluated on 8 Benchmark functions, with 3 kinds of tests, the results indicate the new algorithm owns a higher accurate level, and faster convergence velocity. The time varying acceleration coefficients are used, the new algorithm can balance the global and local search better. [ABSTRACT FROM AUTHOR]

Condition monitoring is an effective methodology to evaluate the health state of power electronics converters. Aiming at multiple devices health state estimation for boost converters, a non-invasive condition monitoring technique is proposed in this paper. Taking the equivalent circuit model of these components into consideration, the formulations of failure precursors with detection signals are derived based on hybrid system theory. Then, the parameter identification problem is translated into an objective function optimization issue. Therefore, the precursor parameter values of inductor, capacitor, diode and power MOSFET can be obtained using crow search algorithm. Meanwhile, the boost converters under variable operating conditions are also analyzed. Compared with particle swarm optimization (PSO) method, both simulations and experiments are conducted to validate the effectiveness of the presented approach. The results show that these parameters can be estimated simultaneously and the identification accuracy of them reaches to more than 90%. [ABSTRACT FROM AUTHOR]