Simple approach to TSP by permutation of six cities and deletion of crossover

1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368) Pub Date : 1999-08-22 DOI:10.1109/PACRIM.1999.799555

N. Matsumoto, S. Yashiki

引用次数: 3

Abstract

We examine an intuitive and very simple approach to find a suboptimal solution to TSP. The algorithm consists of the determination of the initial tour, permutation of the consecutive six cities and the deletion of the crossover. We have tested two kinds of algorithm to the examples on the Web site of TSPLIB95. The average ratio of the length of the obtained tour to the optimal length was 1.0464 and 1.0662.

查看原文本刊更多论文

6个城市置换和删除交叉的简单TSP方法

我们研究了一种直观和非常简单的方法来寻找TSP的次优解。该算法包括初始巡回的确定，连续六个城市的排列和交叉的删除。我们用TSPLIB95网站上的实例对两种算法进行了测试。所得行程长度与最优行程长度的平均比值分别为1.0464和1.0662。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)

自引率

0.00%

发文量