Erchong Liao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Erchong Liao has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Changan Liu
School of Control and Computer Engineering, North China Electric Power University, Beijing, CO 102206 China
1 shared publicationFengquan Zhang
School of Computer Science, North China University of Technology, Beijing, China
1 shared publication- Xuqiang Shao
North China Electric Power University
1 shared publication
Latest Publications
- Open Access
- 5 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 38921-38933
A Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem
This paper proposed a hierarchical hybrid algorithm for Traveling Salesman Problem (TSP) according to the idea of divide-and-conquer. The TSP problem is decomposed into a few subproblems with small-scale nodes by Density Peaks Clustering algorithm (DPC). Every subproblem is resolved by Ant Colony Optimization algorithm (ACO), this is the lower layer. The center nodes of all subproblems constitute a new TSP problem, which forms the upper layer. All local tours of these subproblems are joined to generate the initial global tour in the same order that the center nodes are traversed in the upper layer TSP problem. Finally, the global tour is optimized by k-Opt algorithms. Thirty benchmark instances taken from TSPLIB are divided into three groups on the basis of problem size: small-scale, large-scale, and very large-scale. Experimental result shows that the proposed algorithm can obtain the solutions with higher accuracy and stronger robustness, and significantly reduce runtime, especially for the very large-scale TSP problem.
- 5 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 38921-38933
Open AccessA Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem
This paper proposed a hierarchical hybrid algorithm for Traveling Salesman Problem (TSP) according to the idea of divide-and-conquer. The TSP problem is decomposed into a few subproblems with small-scale nodes by Density Peaks Clustering algorithm (DPC). Every subproblem is resolved by Ant Colony Optimization algorithm (ACO), this is the lower layer. The center nodes of all subproblems constitute a new TSP problem, which forms the upper layer. All local tours of these subproblems are joined to generate the initial global tour in the same order that the center nodes are traversed in the upper layer TSP problem. Finally, the global tour is optimized by k-Opt algorithms. Thirty benchmark instances taken from TSPLIB are divided into three groups on the basis of problem size: small-scale, large-scale, and very large-scale. Experimental result shows that the proposed algorithm can obtain the solutions with higher accuracy and stronger robustness, and significantly reduce runtime, especially for the very large-scale TSP problem.
- Open Access
- 20 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 5, 13901-13908
Improving SPH Fluid Simulation Using Position Based Dynamics
Physical-based simulation technique has been widely used in creating astounding fluid appearances for film industries and computer games. However, stable and realistic fluid simulation based on Smoothed Particle Hydrodynamics (SPH) method is still challenging, as unstable solid boundary handling and numerical dissipation always plague current SPH fluid solvers. To solve these issues, we present a new method for improving SPH fluid simulation using position-based dynamics (PBD). For the stable fluidsolid interaction, by combining the position constraint solved by PBD and the relative contribution of solid boundary particles, we significantly alleviate the penetration issues at fluid-solid interfaces. And in order to stably simulate turbulence diffusion of SPH fluids, we enforce a novel nonlinear vorticity constraint on each fluid particle, and then solve it using PBD to smooth the vorticity field. The implementation results demonstrate that our method significantly improves SPH method for simulating realistic and stable animations of fluid phenomena.
- 20 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 5, 13901-13908
Open AccessImproving SPH Fluid Simulation Using Position Based Dynamics
Physical-based simulation technique has been widely used in creating astounding fluid appearances for film industries and computer games. However, stable and realistic fluid simulation based on Smoothed Particle Hydrodynamics (SPH) method is still challenging, as unstable solid boundary handling and numerical dissipation always plague current SPH fluid solvers. To solve these issues, we present a new method for improving SPH fluid simulation using position-based dynamics (PBD). For the stable fluidsolid interaction, by combining the position constraint solved by PBD and the relative contribution of solid boundary particles, we significantly alleviate the penetration issues at fluid-solid interfaces. And in order to stably simulate turbulence diffusion of SPH fluids, we enforce a novel nonlinear vorticity constraint on each fluid particle, and then solve it using PBD to smooth the vorticity field. The implementation results demonstrate that our method significantly improves SPH method for simulating realistic and stable animations of fluid phenomena.