Swarm, Evolutionary, and Memetic Computing

In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy (IG) algorithm is mainly based on the central procedures of destruction and construction. The basic idea behind it is to remove some solution components from a current solution and reconstruct them in the partial solution to obtain the complete solution again. In this paper, we apply this idea in a populated manner (IGP) to the traveling salesman problem (TSP). Since the destruction and construction procedure is computationally expensive, we also propose an iteration jumping to an Inver-Over operator during the search process. We applied the proposed algorithm to the well-known 14 TSP instances from TSPLIB. The computational results show that the proposed algorithm is very competitive to the recent best performing algorithms from the literature.

[1]  Cheng-Fa Tsai,et al.  A new hybrid heuristic approach for solving large traveling salesman problem , 2004, Inf. Sci..

[2]  Andries Petrus Engelbrecht,et al.  Differential evolution methods for unsupervised image classification , 2005, 2005 IEEE Congress on Evolutionary Computation.

[3]  H. B. Mann,et al.  On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other , 1947 .

[4]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[5]  Harish Sharma,et al.  Fitness based Differential Evolution , 2012, Memetic Computing.

[6]  Byung-Ro Moon,et al.  Voronoi quantized crossover for traveling salesman problem , 2002 .

[7]  M.M.A. Salama,et al.  Opposition-Based Differential Evolution , 2008, IEEE Transactions on Evolutionary Computation.

[8]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[9]  Amit Konar,et al.  Two-Dimensional IIR Filter Design with Modern Search Heuristics: a Comparative Study , 2006, Int. J. Comput. Intell. Appl..

[10]  Jing J. Liang,et al.  Problem Deflnitions and Evaluation Criteria for the CEC 2006 Special Session on Constrained Real-Parameter Optimization , 2006 .

[11]  K. V. Arya,et al.  Opposition based lévy flight artificial bee colony , 2012, Memetic Computing.

[12]  R. Storn,et al.  Differential evolution a simple and efficient adaptive scheme for global optimization over continu , 1997 .

[13]  Ville Tirronen,et al.  Scale factor local search in differential evolution , 2009, Memetic Comput..

[14]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

[15]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[16]  Feng-Sheng Wang,et al.  Inverse problems of biological systems using multi-objective optimization , 2008 .

[17]  Ivan Zelinka,et al.  ON STAGNATION OF THE DIFFERENTIAL EVOLUTION ALGORITHM , 2000 .

[18]  R. W. Derksen,et al.  Differential Evolution in Aerodynamic Optimization , 1999 .

[19]  Fabrizio Russo,et al.  FIRE operators for image processing , 1999, Fuzzy Sets Syst..

[20]  K. V. Price,et al.  Differential evolution: a fast and simple numerical optimizer , 1996, Proceedings of North American Fuzzy Information Processing.

[21]  Jun-qing Li,et al.  Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem , 2011, Comput. Math. Appl..

[22]  F. Russo,et al.  Edge extraction by FIRE operators , 1994, Proceedings of 1994 IEEE 3rd International Fuzzy Systems Conference.

[23]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[24]  Arthur C. Sanderson,et al.  JADE: Adaptive Differential Evolution With Optional External Archive , 2009, IEEE Transactions on Evolutionary Computation.

[25]  Kuo-Ching Ying,et al.  Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic , 2010, Expert Syst. Appl..

[26]  A. Kai Qin,et al.  Self-adaptive differential evolution algorithm for numerical optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[27]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.

[28]  C. Chow,et al.  Automatic boundary detection of the left ventricle from cineangiograms. , 1972, Computers and biomedical research, an international journal.

[29]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[30]  Zbigniew Michalewicz,et al.  Inver-over Operator for the TSP , 1998, PPSN.

[31]  Zelda B. Zabinsky,et al.  A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems , 2005, J. Glob. Optim..

[32]  René Thomsen,et al.  A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[33]  Imma Ribas,et al.  An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .

[34]  Carlos A. Coello Coello,et al.  A comparative study of differential evolution variants for global optimization , 2006, GECCO.

[35]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[36]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[37]  Frank Hoeppner,et al.  Fuzzy shell clustering algorithms in image processing: fuzzy C-rectangular and 2-rectangular shells , 1997, IEEE Trans. Fuzzy Syst..

[38]  Godfrey C. Onwubolu,et al.  Optimizing CNC Drilling Machine Operations: Traveling Salesman Problem-Differential Evolution Approach , 2004 .

[39]  Jacob Cohen.  A Coefficient of Agreement for Nominal Scales , 1960 .

[40]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times , 2008, IEEE Congress on Evolutionary Computation.

[41]  Uday K. Chakraborty,et al.  Advances in Differential Evolution , 2010 .

[42]  Daniel J. Rosenkrantz,et al.  An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.

[43]  M. Gorges-Schleuter.  Asparagos96 and the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[44]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[45]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[46]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops , 2011, Inf. Sci..