Guiling 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
Guiling Li has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Weihai Zhang
College of Electrical Engineering and Automation Shandong University of Science and Technology Qingdao China
2 shared publications - Min Wang
College of Information Engineering, Yangzhou University, Yangzhou, Jiangsu, China
1 shared publication - Shanchen Pang
China University of Petroleum (East China)
1 shared publication - Sibo Qiao
Tiangong University
1 shared publication - Tao Song
Qingdao Institute of Software, College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China
1 shared publication - Tongmao Ma
China University of Petroleum
1 shared publication
Latest Publications
- Open Access
- 8 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 106872-106879
Ant Colony Optimization With an Improved Pheromone Model for Solving MTSP With Capacity and Time Window Constraint
The optimization of logistics distribution can be defined as the multiple traveling salesman problem (MTSP). The purpose of existing heuristic algorithms, such as Genetic Algorithm (GA), Ant Colony Algorithm (ACO), etc., is to find the optimal path in a short time. However, two important factors of logistics distribution optimization, including work time window and the carrying capacity of the vehicle in distribution system, have been ignored. In this paper, we consider the influences of time limitation of modern commercial logistics and carrying capacity of the vehicle on the logistics optimization, and then propose a MTSP with constraints of time window and capacity of each salesman. We design a novel hybrid algorithm by combining the minimum spanning 1-tree with ACO to find the optimal solution. In addition, we improve the pheromone update rules to increase the search efficiency of ACO algorithm. The experiments show that the novel hybrid algorithm achieves a shorter path than the other algorithms.
- 8 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 106872-106879
Open AccessAnt Colony Optimization With an Improved Pheromone Model for Solving MTSP With Capacity and Time Window Constraint
The optimization of logistics distribution can be defined as the multiple traveling salesman problem (MTSP). The purpose of existing heuristic algorithms, such as Genetic Algorithm (GA), Ant Colony Algorithm (ACO), etc., is to find the optimal path in a short time. However, two important factors of logistics distribution optimization, including work time window and the carrying capacity of the vehicle in distribution system, have been ignored. In this paper, we consider the influences of time limitation of modern commercial logistics and carrying capacity of the vehicle on the logistics optimization, and then propose a MTSP with constraints of time window and capacity of each salesman. We design a novel hybrid algorithm by combining the minimum spanning 1-tree with ACO to find the optimal solution. In addition, we improve the pheromone update rules to increase the search efficiency of ACO algorithm. The experiments show that the novel hybrid algorithm achieves a shorter path than the other algorithms.
- Open Access
- 21 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 171452-171460
Server Consolidation Energy-Saving Algorithm Based on Resource Reservation and Resource Allocation Strategy
Energy consumption has overtaken equipment costs given the growth of computing power, thereby becoming the dominant cost to data centers. Constrained by ensuring that peak resource requirements of VMs are met, the effective use of resource fragments is an effective means of energy conservation. We apply resource reservation to the resource-utilization-aware energy efficient server consolidation algorithm (RUAEE), and propose a server consolidation energy-saving algorithm (SCES). We adjust the allocations of VMs by computing the resource reservation and resource allocation ratio dynamically. This technique maintains the host resource utilization to within a reasonable range, reduces resource fragmentation and reserves resources to satisfy the peak resource requests simultaneously. Compared with the RUAEE algorithm, our algorithm can reduce the risk of system overload and improve the stability of the system. The experimental results based on the actual workload of the Google cluster show that the algorithm is effective at reducing resource waste, improving system stability, and achieving energy savings.
- 21 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 171452-171460
Open AccessServer Consolidation Energy-Saving Algorithm Based on Resource Reservation and Resource Allocation Strategy
Energy consumption has overtaken equipment costs given the growth of computing power, thereby becoming the dominant cost to data centers. Constrained by ensuring that peak resource requirements of VMs are met, the effective use of resource fragments is an effective means of energy conservation. We apply resource reservation to the resource-utilization-aware energy efficient server consolidation algorithm (RUAEE), and propose a server consolidation energy-saving algorithm (SCES). We adjust the allocations of VMs by computing the resource reservation and resource allocation ratio dynamically. This technique maintains the host resource utilization to within a reasonable range, reduces resource fragmentation and reserves resources to satisfy the peak resource requests simultaneously. Compared with the RUAEE algorithm, our algorithm can reduce the risk of system overload and improve the stability of the system. The experimental results based on the actual workload of the Google cluster show that the algorithm is effective at reducing resource waste, improving system stability, and achieving energy savings.
- Open Access
- 1 January 2014
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2014 (1)
Discrete‐Time Indefinite Stochastic Linear Quadratic Optimal Control with Second Moment Constraints
This paper studies the discrete‐time stochastic linear quadratic (LQ) problem with a second moment constraint on the terminal state, where the weighting matrices in the cost functional are allowed to be indefinite. By means of the matrix Lagrange theorem, a new class of generalized difference Riccati equations (GDREs) is introduced. It is shown that the well‐posedness, and the attainability of the LQ problem and the solvability of the GDREs are equivalent to each other.
- 1 January 2014
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2014 (1)
Open AccessDiscrete‐Time Indefinite Stochastic Linear Quadratic Optimal Control with Second Moment Constraints
This paper studies the discrete‐time stochastic linear quadratic (LQ) problem with a second moment constraint on the terminal state, where the weighting matrices in the cost functional are allowed to be indefinite. By means of the matrix Lagrange theorem, a new class of generalized difference Riccati equations (GDREs) is introduced. It is shown that the well‐posedness, and the attainability of the LQ problem and the solvability of the GDREs are equivalent to each other.
- Open Access
- 24 December 2013
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2013, 1-9
Study on Indefinite Stochastic Linear Quadratic Optimal Control with Inequality Constraint
This paper studies the indefinite stochastic linear quadratic (LQ) optimal control problem with an inequality constraint for the terminal state. Firstly, we prove a generalized Karush-Kuhn-Tucker (KKT) theorem under hybrid constraints. Secondly, a new type of generalized Riccati equations is obtained, based on which a necessary condition (it is also a sufficient condition under stronger assumptions) for the existence of an optimal linear state feedback control is given by means of KKT theorem. Finally, we design a dynamic programming algorithm to solve the constrained indefinite stochastic LQ issue.
- 24 December 2013
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2013, 1-9
Open AccessStudy on Indefinite Stochastic Linear Quadratic Optimal Control with Inequality Constraint
This paper studies the indefinite stochastic linear quadratic (LQ) optimal control problem with an inequality constraint for the terminal state. Firstly, we prove a generalized Karush-Kuhn-Tucker (KKT) theorem under hybrid constraints. Secondly, a new type of generalized Riccati equations is obtained, based on which a necessary condition (it is also a sufficient condition under stronger assumptions) for the existence of an optimal linear state feedback control is given by means of KKT theorem. Finally, we design a dynamic programming algorithm to solve the constrained indefinite stochastic LQ issue.