A discrete invasive weed optimization algorithm for solving traveling salesman problem

Abstract The Traveling Salesman Problem (TSP) is one of the typical NP-hard problems. Efficient algorithms for the TSP have been the focus on academic circles at all times. This article proposes a discrete invasive weed optimization (DIWO) to solve TSP. Firstly, weeds individuals encode positive integer, on the basis that the normal distribution of the IWO does not change, and then calculate the fitness value of the weeds individuals. Secondly, the 3-Opt local search operator is used. Finally, an improved complete 2-Opt (I2Opt) is selected as a second local search operator for solve TSP. A benchmarks problem selected from TSPLIB is used to test the algorithm, and the results show that the DIWO algorithm proposed in this article can achieve to results closed to the theoretical optimal values within a reasonable period of time, and has strong robustness.

[1]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[2]  M. Marchese,et al.  An ant colony optimization method for generalized TSP problem , 2008 .

[3]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[4]  Shuo Wang,et al.  Tuning of Auto-Disturbance Rejection Controller Based on the Invasive Weed Optimization , 2011, 2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications.

[5]  Václav Snásel,et al.  A Modified Invasive Weed Optimization Algorithm for training of feed- forward Neural Networks , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[6]  D.-S. Huang,et al.  Radial Basis Probabilistic Neural Networks: Model and Application , 1999, Int. J. Pattern Recognit. Artif. Intell..

[7]  Aghil Yousefi-Koma,et al.  A novel technique for optimal placement of piezoelectric actuators on smart structures , 2011, J. Frankl. Inst..

[8]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[9]  John E. Hunt,et al.  Learning using an artificial immune system , 1996 .

[10]  Stuart E. Dreyfus,et al.  Applied Dynamic Programming , 1965 .

[11]  Sergio Scheer,et al.  Recurrent Neural Networks with the Soft 'Winner Takes All' Principle Applied to the Traveling Salesman Problem , 2010 .

[12]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[13]  De-Shuang Huang,et al.  An improved approximation approach incorporating particle swarm optimization and a priori information into neural networks , 2010, Neural Computing and Applications.

[14]  Rush D. Robinett,et al.  Applied dynamic programming for optimization of dynamical systems , 2005, Advances in design and control.

[15]  Xin-She Yang,et al.  Discrete cuckoo search algorithm for the travelling salesman problem , 2014, Neural Computing and Applications.

[16]  Swagatam Das,et al.  Design of Non-Uniform Circular Antenna Arrays Using a Modified Invasive Weed Optimization Algorithm , 2011, IEEE Transactions on Antennas and Propagation.

[17]  Jin Xu,et al.  Application of a novel IWO to the design of encoding sequences for DNA computing , 2009, Comput. Math. Appl..

[18]  De-Shuang Huang,et al.  A Neural Root Finder of Polynomials Based on Root Moments , 2004, Neural Computation.

[19]  Qiang Li,et al.  Fat Computational Complexity and Heuristic Design for the TSP: Fat Computational Complexity and Heuristic Design for the TSP , 2009 .

[20]  Yongquan Zhou,et al.  Invasive Weed Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem , 2013 .

[21]  Michael R. Lyu,et al.  A novel adaptive sequential niche technique for multimodal function optimization , 2006, Neurocomputing.

[22]  De-Shuang Huang,et al.  A novel full structure optimization algorithm for radial basis probabilistic neural networks , 2006, Neurocomputing.

[23]  Amit Konar,et al.  Energy efficient trajectory planning by a robot arm using invasive weed optimization technique , 2011, 2011 Third World Congress on Nature and Biologically Inspired Computing.

[24]  Funda Samanlioglu,et al.  A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem , 2008, Comput. Ind. Eng..

[25]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[26]  Michel Gendreau,et al.  GENI Ants for the Traveling Salesman Problem , 2004, Ann. Oper. Res..

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

[28]  Mohsen Ramezani Ghalenoei,et al.  Discrete invasive weed optimization algorithm: application to cooperative multiple task assignment of UAVs , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[29]  Li Shang,et al.  Palmprint recognition using FastICA algorithm and radial basis probabilistic neural network , 2006, Neurocomputing.

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

[31]  S. Nakayama,et al.  An Evolutionary Multiple Heuristic with Genetic Local Search for Solving TSP , 2008 .

[32]  C. Lucas,et al.  A novel numerical optimization algorithm inspired from weed colonization , 2006, Ecol. Informatics.

[33]  Xiaofeng Wang,et al.  Shape recognition based on neural networks trained by differential evolution algorithm , 2007, Neurocomputing.

[34]  Xiangdong Liu,et al.  A novel hysteretic chaotic neural network and its applications , 2007, Neurocomputing.

[35]  Yung-Fa Huang,et al.  Invasive weed optimization method based blind multiuser detection for MC-CDMA interference suppression over multipath fading channel , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[36]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[37]  De-Shuang Huang,et al.  A New Constrained Independent Component Analysis Method , 2007, IEEE Transactions on Neural Networks.

[38]  Huang Zhen,et al.  An Ant Colony Algorithm Based on Multiple-Grain Representation for the Traveling Salesman Problems , 2010 .

[39]  Li Fu-pen.  An invasive weed optimization algorithm for constrained engineering design problems , 2009 .

[40]  Huan Zhao,et al.  Constrained Optimization of Combustion at a Coal-Fired Utility Boiler Using Hybrid Particle Swarm Optimization with Invasive Weed , 2009, 2009 International Conference on Energy and Environment Technology.

[41]  Liu Hong-xia,et al.  Discrete Glowworm Swarm Optimization Algorithm for TSP Problem , 2012 .

[42]  De-Shuang Huang,et al.  A Constructive Hybrid Structure Optimization Methodology for Radial Basis Probabilistic Neural Networks , 2008, IEEE Transactions on Neural Networks.

[43]  Jiang He.  Fat Computational Complexity and Heuristic Design for the TSP , 2009 .

[44]  De-Shuang Huang,et al.  Determining the centers of radial basis probabilistic neural networks by recursive orthogonal least square algorithms , 2005, Appl. Math. Comput..

[45]  Swagatam Das,et al.  Designing Fractional-order PI , 2009, World Congress on Nature and Biologically Inspired Computing.