Hsuan-Yu Tseng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hsuan-Yu Tseng has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Hao-Chun Lu
Fu Jen Catholic University
2 shared publications - Liming Yao
Business School, Sichuan University, Chengdu, China
1 shared publication Ming-Jyh Tsai
Department of Information Management, Fu Jen Catholic University, New Taipei City, Taiwan
1 shared publication- Pao-Hsien Chu
Chang Gung Memorial Hospital
1 shared publication
Latest Publications
- 13 September 2021
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 37 (1) , 859-913
Neutrino‐like particle for particle swarm optimization
- 13 September 2021
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 37 (1) , 859-913
Neutrino‐like particle for particle swarm optimization
- Open Access
- 6 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 124757-124767
Easy Particle Swarm Optimization for Nonlinear Constrained Optimization Problems
Particle swarm optimization (PSO) is a popular stochastic approach for solving practical optimal problems from industries due to its effective performance and few hyperparameters. Nonlinear constrained optimization (NCO) problems frequently cause multiple optimal regions and can cause many infeasible regions in the search space. The state-of-the-art approaches for handling the infeasible regions generated by problems’ constraints either block particles’ paths or penalize NCO problems’ objective values based on the standard updating velocity formula. The standard updating velocity formula introduces difficulties for particles in searching the undiscovered optimal solutions separated by infeasible regions and being mutually restrained on directions by social and cognitive factors. Afterward, the particles cause premature convergence and difficulty searching the undiscovered optimal regions to improve their solutions. Observing the biological ant colony and inspired by lazy ant behavior, this study proposes an easy particle that simulates the lazy ant to diversify the moving direction. Finally, this study integrates the proposed easy particles with referenced PSO-based approaches for solving NCO problems. The experiment results show that the proposed easy particles can effectively reinforce exploration abilities and improve the performances of all referenced PSO-based algorithms to reduce the status of premature convergence in solving NCO problems.
- 6 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 124757-124767
Open AccessEasy Particle Swarm Optimization for Nonlinear Constrained Optimization Problems
Particle swarm optimization (PSO) is a popular stochastic approach for solving practical optimal problems from industries due to its effective performance and few hyperparameters. Nonlinear constrained optimization (NCO) problems frequently cause multiple optimal regions and can cause many infeasible regions in the search space. The state-of-the-art approaches for handling the infeasible regions generated by problems’ constraints either block particles’ paths or penalize NCO problems’ objective values based on the standard updating velocity formula. The standard updating velocity formula introduces difficulties for particles in searching the undiscovered optimal solutions separated by infeasible regions and being mutually restrained on directions by social and cognitive factors. Afterward, the particles cause premature convergence and difficulty searching the undiscovered optimal regions to improve their solutions. Observing the biological ant colony and inspired by lazy ant behavior, this study proposes an easy particle that simulates the lazy ant to diversify the moving direction. Finally, this study integrates the proposed easy particles with referenced PSO-based approaches for solving NCO problems. The experiment results show that the proposed easy particles can effectively reinforce exploration abilities and improve the performances of all referenced PSO-based algorithms to reduce the status of premature convergence in solving NCO problems.