Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control

The convergence of the simulated annealing algorithm is accelerated by a probabilistic feedback control scheme. This scheme uses two or more parallel processors to solve the same or related combinatorial optimization problems and are coupled by a probabilistic measure of quality (PMQ). The PMQ is used to generate an error signal for use in feedback control. Control over the search process is achieved by using the error signal to modulate the temperature parameter. Other aspects of control theory, such as the system gain and its effects on system performance, are described. Theoretical and experimental results show that such a scheme increases the steadystate probability of the globally optimal solutions.

[1]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[2]  Peter Salamon,et al.  An Ensemble Based Simulated Annealing Library for Multiprocessors , 1993 .

[3]  M. Fleischer,et al.  Assessing the performance of the simulated annealing algorithm using information theory , 1994 .

[4]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[5]  Norbert Wiener,et al.  Cybernetics, or control and communication in the animal and the machine, 2nd ed. , 1961 .

[6]  I. Peterson.  Team Sieving Cracks a Huge Number , 1994 .

[7]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[8]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[9]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[10]  Gerhardt von Bonin,et al.  Cybernetics or control and communication in the animal and the machine: Norbert wiener, 1948. 194 pp. New York: John Wiley & Sons, Inc. Paris: Hermann et cie , 1949 .

[11]  D. Mitra,et al.  Convergence and finite-time behavior of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.

[12]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[13]  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.

[14]  Robert Azencott,et al.  Simulated annealing : parallelization techniques , 1992 .

[15]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[16]  Sheldon Howard Jacobson,et al.  Cybernetic Optimization by Simulated Annealing: An Implementation of Parallel Processing Using Probabilistic Feedback Control , 1996 .

[17]  Emile H. L. Aarts,et al.  Parallel local search , 1995, J. Heuristics.

[18]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[19]  Fred W. Glover,et al.  Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..