A Heuristic Algorithm Based on Tour Rebuilding Operator for the Traveling Salesman Problem

by   Yang Li, et al.

TSP (Traveling Salesman Problem), a classic NP-complete problem in combinatorial optimization, is of great significance in multiple fields. Exact algorithms for TSP are not practical due to their exponential time cost. Thus, approximate algorithms become the research focus and can be further divided into two types, tour construction algorithms and tour improvement algorithms. Researches show that the latter type of algorithms can obtain better solutions than the former one. However, traditional tour improvement algorithms have shortcomings. They converge very slowly and tend to be trapped in local optima. In practice, tour construction algorithms are often used in initialization of tour improvement algorithms to speed up convergence. Nevertheless, such a combination leads to no improvement on quality of solutions. In this paper, a heuristic algorithm based on the new tour rebuilding operator is proposed. The algorithm features rapid convergence and powerful global search. In the experiments based on 40 instances in TSPLIB, the best known solutions of 22 instances are refreshed by the proposed method. Meanwhile, the best known solutions of the other 18 instances are obtained.


page 1

page 2

page 3

page 4


The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem

The clustering problem has many applications in Machine Learning, Operat...

A Multi-parent Memetic Algorithm for the Linear Ordering Problem

In this paper, we present a multi-parent memetic algorithm (denoted by M...

A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem

The Travelling Salesman Problem (TSP) is one of the most popular Combina...

An effective crossing minimisation heuristic based on star insertion

We present a new heuristic method for minimising crossings in a graph. T...

An improved Ant Colony System for the Sequential Ordering Problem

It is not rare that the performance of one metaheuristic algorithm can b...

A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem

The longest arc-preserving common subsequence problem is an NP-hard comb...

Better Sample -- Random Subset Sum in 2^0.255n and its Impact on Decoding Random Linear Codes

We propose a new heuristic algorithm for solving random subset sum insta...

Please sign up or login with your details

Forgot password? Click here to reset