The Dynamics of Evolution Strategies in the Optimization of Traveling Salesman Problems

An analysis of the dynamic behavior of Evolution Strategies applied to Traveling Salesman Problems is presented. For a special class of Traveling Salesman Problems a stochastic model of the optimization process is introduced. Based on this model different features determining the optimization process of Evolution Strategies are analyzed.

[1]  P. Stadler,et al.  The landscape of the traveling salesman problem , 1992 .

[2]  Pedersen,et al.  Monte Carlo dynamics of optimization problems: A scaling description. , 1990, Physical review. A, Atomic, molecular, and optical physics.

[3]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

[5]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: The (, )-Theory , 1994, Evolutionary Computation.

[6]  Michael Herdy,et al.  Application of the 'Evolutionsstrategie' to Discrete Optimization Problems , 1990, PPSN.

[7]  N. L. Johnson,et al.  Continuous Univariate Distributions. , 1995 .

[8]  David B. Fogel,et al.  Meta-evolutionary programming , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.

[9]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[10]  L. Darrell Whitley,et al.  Advanced Correlation Analysis of Operators for the Traveling Salesman Problem , 1994, PPSN.

[11]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: Some Asymptotical Results from the (1,+ )-Theory , 1993, Evolutionary Computation.

[12]  D. Fogel.  Applying evolutionary programming to selected traveling salesman problems , 1993 .

[13]  Karl Heinz Hoffmann,et al.  Adaptive schedules for ensemble-based thereshold accepting , 1999 .

[14]  Peter F. Stadler,et al.  Towards a theory of landscapes , 1995 .

[15]  BeyerHans-Georg.  Toward a theory of evolution strategies , 1993 .

[16]  J. Michael Steele,et al.  Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization , 1989, SIAM J. Comput..

[17]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: On the Benefits of Sex the (/, ) Theory , 1995, Evolutionary Computation.

[18]  H. Beyer.  An alternative explanation for the manner in which genetic algorithms operate. , 1997, Bio Systems.

[19]  Keith E. Mathias,et al.  Genetic Operators, the Tness Landscape and the Traveling Salesman Problem , 1992 .

[20]  Hans-Georg Beyer,et al.  Some Aspects of the 'Evolution Strategiy' for Solving TSP-Like Optimization Problems Appearing at the Design Studies of a 0.5 TeV e+e--Linear Collider , 1992, Parallel Problem Solving from Nature.

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[23]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .