An inner and outer ring heuristic algorithm for TSP

This article proposed an algorithm for solving traveling salesman problem from the perspective of geometry. At a given planar point distribution, search remote border points and connect these points to form a polygon circuit called outer ring including all the points, according to the same principle, search a polygon inner ring circuit among the points that aren't in outer ring. According to the principle that points add to the polygon minimize the circuit circumference, add inner ring circuit points to outer ring in proper order, add the surrounded points to the inner ring circuit, a outer ring circuit spread all over points was formed at last. Experimental result shows that this algorithm can obtain a satisfied stable result and has advantage in the solving speed.

[1]  Yirong Yang,et al.  Application of continuous Hopfield network to solve the TSP , 2004, ICARCV 2004 8th Control, Automation, Robotics and Vision Conference, 2004..

[2]  Mohammad-Bagher Naghibi-Sistani,et al.  A New Approach to Solve Traveling Salesman Problem Using Genetic Algorithm Based on Heuristic Crossover and Mutation Operator , 2009, 2009 International Conference of Soft Computing and Pattern Recognition.

[3]  Moshe Lewenstein,et al.  Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.

[4]  Evangelos A. Yfantis,et al.  An OCR-independent character segmentation using shortest-path in grayscale document images , 2007, ICMLA 2007.

[5]  Liu Sun-jun.  A TSP Solving Model Based on Immune Ant Colony Hybrid Algorithm , 2010 .

[6]  Emilio Luque,et al.  A Computational Approach to TSP Performance Prediction Using Data Mining , 2007, 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07).

[7]  Jie Zhang,et al.  An Improved Genetic Algorithm for TSP , 2007 .

[8]  Han Yun.  Optimizing Delivery Route on Genetic Algorithm , 2008 .

[9]  Gen-Lang Chen,et al.  Solving Large-Scale TSP Using Adaptive Clustering Method , 2009, 2009 Second International Symposium on Computational Intelligence and Design.

[10]  Jianxin Zhang,et al.  Solving TSP with Novel Local Search Heuristic Genetic Algorithms , 2008, 2008 Fourth International Conference on Natural Computation.

[11]  Zhaoquan Cai.  Multi-Direction Searching Ant Colony Optimization for Traveling Salesman Problems , 2008, 2008 International Conference on Computational Intelligence and Security.

[12]  Shuyan Chen,et al.  A New Ant Evolution Algorithm to Resolve TSP Problem , 2007, ICMLA 2007.

[13]  Ujjwal Maulik,et al.  A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA , 2008, IEEE Transactions on Evolutionary Computation.

[14]  Nur Azman Abu,et al.  Initial Result of Clustering Strategy to Euclidean TSP , 2009, 2009 International Conference of Soft Computing and Pattern Recognition.