Search

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The optimization of industrial processes is a critical task for leveraging profitability and sustainability. To ensure the selection of optimum process parameter levels in any industrial process, numerous metaheuristic algorithms have been proposed so far. However, many algorithms are either computationally too expensive or become trapped in the pit of local optima. To counter these challenges, in this paper, a hybrid metaheuristic called PSO-GSA is employed that works by combining the iterative improvement capability of particle swarm optimization (PSO) and gravitational search algorithm (GSA). A binary PSO is also fused with GSA to develop a BPSO-GSA algorithm. Both the hybrid algorithms i.e., PSO-GSA and BPSO-GSA, are compared against traditional algorithms, such as tabu search (TS), genetic algorithm (GA), differential evolution (DE), GSA and PSO algorithms. Moreover, another popular hybrid algorithm DE-GA is also used for comparison. Since earlier works have already studied the performance of these algorithms on mathematical benchmark functions, in this paper, two real-world-applicable independent case studies on biodiesel production are considered. Based on the extensive comparisons, significantly better solutions are observed in the PSO-GSA algorithm as compared to the traditional algorithms. The outcomes of this work will be beneficial to similar studies that rely on polynomial models. [ABSTRACT FROM AUTHOR]

Nowadays, people choose to travel in their leisure time more frequently, but fixed predetermined tour routes can barely meet people's personalized preferences. The needs of tourists are diverse, largely personal, and possibly have multiple constraints. The traditional single-objective route planning algorithm struggles to effectively deal with such problems. In this paper, a novel multi-objective and multi-constraint tour route recommendation method is proposed. Firstly, ArcMap was used to model the actual road network. Then, we created a new interest label matching method and a utility function scoring method based on crowd sensing, and constructed a personalized multi-constraint interest model. We present a variable neighborhood search algorithm and a hybrid particle swarm genetic optimization algorithm for recommending Top-K routes. Finally, we conducted extensive experiments on public datasets. Compared with the ATP route recommendation method based on an improved ant colony algorithm, our proposed method is superior in route score, interest abundance, number of POIs, and running time. [ABSTRACT FROM AUTHOR]

Wireless powered communication network (WPCN) is a promising technique to resolve the power constraint issue faced by wireless nodes at the same time it also provides green and a safer solution. This paper studies, mutual sharing between WPCN and simultaneous wireless information and power transfer model where optimal resource allocation occurs between licensed/bandwidth group and an unlicensed/power group to enhance the system performance. The main aim of this paper is to maximize system weighted sum rate and minimize power consumption during transmission by optimal time allocation and energy beamforming vector allocation. These multiobjective combinatorial problems are solved using joint metaheuristic particle swarm optimization-cuckoo search algorithm to provide an optimal solution. The results are compared using a conventional mathematical optimization algorithm to set as a baseline for performance parameters. The obtained results demonstrate that the efficient joint metaheuristic approach provides a significant gain in the system performance and also offers a computationally less complex approach for solving a complicated non-convex multiobjective problem of wireless powered network. [ABSTRACT FROM AUTHOR]

Stochastic configuration network (SCN) is a mathematical model of incremental generation under a supervision mechanism, which has universal approximation property and advantages in data modeling. However, the efficiency of SCN is affected by some network parameters. An optimized searching algorithm for the input weights and biases is proposed in this paper. An optimization model with constraints is first established based on the convergence theory and inequality supervision mechanism of SCN; Then, a hybrid bat-particle swarm optimization algorithm (G-BAPSO) based on gradient information is proposed under the framework of PSO algorithm, which mainly uses gradient information and local adaptive adjustment mechanism characterized by pulse emission frequency to improve the searching ability. The algorithm optimizes the input weights and biases to improve the convergence rate of the network. Simulation results over some datasets demonstrate the feasibility and validity of the proposed algorithm. The training RMSE of G-BAPSO-SCN increased by 5.57 × 10 − 5 and 3.2 × 10 − 3 compared with that of SCN in the two regression experiments, and the recognition accuracy of G-BAPSO-SCN increased by 0.07% on average in the classification experiments. [ABSTRACT FROM AUTHOR]

The beetle antenna search algorithm (BAS) converges rapidly and runs in a short time, but it is prone to yielding values corresponding to local extrema when dealing with high-dimensional problems, and its optimization result is unstable. The artificial fish swarm algorithm (AFS) can achieve good convergence in the early stage, but it suffers from slow convergence speed and low optimization accuracy in the later stage. Therefore, this paper combines the two algorithms according to their respective characteristics and proposes a mutation and a multi-step detection strategy to improve the BAS algorithm and raise its optimization accuracy. To verify the performance of the hybrid composed of the AFS and BAS algorithms based on the Mutation and Multi-step detection Strategy (MMSBAS), AFS-MMSBAS is compared with AFS, the Multi-direction Detection Beetle Antenna Search (MDBAS) Algorithm, and the hybrid algorithm composed of the two (AFS-MDBAS). The experimental results show that, with respect to high-dimensional problems: (1) the AFS-MMSBAS algorithm is not only more stable than the MDBAS algorithm, but it is also faster in terms of convergence and operation than the AFS algorithm, and (2) it has a higher optimization capacity than the two algorithms and their hybrid algorithm. [ABSTRACT FROM AUTHOR]

