Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 854218, 8 pages
http://dx.doi.org/10.1155/2015/854218
Research Article

Solving Large-Scale TSP Using a Fast Wedging Insertion Partitioning Approach

1School of Science, Central South University of Forestry and Technology, Changsha, Hunan 410004, China
2China Electric Power Research Institute, Beijing 100192, China
3Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China
4State Grid Fujian Electric Power Research Institute, Fuzhou, Fujian 350007, China

Received 10 November 2014; Accepted 18 May 2015

Academic Editor: P. Balasubramaniam

Copyright © 2015 Zuoyong Xiang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

A new partitioning method, called Wedging Insertion, is proposed for solving large-scale symmetric Traveling Salesman Problem (TSP). The idea of our proposed algorithm is to cut a TSP tour into four segments by nodes’ coordinate (not by rectangle, such as Strip, FRP, and Karp). Each node is located in one of their segments, which excludes four particular nodes, and each segment does not twist with other segments. After the partitioning process, this algorithm utilizes traditional construction method, that is, the insertion method, for each segment to improve the quality of tour, and then connects the starting node and the ending node of each segment to obtain the complete tour. In order to test the performance of our proposed algorithm, we conduct the experiments on various TSPLIB instances. The experimental results show that our proposed algorithm in this paper is more efficient for solving large-scale TSPs. Specifically, our approach is able to obviously reduce the time complexity for running the algorithm; meanwhile, it will lose only about 10% of the algorithm’s performance.