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.)

When the meta-heuristic algorithm solves the joint resource allocation problem of multi-beam satellites, the computational complexity increases and the algorithm is difficult to converge due to the time delay constraint and capacity constraint. This paper introduced a penalty mechanism in the objective function, and added a penalty value to the objective function of the invalid solution, so that the optimized solution adaptively satisfied these two constraints. Based on this, this paper proposed a joint resource allocation algorithm based on quantum-behaved particle swarm optimization. Simulation results show that the introduction of the penalty strategy solves the problem of difficulty in handling the delay constraint and capacity constraint when applying the meta-heuristic algorithm. The quantum-behaved particle swarm optimization algorithm with penalty mechanism outperforms the existing joint allocation algorithm in terms of allocation fairness index and total system capacity. [ABSTRACT FROM AUTHOR]

To solve the problems of low convergence accuracy, slow convergence speed and easy to fall into local optimum of traditional particle swarm algorithm, this paper proposed an improved particle swarm algorithm with multistrategy fusion. Firstly, in order to accelerate the convergence speed of free particles, the improved algorithm used a method of updating the position of free particles based on the midperpendicular algorithm. secondly, the improved algorithm designed a strategy of generating exploding particles near the optimal particles to enhance the optimizationseeking accuracy and optimization-seeking speed of the algorithm, and the improved algorithm also designed a particle velocity updating strategy relying only on the global optimal particle position to accommodate the first two strategies. Finally, The algorithm also used the inertia weights and particle position update methods of the simplified particle swarm optimization algorithm based on probabilistic hierarchy. This paper designed a few comparison experiments with other five improved particle swarm algorithms, and the results show that the improved algorithm in this paper has a greater advantage and better performance whether dealing with low-dimensional problems or high-dimensional problems. [ABSTRACT FROM AUTHOR]

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.)

Copyright of Journal Of Sichuan University (Natural Sciences Division) / Sichuan Daxue Xuebao-Ziran Kexueban is the property of Editorial Department of Journal of Sichuan University Natural Science Edition 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.)

Knapsack problem with a single continuous variable (KPC) is a natural generalization of the standard 0-1 knapsack problem. In KPC, the capacity of the knapsack is not fixed, so it becomes more difficult to solve. In order to overcome the shortcoming that the performance of existing differential evolution (DE) algorithm is not good enough on highdimensional KPC instances, this paper proposes Lamarckian evolution-based DE (LEDE) algorithm to solve KPC. The improvement generated by the greedy repair and optimization operator is inherited to the offspring, which can speed up the convergence speed of DE algorithm and improve the precision of DE algorithm on high-dimensional KPC instances. At the same time, a profit-based greedy optimization strategy is introduced in the greedy repair and optimization operator to optimize the feasible solution generated by greedy repair strategy based on profit weight ratio, so as to help the algorithm jump out of local optimum. The LEDE algorithm is experimentally analyzed on 40 KPC instances. The experimental results show that the Lamarckian evolution and the profit-based greedy optimization strategy can improve the exploitation ability of LEDE algorithm, and LEDE algorithm is better than other intelligent optimization algorithms in terms of obtaining the best solution and the mean solution. [ABSTRACT FROM AUTHOR]

Disaster preparedness measures can prepare for disaster relief to ensure that emergency supplies can reach the disaster area in a timely and effective manner. This paper proposed a bi-level programming emergency resource scheduling location-routing model with considering preparedness ( BLERSLR-P) In the model, the upper level aimed to minimize the total cost of supply station construction and operation, while the lower level aimed to minimize the cost of distribution route. This paper designed an improved bi-level salp swarm genetic algorithm (BLSSAGA) to solve this problem, combined the concept of iterative division to update the leader position, used the natural exponential inertia weight strategy to modify the control factor, used the chaotic map to update the follower position, and used Taguchi analysis to obtain reasonable values of parameters. Finally, this paper used bi-level salp swarm genetic algorithm ( BLSSAGA) and genetic particle swarm optimization algorithm ( GAPSO), particle swarm optimization algorithm( PSO), and immune optimization algorithm(IA ) to solve and compare and analyze the LRP data set in OR-Library, which verified the feasibility and effectiveness of the proposed model and algorithm. [ABSTRACT FROM AUTHOR]