Chimp Optimization Algorithm (ChOA), a novel meta-heuristic algorithm, has been proposed in recent years. It divides the population into four different levels for the purpose of hunting. However, there are still some defects that lead to the algorithm falling into the local optimum. To overcome these defects, an Enhanced Chimp Optimization Algorithm (EChOA) is developed in this paper. Highly Disruptive Polynomial Mutation (HDPM) is introduced to further explore the population space and increase the population diversity. Then, the Spearman's rank correlation coefficient between the chimps with the highest fitness and the lowest fitness is calculated. In order to avoid the local optimization, the chimps with low fitness values are introduced with Beetle Antenna Search Algorithm (BAS) to obtain visual ability. Through the introduction of the above three strategies, the ability of population exploration and exploitation is enhanced. On this basis, this paper proposes an EChOA-SVM model, which can optimize parameters while selecting the features. Thus, the maximum classification accuracy can be achieved with as few features as possible. To verify the effectiveness of the proposed method, the proposed method is compared with seven common methods, including the original algorithm. Seventeen benchmark datasets from the UCI machine learning library are used to evaluate the accuracy, number of features, and fitness of these methods. Experimental results show that the classification accuracy of the proposed method is better than the other methods on most data sets, and the number of features required by the proposed method is also less than the other algorithms. [ABSTRACT FROM AUTHOR]

A large amount of calculation exists in a complex engineering optimization problem. The swarm intelligence algorithm can improve calculation efficiency and accuracy of complex engineering optimization. In the existing research, the surrogate model and the swarm intelligence algorithm are only two independent tools to solve the optimization problem. In this paper, we propose the surrogate-assisted crow swarm intelligent search optimization algorithm (SACSA) by combining the characteristics of swarm intelligence algorithm and surrogate model. The proposed algorithm utilizes the initial samples to construct the surrogate model, and then the improved crow search algorithm (CSA) is applied to obtain optimal solution. Finally, the proposed algorithm is compared with EGO, MSSR, ARSM-ISES, AMGO and SEUMRE, MPS, HAM algorithms. The comparison results show that the proposed algorithm can find a global optimal solution with fewer samples and is beneficial to improving the efficiency and accuracy of calculation. [ABSTRACT FROM AUTHOR]

Summary: The accuracy of the finite element model is essential for fatigue analysis and vibration of a flexible body. This paper presents a finite element model updating (FEMU) algorithm based on crows search algorithm incorporated with Levy flight (LFCSA). The proposed algorithm is tested on the updating of two different cases: a simple structure (beam) and a complex structure (gearbox housing). To verify the performance of LFCSA, two optimization algorithm, which is the standard CSA and the particle swarm optimization algorithm with Levy flight (LFPSO), are applied to FEMU of the simple beam. The result of the comparison shows that the LFCSA has sufficient convergence speed and global search ability in the implementation of FEMU. In the case of gearbox housing, the error of frequencies and mode shapes are analyzed to indicate that the LFCSA gives a satisfactory result in a complex structure. [ABSTRACT FROM AUTHOR]

In this paper, weighted differential evolution algorithm (WDE) has been proposed for solving real-valued numerical optimization problems. When all parameters of WDE are determined randomly, in practice, WDE has no control parameter but the pattern size. WDE can solve unimodal, multimodal, separable, scalable, and hybrid problems. WDE has a very fast and quite simple structure, in addition, it can be parallelized due to its non-recursive nature. WDE has a strong exploration and exploitation capability. In this paper, WDE's success in solving CEC' 2013 problems was compared to 4 different EAs (i.e., CS, ABC, JADE, and BSA) statistically. One 3D geometric optimization problem (i.e., GPS network adjustment problem) and 4 constrained engineering design problems were used to examine the WDE's ability to solve real-world problems. Results obtained from the performed tests showed that, in general, problem-solving success of WDE is statistically better than the comparison algorithms that have been used in this paper. [ABSTRACT FROM AUTHOR]

