Discrete invasive weed optimization algorithm for traveling salesman problems

The paper proposes a discrete invasive weed optimization (DIWO) algorithm based on the application of this algorithm to the TSP, putting forward the global search strategy of the multidirectional permutation factor (MPF) and permutation sequence concept to generate offspring individuals, as well as to adjust the number of the permutation factors through nonlinear adaptive approach, thus it can effectively balance global exploration and local development; conducting local optimization to optimal individual, and obtaining better optimization results. The experimental data for measuring the algorithm performance, the DIWO algorithm can converge to the known optimal solution with small population scale and less iteration, and its efficiency is better than other traditional evolutionary algorithms.

[1]  Hamed Mojallali,et al.  Chaotic invasive weed optimization algorithm with application to parameter estimation of chaotic systems , 2012 .

[2]  Andrew U. Frank,et al.  Using a modified invasive weed optimization algorithm for a personalized urban multi-criteria path optimization problem , 2012, Int. J. Appl. Earth Obs. Geoinformation.

[3]  Ying Wang,et al.  Uncertain multiobjective traveling salesman problem , 2015, Eur. J. Oper. Res..

[4]  Kenli Li,et al.  An Efficient Hybrid Algorithm Based on HS and SFLA , 2016, Int. J. Pattern Recognit. Artif. Intell..

[5]  Fred W. Glover,et al.  Data structures and ejection chains for solving large-scale traveling salesman problems , 2005, Eur. J. Oper. Res..

[6]  Gilbert Laporte,et al.  Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..

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

[8]  Hiroshi Nozawa,et al.  A neural network model as a globally coupled map and applications based on chaos. , 1992, Chaos.

[9]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[10]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[11]  Swagatam Das,et al.  A differential invasive weed optimization algorithm for improved global numerical optimization , 2013, Appl. Math. Comput..

[12]  Xin-She Yang,et al.  An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems , 2016, Eng. Appl. Artif. Intell..

[13]  Jamshid Aghaei,et al.  Application of chaos-based chaotic invasive weed optimization techniques for environmental OPF problems in the power system , 2014 .

[14]  Korhan Karabulut,et al.  A variable iterated greedy algorithm for the traveling salesman problem with time windows , 2014, Inf. Sci..

[15]  Emile H. L. Aarts,et al.  A parallel 2-opt algorithm for the Traveling Salesman Problem , 1995, Future Gener. Comput. Syst..

[16]  T. Jayabarathi,et al.  Optimal placement and sizing of multiple distributed generating units in distribution networks by invasive weed optimization algorithm , 2016 .

[17]  AIJIA OUYANG,et al.  Estimating parameters of Muskingum Model using an Adaptive Hybrid PSO Algorithm , 2014, Int. J. Pattern Recognit. Artif. Intell..

[18]  Banu Soylu,et al.  A general variable neighborhood search heuristic for multiple traveling salesmen problem , 2015, Comput. Ind. Eng..

[19]  Halife Kodaz,et al.  A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem , 2015, Appl. Soft Comput..

[20]  Adam N. Letchford,et al.  Exploiting planarity in separation routines for the symmetric traveling salesman problem , 2008, Discret. Optim..

[21]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[22]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[23]  Yongquan Zhou,et al.  Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem , 2014, Neurocomputing.

[24]  Lipo Wang,et al.  Noisy chaotic neural networks for solving combinatorial optimization problems , 2000, Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium.

[25]  Mohammed Hawa,et al.  Invasive weed optimization for model order reduction of linear MIMO systems , 2013 .

[26]  Maheswarapu Sydulu,et al.  Multi-Objective Invasive Weed Optimization – An application to optimal network reconfiguration in radial distribution systems , 2015 .

[27]  Abraham P. Punnen,et al.  The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis , 2014, Comput. Oper. Res..

[28]  Ming-Yang Kao,et al.  An approximation algorithm for a bottleneck traveling salesman problem , 2009, J. Discrete Algorithms.

[29]  Xu Zhou,et al.  Parallel hybrid PSO with CUDA for lD heat conduction equation , 2015 .

[30]  Ya Wang,et al.  A parallel improved IWO algorithm on GPU for solving large scale global optimization problems , 2016, J. Intell. Fuzzy Syst..

[31]  Ajit Kumar Barisal,et al.  Large scale economic dispatch of power systems using oppositional invasive weed optimization , 2015, Appl. Soft Comput..

[32]  Imdat Kara,et al.  Formulations for Minimizing Tour Duration of the Traveling Salesman Problem with Time Windows , 2015 .

[33]  Lipo Wang,et al.  A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[34]  何苗,et al.  Two-Level Genetic Algorithm for Clustered Traveling Salesman Problem with Application in Large-Scale TSPs , 2007 .

[35]  Aimin Zhou,et al.  A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems , 2013, Comput. Math. Appl..

[36]  Kenli Li,et al.  Hybrid particle swarm optimization for parameter estimation of Muskingum model , 2014, Neural Computing and Applications.

[37]  Xu Zhou,et al.  A Novel Hybrid Multi-Objective Population Migration Algorithm , 2015, Int. J. Pattern Recognit. Artif. Intell..