Chenyang Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chenyang Hu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Yuelin Gao
School of Mathematics and Information Science, North Minzu University, Yinchuan, China
3 shared publications - Eryang Guo
School of Mathematics and Information Science, North Minzu University, Yinchuan 750021, China
2 shared publications - Fuping Tian
School of Mathematics and Information Sciences, North Minzu University, Yinchuan 750021, China
1 shared publication - Jiaojiao Zhang
School of Mathematics and Information Sciences, North Minzu University, Yinchuan 750021, China
1 shared publication - Suxia Ma
School of Mathematics and Statistics, Ningxia University, Yinchuan, China
1 shared publication
Latest Publications
- Open Access
- 29 May 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (11) , 1694
A Novel Improved Genetic Algorithm for Multi-Period Fractional Programming Portfolio Optimization Model in Fuzzy Environment
The complexity of historical data in financial markets and the uncertainty of the future, as well as the idea that investors always expect the least risk and the greatest return. This study presents a multi-period fractional portfolio model in a fuzzy environment, taking into account the limitations of asset quantity, asset position, transaction cost, and inter-period investment. This is a mixed integer programming NP-hard problem. To overcome the problem, an improved genetic algorithm (IGA) is presented. The IGA contribution mostly involves the following three points: (i) A cardinal constraint processing approach is presented for the cardinal constraint conditions in the model; (ii) Logistic chaotic mapping was implemented to boost the initial population diversity; (iii) An adaptive golden section variation probability formula is developed to strike the right balance between exploration and development. To test the model’s logic and the performance of the proposed algorithm, this study picks stock data from the Shanghai Stock Exchange 50 for simulated investing and examines portfolio strategies under various limitations. In addition, the numerical results of simulated investment are compared and analyzed, and the results show that the established models are in line with the actual market situation and the designed algorithm is effective, and the probability of obtaining the optimal value is more than 37.5% higher than other optimization algorithms.
- 29 May 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (11) , 1694
Open AccessA Novel Improved Genetic Algorithm for Multi-Period Fractional Programming Portfolio Optimization Model in Fuzzy Environment
The complexity of historical data in financial markets and the uncertainty of the future, as well as the idea that investors always expect the least risk and the greatest return. This study presents a multi-period fractional portfolio model in a fuzzy environment, taking into account the limitations of asset quantity, asset position, transaction cost, and inter-period investment. This is a mixed integer programming NP-hard problem. To overcome the problem, an improved genetic algorithm (IGA) is presented. The IGA contribution mostly involves the following three points: (i) A cardinal constraint processing approach is presented for the cardinal constraint conditions in the model; (ii) Logistic chaotic mapping was implemented to boost the initial population diversity; (iii) An adaptive golden section variation probability formula is developed to strike the right balance between exploration and development. To test the model’s logic and the performance of the proposed algorithm, this study picks stock data from the Shanghai Stock Exchange 50 for simulated investing and examines portfolio strategies under various limitations. In addition, the numerical results of simulated investment are compared and analyzed, and the results show that the established models are in line with the actual market situation and the designed algorithm is effective, and the probability of obtaining the optimal value is more than 37.5% higher than other optimization algorithms.
- Open Access
- 18 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (3) , 522
A Hybrid PSO-DE Intelligent Algorithm for Solving Constrained Optimization Problems Based on Feasibility Rules
In this paper, we study swarm intelligence computation for constrained optimization problems and propose a new hybrid PSO-DE algorithm based on feasibility rules. Establishing individual feasibility rules as a way to determine whether the position of an individual satisfies the constraint or violates the degree of the constraint, which will determine the choice of the individual optimal position and the global optimal position in the particle population. First, particle swarm optimization (PSO) is used to act on the top 50% of individuals with higher degree of constraint violation to update their velocity and position. Second, Differential Evolution (DE) is applied to act on the individual optimal position of each individual to form a new population. The current individual optimal position and the global optimal position are updated using the feasibility rules, thus forming a hybrid PSO-DE intelligent algorithm. Analyzing the convergence and complexity of PSO-DE. Finally, the performance of the PSO-DE algorithm is tested with 12 benchmark functions of constrained optimization and 57 engineering optimization problems, the numerical results show that the proposed algorithm has good accuracy, effectiveness and robustness.
- 18 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (3) , 522
Open AccessA Hybrid PSO-DE Intelligent Algorithm for Solving Constrained Optimization Problems Based on Feasibility Rules
In this paper, we study swarm intelligence computation for constrained optimization problems and propose a new hybrid PSO-DE algorithm based on feasibility rules. Establishing individual feasibility rules as a way to determine whether the position of an individual satisfies the constraint or violates the degree of the constraint, which will determine the choice of the individual optimal position and the global optimal position in the particle population. First, particle swarm optimization (PSO) is used to act on the top 50% of individuals with higher degree of constraint violation to update their velocity and position. Second, Differential Evolution (DE) is applied to act on the individual optimal position of each individual to form a new population. The current individual optimal position and the global optimal position are updated using the feasibility rules, thus forming a hybrid PSO-DE intelligent algorithm. Analyzing the convergence and complexity of PSO-DE. Finally, the performance of the PSO-DE algorithm is tested with 12 benchmark functions of constrained optimization and 57 engineering optimization problems, the numerical results show that the proposed algorithm has good accuracy, effectiveness and robustness.
- Open Access
- 16 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (2) , 270
A Relaxed and Bound Algorithm Based on Auxiliary Variables for Quadratically Constrained Quadratic Programming Problem
Quadratically constrained quadratic programs (QCQP), which often appear in engineering practice and management science, and other fields, are investigated in this paper. By introducing appropriate auxiliary variables, QCQP can be transformed into its equivalent problem (EP) with non-linear equality constraints. After these equality constraints are relaxed, a series of linear relaxation subproblems with auxiliary variables and bound constraints are generated, which can determine the effective lower bound of the global optimal value of QCQP. To enhance the compactness of sub-rectangles and improve the ability to remove sub-rectangles, two rectangle-reduction strategies are employed. Besides, two -subproblem deletion rules are introduced to improve the convergence speed of the algorithm. Therefore, a relaxation and bound algorithm based on auxiliary variables are proposed to solve QCQP. Numerical experiments show that this algorithm is effective and feasible.- 16 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (2) , 270
Open AccessA Relaxed and Bound Algorithm Based on Auxiliary Variables for Quadratically Constrained Quadratic Programming Problem
Quadratically constrained quadratic programs (QCQP), which often appear in engineering practice and management science, and other fields, are investigated in this paper. By introducing appropriate auxiliary variables, QCQP can be transformed into its equivalent problem (EP) with non-linear equality constraints. After these equality constraints are relaxed, a series of linear relaxation subproblems with auxiliary variables and bound constraints are generated, which can determine the effective lower bound of the global optimal value of QCQP. To enhance the compactness of sub-rectangles and improve the ability to remove sub-rectangles, two rectangle-reduction strategies are employed. Besides, two -subproblem deletion rules are introduced to improve the convergence speed of the algorithm. Therefore, a relaxation and bound algorithm based on auxiliary variables are proposed to solve QCQP. Numerical experiments show that this algorithm is effective and feasible.