Over the last decade, the size and complexity of real-world problems have grown dramatically, necessitating more effective tools. Nature-inspired metaheuristic algorithms have proven to be a promising tool for solving such problems due to their performance in a variety of fields. JAYA algorithm is a novel population-based algorithm which could have been able to present reliable results. This is because it does not need any parameters to be set other than the population size and the maximum number of iteration. Despite its positive feedbacks, this algorithm should be modified to witness more efficiency. This paper aims to amend the original version of Jaya to present a high-efficiency version named Powerful Enhanced Jaya (PEJAYA). In other words, the methodology of updating position in Jaya is modified to enhance the convergence and search capabilities. This approach is assessed according to solve 20 well-known benchmark functions, feature selection, and statistical tests. The output results of proposed optimization algorithm are then evaluated by comparing it with other recent algorithms including crow search algorithm (CSA), standard version of JAYA, particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), moth-flame optimization (MFO) and sine–cosine algorithm (SCA). Solving a real-world problem is another way of checking the efficiency of this approach with other published works. Prompt escape from local minima, superior convergence, and stability demonstrate that the suggested approach is a very powerful instrument that may be employed in a variety of optimization situations. [ABSTRACT FROM AUTHOR]

An optimal and smooth trajectory for industrial robots has a positive impact on reducing the execution time in an operation and the vibration in their joints. In this paper, a methodology for the time-optimal and jerk-continuous trajectory planning of industrial robots is proposed. The entire trajectory is interpolated in the joint space utilizing fifth-order B-splines and then optimized by a hybrid whale optimization algorithm and genetic algorithm (WOA-GA). Two objective functions, including the integral of the squared jerk along the entire trajectory and the total execution time, are minimized to obtain the optimal entire trajectory. A fifth-order B-spline interpolation technique enables the achievement of a jerk-continuous trajectory, while respecting the kinematic limits of jerk, acceleration and velocity. WOA-GA is utilized to solve the time-jerk optimal trajectory planning problem with nonlinear constraints. The proposed hybrid optimization algorithm yielded good results and achieved the time-jerk optimal trajectory better under kinematic constraints compared to the genetic algorithm, whale optimization algorithm, improved whale optimization algorithm with particle swarm optimization and adaptive cuckoo search algorithm. The numerical results show the competent performances of the proposed methodology to generate trajectories with high smooth curves and short total execution time. [ABSTRACT FROM AUTHOR]

Most of the traditional tourism route planning algorithms only consider single-factor planning, that is, the influence of scenic spots on route planning. Particle swarm optimization algorithm is favored by many people because of its simple concept, easy implementation, and good robustness. Aiming at this problem, this paper takes the actual geographic data as the research object of the tourism route problem and describes the model of the discrete particle swarm algorithm based on geographic coordinates to solve the tourism route problem, which is used to solve practical problems. In order to further improve the global search ability of the algorithm, a self-balancing mechanism is proposed, which makes the algorithm process simple and the algorithm performance improved. At the same time, multithread parallelism is adopted to improve the solution speed of the algorithm, which makes up for the deficiency of the parallelization research of the algorithm. [ABSTRACT FROM AUTHOR]

Swarm intelligence algorithms are stochastic algorithms, i.e. they perform some random movement. This random movement imparts the algorithms with exploration capabilities and allows them to escape local optima. Exploration at the start of execution helps with thorough inspection of the search/solution space. However, as the algorithm progresses, the focus should ideally shift from exploration to exploitation. This shift would help the algorithm to enhance existing solutions and improve its convergence capabilities. Hence if the range of random movement is not kept in check, it may limit an algorithm's convergence capabilities and overall efficiency. To ensure that the convergence of an algorithm is not compromised, an improved search technique to reduce range of uniform random movement was recently proposed for bat algorithm. Uniform distribution and levy distribution are the most commonly used random distributions in swarm algorithms. In this paper, the applicability of the improved search technique over different swarm algorithms employing uniform and levy distributions, as well as Cauchy distribution has been studied. The selected algorithms are firefly algorithm, cuckoo search algorithm, moth search algorithm, whale optimization algorithm, earthworm optimization algorithm and elephant herding optimization algorithm. The resultant variants of each of these algorithms show improvement upon inclusion of the improved search technique. Hence results establish that the improved search technique has positive influence over swarm algorithms employing different random distributions. [ABSTRACT FROM AUTHOR]

In a textile mill, ring and rotor spinning processes are the main technologies employed to convert cotton fibres into yarns with desirable qualities. It has been observed that in order to produce yarns having satisfactory quality characteristics, those spinning processes need to be run while setting different input variables (control parameters) at their optimal operating levels. In this paper, the optimal parametric combinations of back and front zone variables in a ring frame, and input variables in a rotor spinning process are determined based on teaching-learning-based optimization algorithm. The optimization performance of this algorithm is also compared with four other techniques, e.g., firefly algorithm, differential evolution algorithm, cuckoo search algorithm and quantum particle swarm optimization algorithm with respect to accuracy and consistency of the derived solutions. This optimization technique can thus be effectively applied to any of the intermediate processes in a textile mill to obtain the best combinations of different input variables so as to achieve the target quality characteristics. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms have shown promising results in solving various optimization problems. The crow search algorithm (CSA) is a new and effective meta-heuristic algorithm that emulates crows' intelligent group behavior in nature. However, it suffers from several problems, such as trapping into local optimum and premature convergence. This paper proposes an improved crow search algorithm (ICSA), which has been tested and evaluated by a set of well-known benchmark functions. A new update mechanism that uses the merits of the global best position to move toward the best position is proposed. This mechanism increases the convergence of the algorithm and improves its local search-ability. Twenty benchmark functions are used to evaluate the performance of the proposed ICSA. Moreover, the ICSA algorithm is compared with the conventional CSA and other meta-heuristic algorithms such as particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), gray wolf optimizer (GWO), moth-flame optimization (MFO), and sine-cosine algorithm (SCA). The experimental result shows that the proposed ICSA algorithm has produced promising results and outperformed conventional CSA and other meta-heuristic algorithms. Also, the proposed ICSA has a more robust convergence for optimizing objective functions in terms of solution accuracy and efficiency. [ABSTRACT FROM AUTHOR]

