Changyou Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Changyou Wu has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Xisong Fu
School of Management Science and Engineering, Shandong Institute of Business and technology, Yantai, China
3 shared publications - Zhigui Dong
Liaoning Institute of Science and Technology, Benxi, China
2 shared publications - Fulin Wang
College of Modern Agricultural Equipment, Xihua University, Chengdu 610039, China
1 shared publication - Junke Pei
School of Management Science and Engineering, Shandong Institute of Business and technology, Yantai, China
1 shared publication
Latest Publications
- Open Access
- 16 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 153456-153471
A Novel Sparrow Search Algorithm for the Traveling Salesman Problem
The sparrow search algorithm (SSA) tends to fall into local optima and to have insufficient stagnation when applied to the traveling salesman problem (TSP). To address this issue, we propose a novel greedy genetic sparrow search algorithm based on a sine and cosine search strategy (GGSC-SSA). First, the greedy algorithm is introduced to initialize the population and to increase the diversity of the population. Second, genetic operators are used to update the population, balancing global search and local development capabilities. Finally, the adaptive weight is introduced in the producer update to increase the adaptability of the algorithm and to optimize the quality of the solution, and a sin-cosine search strategy is introduced to update the scroungers. In addition, the GGSC-SSA is compared with the genetic algorithm (GA), simulated annealing (SA), particle swarm optimization (PSO), grey wolf optimization (GWO), ant colony optimization (ACO) and the artificial fish (AF) algorithm on TSP datasets for performance testing. We also compare it with some recently improved algorithms. The results of the simulations are encouraging; the GGSC-SSA significantly enhances the solution precision, optimization speed and robustness.
- 16 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 153456-153471
Open AccessA Novel Sparrow Search Algorithm for the Traveling Salesman Problem
The sparrow search algorithm (SSA) tends to fall into local optima and to have insufficient stagnation when applied to the traveling salesman problem (TSP). To address this issue, we propose a novel greedy genetic sparrow search algorithm based on a sine and cosine search strategy (GGSC-SSA). First, the greedy algorithm is introduced to initialize the population and to increase the diversity of the population. Second, genetic operators are used to update the population, balancing global search and local development capabilities. Finally, the adaptive weight is introduced in the producer update to increase the adaptability of the algorithm and to optimize the quality of the solution, and a sin-cosine search strategy is introduced to update the scroungers. In addition, the GGSC-SSA is compared with the genetic algorithm (GA), simulated annealing (SA), particle swarm optimization (PSO), grey wolf optimization (GWO), ant colony optimization (ACO) and the artificial fish (AF) algorithm on TSP datasets for performance testing. We also compare it with some recently improved algorithms. The results of the simulations are encouraging; the GGSC-SSA significantly enhances the solution precision, optimization speed and robustness.
- Open Access
- 10 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 126579-126594
Research and Application of Back Propagation Neural Network-Based Linear Constrained Optimization Method
A back propagation (BP) neural network-based linear constrained optimization method(BPNN-LCOM) was proposed for to solve the problems in linear constraint black box in this paper,hoping to improve the shortcoming of BP neural network-based constrained optimization method (BPNN-COM). In view of minimizing the mathematic model of network output, the basic ideas of BPNN-LCOM wereilluminated,includingmodel design and training, and BP neural network-based global optimization. Firstly, the iteration step size was calculated by optimal step size, and the adjustment step size was calculated by interpolation method, also the iteration speed was accelerated. Secondly, the search direction that iteration point locates on the boundary offeasible region was determined by gradient projection method, which ensured that the iteration process continued along a feasible search direction, and effectively solved the defect of BPNN-COM that sometimes fails to find thetrue optimal solutions. At the same time, the iteration step size along the gradient projection direction was calculated by the optimal constraint step size, which ensured the new iteration point located in the feasible region. Thirdly, the Kuhn-Tucker conditions were introduced to verify whether the iteration point is theoptimization solution that locates on the boundary of feasible region, and it made the termination criterion perfect for BPNN-LCOM.The computation results of two examples showed the effectiveness and feasibility of BPNN-LCOM. The BPNN-LOCM was used to optimize the roller-type bailing mechanism,and the optimal parameters were obtained as follows: round disc diameter was 360 mm, rotationalspeed of the steel rollerwas 250 rpm, feeding quantity was1.7 kg/s, and length-width ratio was 0.8. The corresponding minimum power consumption was 45.8 kJ/bundle. The optimization results were superior to regression analysis and BPNN-COM.The verification test was carried out and the optimization results could improve roller-type bailing mechanism. Verification results showed that the BPNN-LCOM is a feasible method for solving problems in linear constraint black box.
- 10 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 126579-126594
Open AccessResearch and Application of Back Propagation Neural Network-Based Linear Constrained Optimization Method
A back propagation (BP) neural network-based linear constrained optimization method(BPNN-LCOM) was proposed for to solve the problems in linear constraint black box in this paper,hoping to improve the shortcoming of BP neural network-based constrained optimization method (BPNN-COM). In view of minimizing the mathematic model of network output, the basic ideas of BPNN-LCOM wereilluminated,includingmodel design and training, and BP neural network-based global optimization. Firstly, the iteration step size was calculated by optimal step size, and the adjustment step size was calculated by interpolation method, also the iteration speed was accelerated. Secondly, the search direction that iteration point locates on the boundary offeasible region was determined by gradient projection method, which ensured that the iteration process continued along a feasible search direction, and effectively solved the defect of BPNN-COM that sometimes fails to find thetrue optimal solutions. At the same time, the iteration step size along the gradient projection direction was calculated by the optimal constraint step size, which ensured the new iteration point located in the feasible region. Thirdly, the Kuhn-Tucker conditions were introduced to verify whether the iteration point is theoptimization solution that locates on the boundary of feasible region, and it made the termination criterion perfect for BPNN-LCOM.The computation results of two examples showed the effectiveness and feasibility of BPNN-LCOM. The BPNN-LOCM was used to optimize the roller-type bailing mechanism,and the optimal parameters were obtained as follows: round disc diameter was 360 mm, rotationalspeed of the steel rollerwas 250 rpm, feeding quantity was1.7 kg/s, and length-width ratio was 0.8. The corresponding minimum power consumption was 45.8 kJ/bundle. The optimization results were superior to regression analysis and BPNN-COM.The verification test was carried out and the optimization results could improve roller-type bailing mechanism. Verification results showed that the BPNN-LCOM is a feasible method for solving problems in linear constraint black box.
- Open Access
- 4 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 201606-201621
An Agglomerative Greedy Brain Storm Optimization Algorithm for Solving the TSP
The brain storm optimization algorithm(BSO) is a population based metaheuristic algorithm inspried by the human conferring process that was proposed in 2010. Since its first implementation, BSO has been widely used in various fields. In this paper, we propose an agglomerative greedy brain storm optimization algorithm (AG-BSO) to solve classical traveling salesman problem(TSP). Due to the low accuracy and slow convergence speed of current heuristic algorithms when solving TSP, this paper consider four improvement strategies for basic BSO. First, a greedy algorithm is introduced to ensure the diversity of the population. Second, hierarchical clustering is used in place of the k-means clustering algorithm in standard BSO to eliminate the noise sensitivity of the original BSO algorithm when solving TSP. Exchange rules for the individuals in the population individuals were introduced to improve the efficiency of the algorithm. Finally, a heuristic crossover operator is used to update the individuals. In addition, the AG-BSO algorithm is compared with the genetic algorithm (GA), particle swarm optimization (PSO), the simulated annealing(SA) and the ant colony optimization (ACO) on standard TSP data sets for performance testing. We also compare it with a recently improved version of the BSO algorithm. The simulations show the encouraging results that AG-BSO greatly improved the solution accuracy, optimization speed and robustness.
- 4 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 201606-201621
Open AccessAn Agglomerative Greedy Brain Storm Optimization Algorithm for Solving the TSP
The brain storm optimization algorithm(BSO) is a population based metaheuristic algorithm inspried by the human conferring process that was proposed in 2010. Since its first implementation, BSO has been widely used in various fields. In this paper, we propose an agglomerative greedy brain storm optimization algorithm (AG-BSO) to solve classical traveling salesman problem(TSP). Due to the low accuracy and slow convergence speed of current heuristic algorithms when solving TSP, this paper consider four improvement strategies for basic BSO. First, a greedy algorithm is introduced to ensure the diversity of the population. Second, hierarchical clustering is used in place of the k-means clustering algorithm in standard BSO to eliminate the noise sensitivity of the original BSO algorithm when solving TSP. Exchange rules for the individuals in the population individuals were introduced to improve the efficiency of the algorithm. Finally, a heuristic crossover operator is used to update the individuals. In addition, the AG-BSO algorithm is compared with the genetic algorithm (GA), particle swarm optimization (PSO), the simulated annealing(SA) and the ant colony optimization (ACO) on standard TSP data sets for performance testing. We also compare it with a recently improved version of the BSO algorithm. The simulations show the encouraging results that AG-BSO greatly improved the solution accuracy, optimization speed and robustness.