In order to solve the problems of BBO such as insufficient search scope in the early stage and easy to fall into local optimization in the later stage, this paper proposed an improved El-BBO which based on El. Firstly, the algorithm searched for new habitat around the original habitat, it enhanced the diversity of the initialization population. Secondly, the algorithm made improved habitat expansion, it improved the convergence efficiency of the algorithm. Finally, the algorithm used gradient de scent to make quadratic convergence in the field of optimal solution, which improved the convergence accuracy of the algorithm. This paper carried out 50 Monte Carlo experiments on 12 optimized test functions commonly used in CEC2014, the experimental results show that the overall performance of El-BBO is better than the other three intelligent optimization algorithms in terms of optimal fitness value, average fitness value and standard deviation. It shows that El-BBO can improve the ability to find the optimal solution and enhance the search stability. [ABSTRACT FROM AUTHOR]

Copyright of Coal Science & Technology (0253-2336) is the property of Coal Science & Technology 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.)

To solve the problems of low convergence accuracy and easy to fall into local optimum in the optimization process of the original artificial bee colony algorithm, this paper proposed an enhanced artificial bee colony algorithm with strong and weak ties theory (SWT-ABC). Firstly, it defined the strong and weak ties model in a matrix multi-groups structure and stipulated that the strong ties individuals randomly guided the search process from three directions to improve the convergence speed and accuracy. In order to enhance the ability to jump out of the local optimum, SWT-ABC adopted the interaction of weak ties individuals among subgroups to enhance the population diversity. Finally the algorithm added the reverse learning mechanism of scout bees and determined appropriate upper limit of honey source to improve the utilization efficiency of the evaluation times. Through the numerical experiment of benchmark functions and comparisons with 12 improved intelligent optimization algorithms, it shows that the SWT-ABC has high convergence accuracy and good robustness, and also gets good performance in solving high-dimensional optimization problems. [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 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]

The three-dimensional path planning problem is a combinatorial optimization problem to find the optimal path be- tween the starting point and the destination in the interference environment. Aiming at the shortcomings of traditional swarm in- telligence algorithm in solving this problem,such as low convergence accuracy and easy to fall into local optimum, this paper proposed an adaptive moth-flame optimization algorithm to solve the problem. By introducing the dynamic adjustment strategy of the flight direction and the position intersection strategy,the improved algorithm continuously generated new individuals while dynamically adjusting the flight direction of the moth, which effectively avoided the algorithm from falling into local optimum ; by adaptively adjusting the number of flames, so as to the algorithm enhanced population diversity in the global exploration stage a- void premature convergence. It used the adaptive moth-flame optimization algorithm and other swarm intelligence algorithms to solve the three-dimensional path planning problem. The experimental results show that the improved adaptive moth-flame opti- mization algorithm has the smallest cost value and the fastest convergence speed among all algorithms. The algorithm has better solution ability in 3D path planning problem. [ABSTRACT FROM AUTHOR]

Butterfly optimization algorithm (BOA) is a novel nature-inspired metaheuristics algorithm proposed in recent years. The basic BOA is slow convergence, low accuracy and easy to fall into local optimum. To solve the above problem of basic BOA, this paper proposed an adaptive butterfly optimization algorithm based on mutation strategies ( ABO A-MS) . Firstly, it introduced the strategy of adjust the conversion probability dynamically, which effectively balanced the ability of the global exploration and local search, by means of dynamically adjusting the switching probability of the change information of iteration times and individual fitness. Secondly, it introduced the adaptive inertia weight strategy and local mutation strategy. It applied the inertia weight value and chaotic memory weight factor, which further improved the diversity of this algorithm, and effectively avoided its precocious convergence, as well as accelerated its convergence speed and solving accuracy. In order to verify the optimization performance of the modified algorithm, it carried out the simulation experiments among the modified algorithm, the basic BOA algorithm, the particle swarm optimization algorithm, the salp swarm algorithm, the gray wolf optimization and the others. Simulation results illustrate that the modified algorithm has excellent performance of fast convergence speed, high optimization accuracy and strong stability. [ABSTRACT FROM AUTHOR]