This paper presents a new hybrid PPSOGSA algorithm based on the phasor particle swarm optimization (PPSO) and gravitational search algorithm (GSA) for solving the Volt/VAr/THDv control optimization problem in radial distribution systems with non-linear loads. The PPSOGSA's performance is analyzed and evaluated using the standard IEEE 30-bus radial distribution test system. The optimal solutions are obtained based on the following three optimization criteria: minimization of total active power losses, minimization of the voltage deviation, and a simultaneous minimization of total active power losses and voltage deviation. The voltage total harmonic distortion levels (THDv) are estimated using the decoupled harmonic power flow (DHPF) algorithm. Simulation results, obtained using the proposed PPSOGSA-based approach, are compared with those obtained using the other optimization algorithms such as PSO, PPSO, GSA, and PSOGSA. It is shown that the PPSOGSA-based approach has better performance in comparison to the other optimization techniques. [ABSTRACT FROM AUTHOR]

In order to solve the problem that the original sparrow search algorithm (Sparrow Search Algorithm, SSA) has reduced population diversity and the weak local development ability makes it difficult to jump out of the local optimum under the condition of approaching the global optimum. This paper proposes a sparrow search algorithm based on tangential flight (tangent flight Sparrow Search Algorithm, tanSSA). First of all, using adaptive t-distribution strategy to improve the finder location update formula can improve the individual sparrow’s optimization ability and prevent the algorithm from maturing. Then, the tangent flight strategy in the tangent search algorithm can enhance the search space ability of the algorithm, and can make the algorithm jump out of the advantage of the local optimal solution. In original sparrow search algorithm, using the tangent flight disturbance strategy to disturb the optimal solution. The combination of these two strategies can effectively improve the exploration and development performance of tanSSA algorithm. Finally, using 12 standard benchmark functions to test and verify the optimization performance of tanSSA algorithm combined with Wilcoxon rank sum test, and compared with the original SSA algorithm, whale optimization algorithm, particle swarm optimization algorithm and adaptive t-distribution SSA algorithm. The experimental results show that the optimization ability and convergence speed of the sparrow search algorithm based on tangent flight have a significant improvement. [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 proposed curve adaptive and simulation annealing grasshopper optimization algorithm to avoid the disadvantages that the grasshopper optimization algorithm was easy to fall into local optimum, slow convergence speed and poor search accuracy. First of all, this paper introduced the adaptive curve to replace the linear adaptation of the grasshopper optimization algorithm key parameter, which improved the global search ability of the algorithm. Then, on this basis, this paper introduced the simulated annealing algorithm, which had a certain probability of receiving the inferior solution of the grasshopper algorithm to jump out of local optimization and achieve global optimization. Adaptive reduction the range of random solutions of grasshopper position in simulated annealing was beneficial to further improve the ability of grasshopper algorithm's exploitation. Through test function, the experimental results show that the improved new algorithm has higher quality and better convergence speed. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of aquila optimization algorithm（AO）, this paper proposed an aquila optimization algorithm using hybrid search strategy. Firstly, the algorithm introduced dynamic adjustment function to balance global exploration and local exploitation; Secondly, it introduced chaotic adaptive weights to enhance the global search capability of the algorithm and accelerate the convergence speed of the algorithm; Thirdly, it introduced a new individual mutation probability coefficient and an improved differential mutation strategy, and used individuals with better fitness values to lead other individuals in the population to carry out search activities, which maintained the diversity of the population and enhanced the ability of the algorithm to jump out of the local optimum. Through the numerical experiment simulation of 8 benchmark test functions, 10 CEC2019 test functions and 1 engineering application problem, The experimental results show that the algorithm has a significant improvement in global convergence speed and optimization accuracy, and has a better ability to jump out of the local optimum. [ABSTRACT FROM AUTHOR]

One of the most important and efficient methods in providing suitable solutions for various optimization problems is population-based optimization algorithms. The main contribution and innovation of this paper is to present a new optimization method called Three Influential Members Based Optimizer (TIMBO) which is used for implementation in solving optimization problems. The main idea in designing the proposed TIMBO is to use three important population members with the titles of best member, worst member, and member as mean population in updating the position of population members of the algorithm in the problem search space. The most important feature and advantage of the TIMBO is that it does not have any control parameters, which means that there is no need to control the parameter in this algorithm. TIMBO has been mathematically modeled for use in solving various optimization problems. The efficiency of the TIMBO is analyzed in order to provide suitable quasi-optimal solutions on a set of twenty-three standard objective functions of different types unimodal, high-dimensional multimodal, and fixed-dimensional. Evaluation of unimodal functions indicates the high exploitation power of the proposed TIMBO and evaluation of multimodal functions indicates the appropriate exploration power of the TIMBO. Also, the results obtained from the TIMBO are compared with the performance of eight other well-known optimization algorithms including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Teaching-Learning-Based Optimization (TLBO), Grey Wolf Optimization (GWO), Grasshopper Optimisation Algorithm (GOA), Hide Object Game Optimizer (HOGO), and Flow Direction Algorithm (FDA). The results of optimization of standard objective functions indicate the high capability of the TIMBO in providing quasi-optimal solutions suitable for various optimization problems. In addition, analyzing and comparing the performance of the other eight optimization algorithms shows that the TIMBO has a more effective ability to solve optimization problems and is much more competitive. [ABSTRACT FROM AUTHOR]

There are numerous optimization problems in various sciences that need to be solved using the appropriate technique. One of the most widely used techniques for solving optimization problems are population-based optimization algorithms. The innovation and contribution of this paper is to design a new optimizer called Mixed Leader Based Optimizer (MLBO) to solve optimization problems. The main idea in the proposed MLBO is to create a new member as a leader by mixing the best population member and a random member to guide the algorithm population. The main advantage and feature of the proposed MLBO is that it has no control parameters and therefore no need to adjust the parameter. The proposed MLBO algorithm is mathematically formulated to implement in solving various optimization problems. The capability of the proposed optimizer in optimizing and providing appropriate solutions has been tested on a set of twenty-three standard objective functions. These objective functions are selected from three different types including unimodal, high-dimensional multimodal, and fixed-dimensional multimodal in order to analyze different aspects of optimization algorithms. Also, in order to analyze the obtained optimization results, the performance of the MLBO is compared with eight other well-known algorithms including Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Teaching Learning-Based Optimization (TLBO), Gravitational Search Algorithm (GSA), Gray Wolf Optimizer (GWO), Emperor Penguin Optimizer (EPO), Shell Game Optimization (SGO), and Hide Objects Game Optimization (HOGO). The obtained optimization results from the MLBO show the proper performance of the proposed algorithm in solving various optimization problems. On the other hand, comparing the performance of the MLBO with the other eight optimization algorithms indicates the superiority of the proposed optimizer over the compared algorithms. [ABSTRACT FROM AUTHOR]

Feature selection is an essential step in the preprocessing of data in pattern recognition and data mining. Nowadays, the feature selection problem as an optimization problem can be solved with nature-inspired algorithm. In this paper, we propose an efficient feature selection method based on the cuckoo search algorithm called CBCSEM. The proposed method avoids the premature convergence of traditional methods and the tendency to fall into local optima, and this efficient method is attributed to three aspects. Firstly, the chaotic map increases the diversity of the initialization of the algorithm and lays the foundation for its convergence. Then, the proposed two-population elite preservation strategy can find the attractive one of each generation and preserve it. Finally, Lévy flight is developed to update the position of a cuckoo, and the proposed uniform mutation strategy avoids the trouble that the search space is too large for the convergence of the algorithm due to Lévy flight and improves the algorithm exploitation ability. The experimental results on several real UCI datasets show that the proposed method is competitive in comparison with other feature selection algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a novel fast heuristic optimization algorithm has been proposed that effectively boosts the exploration and exploitation process during the search of a global optimum in the search region. In this proposed algorithm, a particle position dependent stochastic variable is used to control the exploration and exploitation process. It is also used to reduce the computational time requirement. The search region shrinks efficiently in a continuous manner during successive iterations. The performance of the algorithm has been validated by comparing the simulation results of the particle swarm optimization (PSO), quantum particle swarm optimization (QPSO) and firefly algorithm (FFA) using some well-known benchmark functions. The proposed algorithm reduces the computational time around 44.2% compared to others in finding the global optimum point. [ABSTRACT FROM AUTHOR]

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

For the capacitated vehicle routing problem(CVRP),this paper proposed an imperialist competitive algorithm which integrated a split mechanism to solve the problem.Firstly,combined with the characteristics of CVRP,this algorithm used the encoding and decoding strategies based on greedy criteria to switch from the algorithm space to the solution space.Secondly,this algorithm presented an imperialist splitting mechanism to improve the global search ability of the algorithm,and simultaneously combined with the 2-Opt algorithm to enhance the local search ability.Finally,the results of simulation experiments with 25 benchmark examples indicate that:the proposed algorithm can effectively solve CVRP,and the optimization errors of all examples are less than 1.0%.Furthermore,the proposed algorithm is more efficiently than the existing imperialist competitive algorithms,particle swarm optimization algorithm,genetic algorithm and cuckoo search algorithm. [ABSTRACT FROM AUTHOR]

In order to solve the problems of slow search speed, premature convergence and low search accuracy of standard whale optimization algorithm, this paper proposed a hybrid strategy to improve whale optimization algorithm. Firstly, it increased the population diversity by generating the initial population with chaotic map, which laid a foundation for the algorithm global search. Then, by the non-linear strategy, it improved the convergence factor and inertia weight to balance the global exploration, local development ability of the algorithm and accelerated the convergence speed. Finally, according to the variance of the group fitness, it set the threshold performing the mutation operation to avoid the premature convergence of the algorithm. By testing 12 typical benchmark functions in three aspects, the experimental results show that the improved algorithm has a remarkable enhancement in search speed and convergence accuracy. Besides, it has a strong ability to get rid of falling into local optimum. [ABSTRACT FROM AUTHOR]

This paper presents a solution of economic power dispatch problem using Harmony Search (IIS) algorithm. The method easily takes care of equality and inequality constraints of the power dispatch problem to find the optimal solution. To show its efficiency, the algorithm is applied to IEEE 118-bus power system having 54 generating units. The problem is also solved by Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) techniques. Results have shown that Harmony Search method gives minimum cost of production of real power and minimum power loss in the system as compared to Genetic Algorithm and Particle Swarm Optimization. This shows the robustness and effectiveness of this method. Moreover, cost of real power generation in dollar per hour per megawatt output of each generator is calculated to identify the least to most expensive generator in the system. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Chongqing University of Posts & Telecommunications (Natural Science Edition) is the property of Chongqing University of Posts & Telecommunications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper, we present a new hybrid binary version of bat and enhanced particle swarm optimization algorithm in order to solve feature selection problems. The proposed algorithm is called Hybrid Binary Bat Enhanced Particle Swarm Optimization Algorithm (HBBEPSO). In the proposed HBBEPSO algorithm, we combine the bat algorithm with its capacity for echolocation helping explore the feature space and enhanced version of the particle swarm optimization with its ability to converge to the best global solution in the search space. In order to investigate the general performance of the proposed HBBEPSO algorithm, the proposed algorithm is compared with the original optimizers and other optimizers that have been used for feature selection in the past. A set of assessment indicators are used to evaluate and compare the different optimizers over 20 standard data sets obtained from the UCI repository. Results prove the ability of the proposed HBBEPSO algorithm to search the feature space for optimal feature combinations. [ABSTRACT FROM AUTHOR]

