Qiuyun Tao

Qiuyun Tao

Auto-generated profile, based on publicly available information

Qiuyun Tao

Liaocheng University,School of Computer Science,Liaocheng,China,252059

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
23 February 2021 in IEEE Access
Verified
Journal Article
Open access
TQTao Qiuyun
Tao Qiuyun
HSHongyan SANG
Hongyan SANG
GHGuo Hengwei
Guo Hengwei
WPWang Ping
Wang Ping
In smart manufacturing workshops, automated guided vehicles (AGVs) are increasingly used to transport materials required for machine tools. This paper studies the AGV path planning problem of a one-line production line in the workshop, establishes a mathematical model with the shortest transportation time as the objective function, and proposes an improved particle swarm optimization(IPSO) algorithm to obtain an optimal path. In order to be suitable for solving the path planning problem, we propose a new coding method based on this algorithm, design a crossover operation to update the particle position, and adopt a mutation mechanism to avoid the algorithm from falling into the local optimum. By calculating the shortest transportation time obtained, the improved algorithm is compared with other intelligent optimization algorithms. The experimental results show that the algorithm can improve the efficiency of AGV in material transportation and verify the effectiveness of related improvement mechanisms.

11 May 2020 in IEEE Access
Verified
Journal Article
Open access
PWPing Wang
Ping Wang
HSHongyan SANG
Hongyan SANG
QTQiuyun Tao
Qiuyun Tao
HGHengwei Guo
Hengwei Guo
JLJunqing Li
Junqing Li
YHYuyan Han
Yuyan Han
Hybrid flowshop scheduling problem with lot-streaming (HLFS) has played an important role in modern industrial systems. In this paper, we preset an improved migrating birds optimization (IMBO) algorithm for HLFS to minimize makespan. To ensure the diversity of initial population, a Nawaz–Enscore–Ham (NEH) heuristic algorithm is used to generate the leader, and the remaining solutions are randomly generated. According to the characteristics of the HLFS problem, we propose a combined neighborhood search structure that consists of four different neighborhood operators. We design effective local search procedure to explore potential promising domains. In addition, a reset mechanism is added to avoid falling into local optimum. Extensive experiments and comparison demonstrate the feasibility and effectiveness of the proposed algorithm.

26 July 2021
Verified
Conference Paper
Closed access
QTQiuyun Tao
Qiuyun Tao
HSHongyan SANG
Hongyan SANG
HGHengwei Guo
Hengwei Guo
YHYuyan Han
Yuyan Han
In order to solve the scheduling optimization problem of multiple automated guided vehicles (multi-AGVs) in the production workshop, an optimization model for the shortest AGV material transportation time is established and a genetic particle swarm optimization (GPSO) algorithm is proposed. In order to balance the global and local search capabilities of the algorithm, a multi-neighborhood topology scheme is designed. The best-worst crossover operation is used to ensure that the solutions produced are all feasible solutions. The improved mutation operation is designed to speed up the convergence speed and jump out of the local optimum. The proposed algorithm is compared with the particle swarm optimization algorithm, the ant colony optimization algorithm and the genetic algorithm. Experiments and comparisons have proved the feasibility and effectiveness of the improved algorithm.