Qi Song
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
Qi Song has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Pu Chen
Department of Mechanics and Engineering Science & LTCS, College of Engineering, Peking University, Beijing 100871, P. R. China
1 shared publication- Pu Chen
State Key Laboratory for Turbulence and Complex Systems, Department of Mechanics and Engineering Science, College of Engineering, Peking University, No. 5 Yiheyuan Road, Haidian District, Beijing 100871, P. R. China
1 shared publication - Qinglei Liu
State Key Laboratory of Metal Matrix Composites, Shanghai Jiao Tong University, Shanghai 200240, PR China
1 shared publication Ren Yang
Department of Mechanics and Engineering Science & LTCS, College of Engineering, Peking University, Beijing 100871, P. R. China
1 shared publication- Shuli Sun
LTCS, Department of Mechanics and Engineering Science, College of Engineering, Peking University, Beijing, China
1 shared publication - Song Yao
Hebei Key Laboratory of Robot Perception and Human-robot Interaction, Hebei University of Technology, Tianjin, China
1 shared publication
Latest Publications
- Open Access
- 29 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 101042-101051
Traveling Salesman Problems With Replenishment Arcs and Improved Ant Colony Algorithms
The traveling salesman problem (TSP), can be used as a typical combinatorial optimization problem, to describe a wide variety of practical engineering optimization problems in various fields. In this study, the problem of personnel and equipment utilization in the transportation industry was abstracted, a more general class of TSPs with replenishment arcs was proposed, an optimization model to minimize the total travel time was established, the ant colony optimization algorithm to solve the standard TSP was improved, and an improved ant colony algorithm based on dynamic heuristic information was designed. Simulation experiments showed that the algorithm can account for the cumulative mileage constraint and search for the shortest path, effectively solving the TSP with replenishment arcs.
- 29 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 101042-101051
Open AccessTraveling Salesman Problems With Replenishment Arcs and Improved Ant Colony Algorithms
The traveling salesman problem (TSP), can be used as a typical combinatorial optimization problem, to describe a wide variety of practical engineering optimization problems in various fields. In this study, the problem of personnel and equipment utilization in the transportation industry was abstracted, a more general class of TSPs with replenishment arcs was proposed, an optimization model to minimize the total travel time was established, the ant colony optimization algorithm to solve the standard TSP was improved, and an improved ant colony algorithm based on dynamic heuristic information was designed. Simulation experiments showed that the algorithm can account for the cumulative mileage constraint and search for the shortest path, effectively solving the TSP with replenishment arcs.
- 29 November 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 17 (04)
An Improvement to Exact Reanalysis Algorithm for Local Non-topological Structural Modifications
A new direct reanalysis algorithm for local high-rank structural modifications, based on triangular factorization, has recently been developed. In this work, an improvement is proposed for further reduction of the workload so that the algorithm becomes more efficient and also suitable for low-rank modifications. Compared to the original algorithm, firstly, an alternative formula for updating the triangular factors is derived to avoid repetitive calculations for certain low-rank cases. Secondly, to maximize the efficiency, a combined algorithm is proposed that estimates the workloads of the original and alternative algorithms for each row individually before numerical calculations and selects the one with smaller workload. Numerical experiments show that compared with full factorization, the combined algorithm is significantly more efficient and expected to save up to 75% of execution time in our numerical examples. The new method can be easily implemented and applied to engineering problems, especially to local and step-by-step modification of structures.
- 29 November 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 17 (04)
An Improvement to Exact Reanalysis Algorithm for Local Non-topological Structural Modifications
A new direct reanalysis algorithm for local high-rank structural modifications, based on triangular factorization, has recently been developed. In this work, an improvement is proposed for further reduction of the workload so that the algorithm becomes more efficient and also suitable for low-rank modifications. Compared to the original algorithm, firstly, an alternative formula for updating the triangular factors is derived to avoid repetitive calculations for certain low-rank cases. Secondly, to maximize the efficiency, a combined algorithm is proposed that estimates the workloads of the original and alternative algorithms for each row individually before numerical calculations and selects the one with smaller workload. Numerical experiments show that compared with full factorization, the combined algorithm is significantly more efficient and expected to save up to 75% of execution time in our numerical examples. The new method can be easily implemented and applied to engineering problems, especially to local and step-by-step modification of structures.
- Open Access
- 1 January 2013
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-7
Partial Refactorization in Sparse Matrix Solution: A New Possibility for Faster Nonlinear Finite Element Analysis
This paper proposes a partial refactorization for faster nonlinear analysis based on sparse matrix solution, which is nowadays the default solution choice in finite element analysis and can solve finite element models up to millions degrees of freedom. Among various fill-in’s reducing strategies for sparse matrix solution, the graph partition is in general the best in terms of resultant fill-ins and floating-point operations and furthermore produces a particular graph of sparse matrix that prevents local change of entries from wide spreading in factorization. Based on this feature, an explicit partial triangular refactorization with local change is efficiently constructed with limited additional storage requirement in row-sparse storage scheme. The partial refactorization of the changed stiffness matrix inherits a big percentage of the original factor and is carried out only on partial factor entries. The proposed method provides a new possibility for faster nonlinear analysis and is mainly suitable for material nonlinear problems and optimization problems. Compared to full factorization, it can significantly reduce the factorization time and can make nonlinear analysis more efficient.
- 1 January 2013
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-7
Open AccessPartial Refactorization in Sparse Matrix Solution: A New Possibility for Faster Nonlinear Finite Element Analysis
This paper proposes a partial refactorization for faster nonlinear analysis based on sparse matrix solution, which is nowadays the default solution choice in finite element analysis and can solve finite element models up to millions degrees of freedom. Among various fill-in’s reducing strategies for sparse matrix solution, the graph partition is in general the best in terms of resultant fill-ins and floating-point operations and furthermore produces a particular graph of sparse matrix that prevents local change of entries from wide spreading in factorization. Based on this feature, an explicit partial triangular refactorization with local change is efficiently constructed with limited additional storage requirement in row-sparse storage scheme. The partial refactorization of the changed stiffness matrix inherits a big percentage of the original factor and is carried out only on partial factor entries. The proposed method provides a new possibility for faster nonlinear analysis and is mainly suitable for material nonlinear problems and optimization problems. Compared to full factorization, it can significantly reduce the factorization time and can make nonlinear analysis more efficient.