A Learning Automata based Algorithm for Solving Traveling Salesman Problem improved by Frequency-based Pruning

real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan chain optimization and drilling problem in integrated circuit testing and production. Distributed learning automata, that is a general searching tool and is a solving tool for variety of NP-complete problems, together with 2-opt local search is used to solve the Traveling Salesman Problem (TSP). Two mechanisms named frequency-based pruning strategy (FBPS) and fixed-radius near neighbour (FRNN) 2-opt are used to reduce the high overhead incurred by 2-opt in the DLA algorithm proposed previously. Using FBPS only a subset of promising solutions are proposed to perform 2-opt. Invoking geometric structure, FRNN 2-opt implements efficient 2-opt in a permutation of TSP sequence. Proposed algorithms are tested on a set of TSP benchmark problems and the results show that they are able to reduce computational time, while maintaining the average solution quality at 0.62% from known optimal.

[1]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[2]  M. Thathachar,et al.  Bounds on the Convergence Probabilities of Learning Automata , 1976 .

[3]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[4]  Marco Furini,et al.  International Journal of Computer and Applications , 2010 .

[5]  Alan Frieze,et al.  An extension of Christofides heuristic to the k-person travelling salesman problem , 1983, Discret. Appl. Math..

[6]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[7]  Panta Lucic,et al.  Computing with Bees: Attacking Complex Transportation Engineering Problems , 2003, Int. J. Artif. Intell. Tools.

[8]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[9]  John Knox,et al.  Tabu search performance on the symmetric traveling salesman problem , 1994, Comput. Oper. Res..

[10]  P. V. Laarhoven,et al.  A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem , 1988 .

[11]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[12]  Mir Mohammad Alipour.  A Learning Automata Based Algorithm For Solving Capacitated Vehicle Routing Problem , 2012 .

[13]  John S. Gero,et al.  Evolving design genes in space layout planning problems , 1998, Artif. Intell. Eng..

[14]  Craig A. Tovey,et al.  New Results on the Old k-opt Algorithm for the Traveling Salesman Problem , 1999, SIAM J. Comput..

[15]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[16]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[17]  T. Schnier,et al.  Genetic Engineering and Design Problems , 1997 .

[18]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[19]  Mandayam A. L. Thathachar,et al.  Convergence of teams and hierarchies of learning automata in connectionist systems , 1995, IEEE Trans. Syst. Man Cybern..

[20]  B. R. Harita,et al.  Learning automata with changing number of actions , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[21]  Gary G. Yen,et al.  A hybrid evolutionary algorithm for traveling salesman problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[22]  Mandayam A. L. Thathachar,et al.  A hierarchical system of learning automata that can learn die globally optimal path , 1987, Inf. Sci..

[23]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[24]  Kumpati S. Narendra,et al.  On the Behavior of a Learning Automaton in a Changing Environment with Application to Telephone Traffic Routing , 1980, IEEE Transactions on Systems, Man, and Cybernetics.