To reasonably allocate mobile conventional missile battle positions and improve the survivability and combat effectiveness of the missile weapon system, a missile position deployment optimization design model based on Mixed-Integer Nonlinear Programming (MINLP) is established. First, for the multilevel position network, an optimization model with the goal of maximizing the viability is established, and a two-stage solution method is proposed. Second, the whale optimization algorithm (WOA) is improved, and the convergence factor which changes nonlinearly with the number of evolution is introduced to coordinate the local development and global search ability of the algorithm. The diversity mutation operation is carried out on the optimal individual to reduce the probability of premature convergence of the algorithm, and the improved whale algorithm is used to solve the optimization model. Finally, the performance of the improved algorithm is verified by example analysis and simulation experiments, which provides a reference for the deployment mode of mobile missile positions. [ABSTRACT FROM AUTHOR]

The heap-based optimizer (HBO) is an innovative meta-heuristic inspired by human social behavior. In this research, binary adaptations of the heap-based optimizer B _ H B O are presented and used to determine the optimal features for classifications in wrapping form. In addition, HBO balances exploration and exploitation by employing self-adaptive parameters that can adaptively search the solution domain for the optimal solution. In the feature selection domain, the presented algorithms for the binary Heap-based optimizer B _ H B O are used to find feature subsets that maximize classification performance while lowering the number of selected features. The textitk-nearest neighbor (textitk-NN) classifier ensures that the selected features are significant. The new binary methods are compared to eight common optimization methods recently employed in this field, including Ant Lion Optimization (ALO), Archimedes Optimization Algorithm (AOA), Backtracking Search Algorithm (BSA), Crow Search Algorithm (CSA), Levy flight distribution (LFD), Particle Swarm Optimization (PSO), Slime Mold Algorithm (SMA), and Tree Seed Algorithm (TSA) in terms of fitness, accuracy, precision, sensitivity, F-score, the number of selected features, and statistical tests. Twenty datasets from the UCI repository are evaluated and compared using a set of evaluation indicators. The non-parametric Wilcoxon rank-sum test was used to determine whether the proposed algorithms' results varied statistically significantly from those of the other compared methods. The comparison analysis demonstrates that B _ H B O is superior or equivalent to the other algorithms used in the literature. [ABSTRACT FROM AUTHOR]

