An asymptotical study of combinatorial optimization problems by means of statistical mechanics

The analogy between combinatorial optimization and statistical mechanics has proven to be a fruitful object of study. Simulated annealing, a metaheuristic for combinatorial optimization problems, is based on this analogy. In this paper we show how a statistical mechanics formalism can be utilized to analyze the asymptotic behavior of combinatorial optimization problems with sum objective function and provide an alternative proof for the following result: Under a certain combinatorial condition and some natural probabilistic assumptions on the coefficients of the problem, the ratio between the optimal solution and an arbitrary feasible solution tends to one almost surely, as the size of the problem tends to infinity, so that the problem of optimization becomes trivial in some sense. Whereas this result can also be proven by purely probabilistic techniques, the above approach allows one to understand why the assumed combinatorial condition is essential for such a type of asymptotic behavior.

[1]  Jean-Luc Lutton,et al.  The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach , 1986 .

[2]  Wojciech Szpankowski,et al.  Combinatorial optimization problems for which almost every algorithm is asymptotically optimal , 1995 .

[3]  W. Rudin.  Real and complex analysis, 3rd ed. , 1987 .

[4]  D. Aldous.  The ζ(2) limit in the random assignment problem , 2000, Random Struct. Algorithms.

[5]  M. Mézard,et al.  On the solution of the random link matching problems , 1987 .

[6]  W. Rudin.  Real and complex analysis , 1968 .

[7]  Rainer E. Burkard,et al.  Probabilistic asymptotic properties of some combinatorial optimization problems , 1985, Discret. Appl. Math..

[8]  Rainer E. Burkard,et al.  On random quadratic bottleneck assignment problems , 1982, Math. Program..

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

[10]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[11]  Alexander H. G. Rinnooy Kan,et al.  Asymptotic Properties of the Quadratic Assignment Problem , 1985, Math. Oper. Res..

[12]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[13]  R. Karp.  An Upper Bound on the Expected Cost of an Optimal Assignment , 1987 .

[14]  Rainer E. Burkard,et al.  The asymptotic probabilistic behaviour of quadratic sum assignment problems , 1983, Z. Oper. Research.

[15]  Wansoo T. Rhee.  A note on asymptotic properties of the quadratic assignment problem , 1988 .

[16]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

[17]  Wansoo T. Rhee.  Stochastic Analysis of the Quadratic Assignment Problem , 1991, Math. Oper. Res..

[18]  Ehl Emile Aarts,et al.  Simulated annealing and Boltzmann machines , 2003 .

[19]  F Munger.  Adaptable Time Switch. , 1954, Science.

[20]  W. Donath.  Algorithm and average-value bounds for assignment problems , 1969 .

[21]  Hansjörg Albrecher.  A note on the asymptotic behaviour of bottleneck problems , 2005, Oper. Res. Lett..

[22]  Don Coppersmith,et al.  Constructive Bounds and Exact Expectations for the Random Assignment Problem , 1998, RANDOM.

[23]  D. Coppersmith,et al.  Constructive bounds and exact expectation for the random assignment problem , 1999 .