Qi Song

Qi Song

Auto-generated profile, based on publicly available information

Qi Song

School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 June 2021 in IEEE Access
Verified
Journal Article
Open access
XZXiaoxu Zeng
Xiaoxu Zeng
QSQi Song
Qi Song
SYSong Yao
Song Yao
ZTZhiqiang Tian
Zhiqiang Tian
QLQinglei Liu
Qinglei Liu
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 in International Journal of Computational Methods
Verified
Journal Article
Closed access
PDF file
QSQi Song
Qi Song
RYRen Yang
Ren Yang
PCPu Chen
Pu Chen

1 January 2013 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
QSQi Song
Qi Song
PCPu Chen
Pu Chen
SSShuli Sun
Shuli Sun
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.