Dynamic economic dispatch with valve-point effects (DED_ vpe) is a high-dimensional constrained optimization problem with non-convex and non-smooth characteristics. Hybrid methods are one of the most advanced methods to solve the problem. However, most of these methods improve the solution accuracy at the expense of algorithm robustness. This paper proposes an adaptive hybrid backtracking search optimization algorithm (AHBSA) for solving the DED_ vpe. The core idea of AHBSA lies in designing a suitable coupling structure based on the current best individual (called optimal partial coupling). The structure hybridizes an improved BSA mutation operator and the DE/best/1 operator with equal probability. The improved BSA mutation operator uses the current best individual and the historical population to update individual position, called BSA/best/old. It is also the first research work of extending BSA to the problem. In addition, an adaptive parameter control mechanism is proposed to select an appropriate 'mixrate' value for achieving better coupling. The performance of AHBSA is validated on six DED test cases of three systems. Experimental results demonstrate that, compared with some representative methods, AHBSA not only reduces the fuel cost but also ensures the robustness of the algorithm. • A hybrid method AHBSA is proposed to solve DED problem with valve-point effects. • An optimal partial coupling structure is designed in AHBSA. • BSA is the first attempt at solving DED problem. • Results on six benchmark DED test cases show AHBSA is competitive. [ABSTRACT FROM AUTHOR]