The standard whale optimization algorithm( WOA ) and some derivative algorithms are studied and experimented to solve the problem of poor results of some examples. It is proved that there is a zero searching preference trap in the " encircling" process of WOA. In addition, the unbalanced search characteristics of chaos optimization algorithm( COA) make it difficult to reconcile the chaos initial population and swarm intelligence optimization process. In order to improve the above defects, this paper selected two chaotic systems and bubble net hunting strategy, and designed a set of fusion optimization algorithm. The algorithm adopted the baseline adaptive oscillation group partition strategy based on fitness to guide the group behavior pattern, gave full play to the role of chaotic system, and balanced the exploration and convergence performance. It used the new algorithm to solve the general/improved examples and engineering application cases. It 's obviously that the performance of the algorithm is better than the contrast group algorithm,and there is no searching preference. [ABSTRACT FROM AUTHOR]

This paper proposed an improved salp swarm algorithm that aimed to solve the problem of low precision and slow convergence speed in solving function optimization problems. For leaders, this algorithm replaced the optimal individual position with weighted centroid to prevent premature aggregation near the optimal individual. It also introduced adaptive inertia weight to the followers to balance the global search and local optimization capabilities of the algorithm. Furthermore, this algorithm contributed to reducing the inter-dimensional interference and improving the diversity of the population by dimensional random difference mutation. The simulation results illustrate that the improved algorithm is better than the standard tympanum group algorithm and other improved algorithms in terms of mean, standard deviation and convergence curve. The results also show that the improved algorithm improves the performance of optimization, and has higher precision as well as faster convergence speed. [ABSTRACT FROM AUTHOR]

In order to solve the problem that users deep interests and preferences cannot excavate in the recommendation. algorithm, which leads to low extraction accuracy and high time complexity of similar users clustering accuracy, this paper proposed a clustering optimization recommendation algorithm (MT-QRPD) based on the evaluation quantization model to optimize differential evolution. Firstly, it used the feature timing of BiGRU network and the strong local feature effectiveness of CNN network to extract the comment depth features, and used the multi-dimensional semantic feature screening of multi-head attention mechanism to mine the comment depth semantic features. Then, through the nonlinear transformation of the multi layer perceptron carried out the multi-feature fusion to achieve accurate quantification. Finally, the algorithm optimized the clustering of similar users with PCA, and completed the project recommendation. The result of experiments shows that the pro posed algorithm can improve the accuracy, time complexity and recommendation performance. [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]

Aiming at the problem, such as novel COA has slow convergence and insufficient global search ability when solving complex optimization problems, this paper proposed an algorithm called GCCOA. Firstly, during the growth of the coyotes in packs, it embedded a global-best guidance coyote to make the exploitation more powerful and to improve the convergence quality of COA. Then, it adopted a cultural tendency with coyo te interaction, which was impacted by the interaction of the coyotes in the pack, to improve the global search ability of COA. Finally, it applied GCCOA to complex function optimization and image enhancement. A lot of experimental results on 29 complex functions from CEC2017 set show that GCCOA obtains 22 times of the first place and has better optimization ability than COA, HFSPO, CSPSO and 13-GWO. In additional, the experimental results on medical image enhancement show that GCCOA can solve the optimization problem better than comparison algorithms such as COA and so on. So GCCOA is an optimization algorithm. [ABSTRACT FROM AUTHOR]

This paper proposed two kinds of measurements based on close degree between the cloud models had the same nature concepts. Algorithms were simple, especially still maintained the accuracy in few cloud drops. The experimental results show that the proposed algorithm has obvious optimization accuracy and consumption, meanwhile appeares good feasibility and validity in classification problems based on cloud model. [ABSTRACT FROM AUTHOR]