Xiangrong Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xiangrong Li has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
Hongtruong Pham
Thai Nguyen University of Economics and Business Administration, Thai Nguyen, Vietnam
2 shared publicationsBopeng Wang
Guangxi Colleges and Universities Key Laboratory of Mathematics and Its Applications, College of Mathematics and Information Science, Guangxi University, Nanning, Guangxi, P.R. China
1 shared publicationChao Hong
School of Electronic and Information Engineering, Shanghai Dianji University, Shanghai, China
1 shared publication- Dafa Li
Engineering Research Center of Advanced Driving Energy-saving Technology, Ministry of Education, Chengdu, People’s Republic of China
1 shared publication - Gonglin Yuan
Guangxi University
1 shared publication - Hongtao Huang
School of Automotive Studies, Tongji University, Shanghai, 201804, China
1 shared publication
Latest Publications
- Open Access
- 19 May 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (5) , e0348883
Shared drone route scheduling optimization
Shared passenger-carrying unmanned aerial vehicle (UAV) systems offer a promising solution for urban air mobility, yet their real-time scheduling in multi-airport environments remains challenging due to heterogeneous passenger demands, model compatibility constraints, and the need to balance efficiency with service quality. This study addresses these challenges by proposing a shared UAV route scheduling optimization model for multi-airport, multi-station systems. The model integrates passenger order characteristics (origin, destination, party size, preferred UAV type, and desired arrival time) with UAV operational parameters (current location, remaining endurance, seating capacity, speed, and model), and incorporates a quadratic soft time window mechanism to flexibly manage arrival deviations while minimizing total system navigation time. To solve this discrete combinatorial optimization problem, we develop a self-learning Ant-Lion Optimizer (SLALO) with natural number encoding that dynamically tracks seat availability and updates route assignments in real-time. Simulation results demonstrate that the proposed approach achieves a 27.3% reduction in total navigation time compared to non-pooling baselines, with an average UAV utilization rate of 78.6%. Comparative analysis against Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and standard Ant-Lion Optimizer (ALO) shows that SLALO achieves superior convergence speed and solution quality. The proposed framework is particularly relevant for border regions with limited ground infrastructure, where intelligent shared mobility systems can serve as a critical driver for cultivating new quality productive forces and supporting regional economic integration. These findings highlight the potential of shared UAV systems to improve urban air mobility efficiency, reduce operational costs, and enhance passenger satisfaction.
- 19 May 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (5) , e0348883
Open AccessShared drone route scheduling optimization
Shared passenger-carrying unmanned aerial vehicle (UAV) systems offer a promising solution for urban air mobility, yet their real-time scheduling in multi-airport environments remains challenging due to heterogeneous passenger demands, model compatibility constraints, and the need to balance efficiency with service quality. This study addresses these challenges by proposing a shared UAV route scheduling optimization model for multi-airport, multi-station systems. The model integrates passenger order characteristics (origin, destination, party size, preferred UAV type, and desired arrival time) with UAV operational parameters (current location, remaining endurance, seating capacity, speed, and model), and incorporates a quadratic soft time window mechanism to flexibly manage arrival deviations while minimizing total system navigation time. To solve this discrete combinatorial optimization problem, we develop a self-learning Ant-Lion Optimizer (SLALO) with natural number encoding that dynamically tracks seat availability and updates route assignments in real-time. Simulation results demonstrate that the proposed approach achieves a 27.3% reduction in total navigation time compared to non-pooling baselines, with an average UAV utilization rate of 78.6%. Comparative analysis against Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and standard Ant-Lion Optimizer (ALO) shows that SLALO achieves superior convergence speed and solution quality. The proposed framework is particularly relevant for border regions with limited ground infrastructure, where intelligent shared mobility systems can serve as a critical driver for cultivating new quality productive forces and supporting regional economic integration. These findings highlight the potential of shared UAV systems to improve urban air mobility efficiency, reduce operational costs, and enhance passenger satisfaction.
- 30 November 2020
- Published by Taylor & Francis in Applied Economics
- Vol. 53 (15) , 1729-1742
A numerical optimization pesudo-algorithm for two-player zero-sum stochastic games
A two-player, zero-sum stochastic game with two variables can be transformed into the coupled control PDEs by a transition probability matrix of the Markov chain. There exist two control variables and two tensity rates ( ) after the transformation that should be solved for. Yuan and Li (Computational Economics, 2018) give a numerical algorithm by the first-order necessary condition, which overcomes several drawbacks of the normal algorithm and describe several numerical experiments demonstrating the performance of their method. However, their method exhibits at least one shortcoming, which is that the final value of the control variables ( ) may exceed the definition domain. This situation means that the ( ) is infeasible and unacceptable. This paper presents a new technique to avoid that situation, and an optimization pseudo-algorithm is designed using the following steps: (i) starting from the given initial points an active-set algorithm is proposed; (ii) the limited memory update technique is used in the algorithm to obtain fast convergence and low storage; (iii) global convergence is established under suitable conditions; and (iv) numerical results are reported to demonstrate that the new algorithm is competitive with the normal algorithm.- 30 November 2020
- Published by Taylor & Francis in Applied Economics
- Vol. 53 (15) , 1729-1742
A numerical optimization pesudo-algorithm for two-player zero-sum stochastic games
A two-player, zero-sum stochastic game with two variables can be transformed into the coupled control PDEs by a transition probability matrix of the Markov chain. There exist two control variables and two tensity rates ( ) after the transformation that should be solved for. Yuan and Li (Computational Economics, 2018) give a numerical algorithm by the first-order necessary condition, which overcomes several drawbacks of the normal algorithm and describe several numerical experiments demonstrating the performance of their method. However, their method exhibits at least one shortcoming, which is that the final value of the control variables ( ) may exceed the definition domain. This situation means that the ( ) is infeasible and unacceptable. This paper presents a new technique to avoid that situation, and an optimization pseudo-algorithm is designed using the following steps: (i) starting from the given initial points an active-set algorithm is proposed; (ii) the limited memory update technique is used in the algorithm to obtain fast convergence and low storage; (iii) global convergence is established under suitable conditions; and (iv) numerical results are reported to demonstrate that the new algorithm is competitive with the normal algorithm.- Open Access
- 25 September 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-13
A New Hybrid PRPFR Conjugate Gradient Method for Solving Nonlinear Monotone Equations and Image Restoration Problems
A new hybrid PRPFR conjugate gradient method is presented in this paper, which is designed such that it owns sufficient descent property and trust region property. This method can be considered as a convex combination of the PRP method and the FR method while using the hyperplane projection technique. Under accelerated step length, the global convergence property is gained with some appropriate assumptions. Comparing with other methods, the numerical experiments show that the PRPFR method is more competitive for solving nonlinear equations and image restoration problems.
- 25 September 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-13
Open AccessA New Hybrid PRPFR Conjugate Gradient Method for Solving Nonlinear Monotone Equations and Image Restoration Problems
A new hybrid PRPFR conjugate gradient method is presented in this paper, which is designed such that it owns sufficient descent property and trust region property. This method can be considered as a convex combination of the PRP method and the FR method while using the hyperplane projection technique. Under accelerated step length, the global convergence property is gained with some appropriate assumptions. Comparing with other methods, the numerical experiments show that the PRPFR method is more competitive for solving nonlinear equations and image restoration problems.
- Open Access
- 4 September 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-14
A Modified Three-Term Type CD Conjugate Gradient Algorithm for Unconstrained Optimization Problems
Conjugate gradient methods are well-known methods which are widely applied in many practical fields. CD conjugate gradient method is one of the classical types. In this paper, a modified three-term type CD conjugate gradient algorithm is proposed. Some good features are presented as follows: (i) A modified three-term type CD conjugate gradient formula is presented. (ii) The given algorithm possesses sufficient descent property and trust region property. (iii) The algorithm has global convergence with the modified weak Wolfe–Powell (MWWP) line search technique and projection technique for general function. The new algorithm has made great progress in numerical experiments. It shows that the modified three-term type CD conjugate gradient method is more competitive than the classical CD conjugate gradient method.
- 4 September 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-14
Open AccessA Modified Three-Term Type CD Conjugate Gradient Algorithm for Unconstrained Optimization Problems
Conjugate gradient methods are well-known methods which are widely applied in many practical fields. CD conjugate gradient method is one of the classical types. In this paper, a modified three-term type CD conjugate gradient algorithm is proposed. Some good features are presented as follows: (i) A modified three-term type CD conjugate gradient formula is presented. (ii) The given algorithm possesses sufficient descent property and trust region property. (iii) The algorithm has global convergence with the modified weak Wolfe–Powell (MWWP) line search technique and projection technique for general function. The new algorithm has made great progress in numerical experiments. It shows that the modified three-term type CD conjugate gradient method is more competitive than the classical CD conjugate gradient method.
- Open Access
- 11 May 2020
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2020 (1) , 1-14
A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
The subspace technique has been widely used to solve unconstrained/constrained optimization problems and there exist many results that have been obtained. In this paper, a subspace algorithm combining with limited memory BFGS update is proposed for large-scale nonsmooth optimization problems with box-constrained conditions. This algorithm can ensure that all iteration points are feasible and the sequence of objective functions is decreasing. Moreover, rapid changes in the active set are allowed. The global convergence is established under some suitable conditions. Numerical results show that this method is very effective for large-scale nonsmooth box-constrained optimization, where the largest dimension of the test problems is 11,000 variables.
- 11 May 2020
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2020 (1) , 1-14
Open AccessA limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
The subspace technique has been widely used to solve unconstrained/constrained optimization problems and there exist many results that have been obtained. In this paper, a subspace algorithm combining with limited memory BFGS update is proposed for large-scale nonsmooth optimization problems with box-constrained conditions. This algorithm can ensure that all iteration points are feasible and the sequence of objective functions is decreasing. Moreover, rapid changes in the active set are allowed. The global convergence is established under some suitable conditions. Numerical results show that this method is very effective for large-scale nonsmooth box-constrained optimization, where the largest dimension of the test problems is 11,000 variables.
- Open Access
- 1 January 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-11
A Conjugate Gradient Algorithm under Yuan-Wei-Lu Line Search Technique for Large-Scale Minimization Optimization Models
This paper gives a modified Hestenes and Stiefel (HS) conjugate gradient algorithm under the Yuan-Wei-Lu inexact line search technique for large-scale unconstrained optimization problems, where the proposed algorithm has the following properties: the new search direction possesses not only a sufficient descent property but also a trust region feature; the presented algorithm has global convergence for nonconvex functions; the numerical experiment showed that the new algorithm is more effective than similar algorithms.- 1 January 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-11
Open AccessA Conjugate Gradient Algorithm under Yuan-Wei-Lu Line Search Technique for Large-Scale Minimization Optimization Models
This paper gives a modified Hestenes and Stiefel (HS) conjugate gradient algorithm under the Yuan-Wei-Lu inexact line search technique for large-scale unconstrained optimization problems, where the proposed algorithm has the following properties: the new search direction possesses not only a sufficient descent property but also a trust region feature; the presented algorithm has global convergence for nonconvex functions; the numerical experiment showed that the new algorithm is more effective than similar algorithms. - Open Access
- 9 August 2017
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2017 (1) , 1-18
A modified nonmonotone BFGS algorithm for unconstrained optimization
In this paper, a modified BFGS algorithm is proposed for unconstrained optimization. The proposed algorithm has the following properties: (i) a nonmonotone line search technique is used to obtain the step size $\alpha_{k}$ to improve the effectiveness of the algorithm; (ii) the algorithm possesses not only global convergence but also superlinear convergence for generally convex functions; (iii) the algorithm produces better numerical results than those of the normal BFGS method.- 9 August 2017
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2017 (1) , 1-18
Open AccessA modified nonmonotone BFGS algorithm for unconstrained optimization
In this paper, a modified BFGS algorithm is proposed for unconstrained optimization. The proposed algorithm has the following properties: (i) a nonmonotone line search technique is used to obtain the step size $\alpha_{k}$ to improve the effectiveness of the algorithm; (ii) the algorithm possesses not only global convergence but also superlinear convergence for generally convex functions; (iii) the algorithm produces better numerical results than those of the normal BFGS method. - Open Access
- 1 January 2014
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2014, 1-9
A Limited Memory BFGS Method for Solving Large-Scale Symmetric Nonlinear Equations
A limited memory BFGS (L-BFGS) algorithm is presented for solving large-scale symmetric nonlinear equations, where a line search technique without derivative information is used. The global convergence of the proposed algorithm is established under some suitable conditions. Numerical results show that the given method is competitive to those of the normal BFGS methods.
- 1 January 2014
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2014, 1-9
Open AccessA Limited Memory BFGS Method for Solving Large-Scale Symmetric Nonlinear Equations
A limited memory BFGS (L-BFGS) algorithm is presented for solving large-scale symmetric nonlinear equations, where a line search technique without derivative information is used. The global convergence of the proposed algorithm is established under some suitable conditions. Numerical results show that the given method is competitive to those of the normal BFGS methods.
- Open Access
- 1 January 2009
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 50 (1) , 012104
An entanglement measure for n qubits
Coffman et al. [Phys. Rev. A 61, 052306 (2000)] introduced the residual entanglement for three qubits. In this paper, we present the entanglement measure τ(ψ) for even n qubits; for odd n qubits, we propose the residual entanglement τ(i)(ψ) with respect to qubit i and the odd n-tangle R(ψ) by averaging the residual entanglement with respect to each qubit. In this paper, we show that these measures are LU-invariant, entanglement monotones, invariant under permutations of the qubits, and multiplicative in some cases.
- 1 January 2009
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 50 (1) , 012104
Open AccessAn entanglement measure for n qubits
Coffman et al. [Phys. Rev. A 61, 052306 (2000)] introduced the residual entanglement for three qubits. In this paper, we present the entanglement measure τ(ψ) for even n qubits; for odd n qubits, we propose the residual entanglement τ(i)(ψ) with respect to qubit i and the odd n-tangle R(ψ) by averaging the residual entanglement with respect to each qubit. In this paper, we show that these measures are LU-invariant, entanglement monotones, invariant under permutations of the qubits, and multiplicative in some cases.
- 15 August 2007
- Published by Springer Nature in JOM
- Vol. 59 (8) , 27-34
A deterministic mechanism for dendritic solidification kinetics
- 15 August 2007
- Published by Springer Nature in JOM
- Vol. 59 (8) , 27-34
A deterministic mechanism for dendritic solidification kinetics