Since real-world problems are quite complex, developing more effective methods to optimize them is taken into consideration at the present age. One of the most popular strategies to solve such problems is nature-inspired metaheuristic algorithms which have presented promising solutions in different fields. The JAYA algorithm is an innovative and promising technique for solving a wide range of optimization problems. Hence, this investigation provides a new hybrid algorithm based on JAYA and crow search algorithm (CSA), known as HJCSA, to enhance its performance. In other words, the mechanism of updating position in CSA is integrated with JAYA algorithm to reinforce the convergence and search capabilities of JAYA algorithm. The proposed hybrid algorithm is evaluated through solving 20 well-known benchmark functions, and obtained results are compared with various up-to-date algorithms, including CSA, JAYA, particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), moth-flame optimization (MFO), and sine–cosine algorithm (SCA). In addition, a real-world engineering problem is optimized by the proposed optimization approach and compared with other published works. The results showed that the suggested optimization algorithm is much more vigorous in escaping from local minima, possessing better convergence, and discovering more accurate solutions. [ABSTRACT FROM AUTHOR]

Summary: VANET routing is a serious concern due to some of the limitations in terms of routing costs. More research has already worked on VANET routing strategies for enhancing the performance of the network. However, optimal route selection is a tedious or complex issue in this scenario. To cope with this issue, this research work attempts to introduce a new VANET routing model that considers certain network quality measures such as congestion, travel, collision, and QoS awareness cost. A new cost model is designed based on the given constraints. Along with this, the fuzzification of the QoS factor is considered along with the total routing cost. This work determines the optimal route selection with minimized routing cost by employing a novel optimization algorithm called Rider Integrated Cuckoo Search (RI‐CS) that hybridizes the concept of Rider Optimization Algorithm (ROA) and Cuckoo Search (CS). Finally, the performance of the proposed RI‐CS is analyzed against the conventional models like Particle Swarm Optimization (PSO), Firefly algorithm (FA), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WAO), ROA, CS, Mean Computing Jaya Algorithm (MC‐JA), and Grey Updated Butterfly Operator (GU‐BO) in terms of certain cost analysis. [ABSTRACT FROM AUTHOR]

