Bulletin of Surveying and Mapping ›› 2023, Vol. 0 ›› Issue (3): 165-172.doi: 10.13474/j.cnki.11-2246.2023.0092

Previous Articles     Next Articles

Efficient solution of large-scale MMTSP problem based on Tyson graph

ZHANG Yongliang1,2, WANG Jiarun2   

  1. 1. Alibaba Network Technology Co., Ltd., Beijing 100020, China;
    2. North China Institute of Computing Technology, Beijing 100083, China
  • Received:2022-05-30 Published:2023-04-04

Abstract: Aiming at the problem of uneven task division and low computational efficiency in large-scale MMTSP,An efficient computational framework based on Tyson digram is proposed.Firstly,based on the proposed upper and lower convex hull alg orithm of discrete points,the Tyson digram is constructed quickly. Secondly,based on the proposed high point ignored method,the task division of MMTSP is completed quickly. Finally,the simulated annealing algorithm for sin gle TSP is used to sovle the large-scale MMTSP problem efficiently.To further improve the efficiency,some parts of the framework are based on GPU,So the task partition design of GPU parallel accelerated computing is proposed. Combine with software level a framework of software and hardware coaccelerated computing is proposed.Experiments show that,this algorithm has great advantages in accelerating optimization and balancing task division,the calculation results and efficiency are better than other two algorithms, after software and hardware coacceleration,the efficiency can be further increased by about 10 times.

Key words: large-scale MMTSP, fast construction Tyson graph, high point ignored, uniform task division, hardware and software coordination

CLC Number: