Solving Large Scale Uniform Traveling Salesman Problem by Using Partial Solution Expansion Method

2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT)(2023)

引用 0|浏览4
暂无评分
摘要
We present a new method for obtaining an initial and non-optimal solution for traveling salesman problem in which the points are distributed uniformly. This method is approximate, and the whole problem is divided into smaller subproblems to generate the solution. This method is called “partial solution expansion method” in this research as the solution is initially generated for a subset of points and is gradually expanded to other subsets.
更多
查看译文
关键词
Traveling salesman problem,decomposition,large-scale,software,combinatorial optimization,algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要