Dragonfly algorithm (DA) is a recently introduced, swarm intelligent algorithm and has proved its worth over real-world optimization problems. The algorithm is very efficient but is computationally expensive, has poor exploration properties, and unbalanced cohesion and alignment operation. In the present work, the concept of mutation operators has been exploited and seven new versions of DA have been proposed. Adaptive parameters, division of generations, improved exploitation phase and linearly decreasing population adaptation are also followed to improve the exploration, convergence and other properties of DA. The proposed algorithms are experimentally tested on CEC 2005 data set, CEC 2015 data set and CEC 2011 real-world benchmark problems and compared with respect to memory-based hybrid dragonfly algorithm (MHDA), hybrid memory-based dragonfly algorithm with differential evolution (DADE), sine–cosine crow search algorithm (SCCSA), success history-based adaptation differential evolution (SHADE), covariance matrix adaptation evolution strategy (CMA-ES), SHADE based on semi-parameter adaptation-based CMA-ES (LSHADE-SPACMA), hybrid particle swarm gravitational search algorithm (PSOGSA), hybrid firefly and particle swarm optimization algorithm (HFPSO) and others. Experimental and statistical results further validate that mutation clock-based DA (MDA) performs better than all other algorithms under comparison. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) have shown their superiority in military and civilian missions. In the face of complex tasks, many UAVs are usually needed to cooperate with each other. Therefore, multi-UAV cooperative target search has attracted more and more scholars' attention. At present, there are many bionic algorithms for solving the cooperative search problem of multi-UAVs, including particle swarm optimization algorithm (PSO) and differential evolution (DE). Pigeon-inspired optimization (PIO) is a new swarm intelligence optimization algorithm proposed in recent years. It has great advantages over other algorithms in convergence, robustness, and accuracy, and has few parameters to be adjusted. Aiming at the shortcomings of the standard pigeon colony algorithm, such as poor population diversity, slow convergence speed, and the ease of falling into local optimum, we have proposed chaotic disturbance pigeon-inspired optimization (CDPIO) algorithm. The improved tent chaotic map was used to initialize the population and increase the diversity of the population. The disturbance factor is introduced in the iterative update stage of the algorithm to generate new individuals, replace the individuals with poor performance, and carry out disturbance to increase the optimization accuracy. Benchmark functions and UAV target search model were used to test the algorithm performance. The results show that the CDPIO had faster convergence speed, better optimization precision, better robustness, and better performance than PIO. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms are well-known optimization methods, for solving real-world optimization problems. Harmony search (HS) is a recognized meta-heuristic algorithm with an efficient exploration process. But the HS has a slow convergence rate, which causes the algorithm to have a weak exploitation process in finding the global optima. Different variants of HS introduced in the literature to enhance the algorithm and fix its problems, but in most cases, the algorithm still has a slow convergence rate. Meanwhile, opposition-based learning (OBL), is an effective technique used to improve the performance of different optimization algorithms, including HS. In this work, we adopted a new improved version of OBL, to improve three variants of Harmony Search, by increasing the convergence rate speed of these variants and improving overall performance. The new OBL version named improved opposition-based learning (IOBL), and it is different from the original OBL by adopting randomness to increase the solution's diversity. To evaluate the hybrid algorithms, we run it on benchmark functions to compare the obtained results with its original versions. The obtained results show that the new hybrid algorithms more efficient compared to the original versions of HS. A convergence rate graph is also used to show the overall performance of the new algorithms. [ABSTRACT FROM AUTHOR]

At present, optimization algorithms are used extensively. One particular type of such algorithms includes random-based heuristic population optimization algorithms, which may be created by modeling scientific phenomena, like, for example, physical processes. The present article proposes a novel optimization algorithm based on Hooke's law, called the spring search algorithm (SSA), which aims to solve single-objective constrained optimization problems. In the SSA, search agents are weights joined through springs, which, as Hooke's law states, possess a force that corresponds to its length. The mathematics behind the algorithm are presented in the text. In order to test its functionality, it is executed on 38 established benchmark test functions and weighed against eight other optimization algorithms: a genetic algorithm (GA), a gravitational search algorithm (GSA), a grasshopper optimization algorithm (GOA), particle swarm optimization (PSO), teaching–learning-based optimization (TLBO), a grey wolf optimizer (GWO), a spotted hyena optimizer (SHO), as well as an emperor penguin optimizer (EPO). To test the SSA's usability, it is employed on five engineering optimization problems. The SSA delivered better fitting results than the other algorithms in unimodal objective function, multimodal objective functions, CEC 2015, in addition to the optimization problems in engineering. [ABSTRACT FROM AUTHOR]

The growing prevalence of droughts and water scarcity have increased the importance of operating dam and reservoir systems efficiently. Several methods based on algorithms have been developed in recent years in a bid to optimize water release operation policy, in order to overcome or minimize the impact of droughts. However, all of these algorithms suffer from some weaknesses or drawbacks – notably early convergence, a low rate of convergence, or trapping in local optimizations – that limit their effectiveness and efficiency in seeking to determine the global optima for the operation of water systems. Against this background, the present study seeks to introduce and test a Hybrid Algorithm (HA) which integrates the Gravitational Search Algorithm (GSA) with the Particle Swarm Optimization Algorithm (PSOA) with the goal of minimizing irrigation deficiencies in a multi-reservoir system. The proposed algorithm was tested for a specific important multi-reservoir system in Iran: namely the Golestan Dam and Voshmgir Dam system. The results showed that applying the HA could reduce average irrigation deficiencies for the Golestan Dam substantially, to only 2 million cubic meters (MCM), compared to deficiency values for the Genetic Algorithm (GA), PSOA and GSA of 15.1, 6.7 and 5.8 MCM respectively. In addition, the HA performed very efficiently, reducing substantially the computational time needed to achieve the global optimal when compared with the other algorithms tested. Furthermore, the HA showed itself capable of assuring a high volumetric reliability index (VRI) to meet the pattern of water demand downstream from the dams, as well as clearly outperforming the other algorithms on other important indices. In conclusion, the proposed HA seems to offer considerable potential as an optimizer for dam and reservoir operations world-wide. [ABSTRACT FROM AUTHOR]