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

Journal of Heuristics

Volumn 1, Issue 2, 1996, Pages 225-246

  Fleischer, Mark A ^a  

^a Old Dominion University   (United States)

Author keywords

Control theory; Cybernetics; Parallel processing; Simulated annealing

Indexed keywords

CONTROL THEORY; CONVERGENCE OF NUMERICAL METHODS; FEEDBACK CONTROL; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; SIMULATED ANNEALING;

PROBABILISTIC MEASURE OF QUALITY (PMQ);

CYBERNETICS;

EID: 0030092566     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00127079     Document Type: Article

References (20)

1. Aarts, E., and J. Korst. (1989). Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. New York: Wiley.
2. Azencott, R. (ed.). (1992). Simulated Annealing: Parallelization Techniques. New York: Wiley.
3. Bondy, J.A., and U.S.R. Murty. (1976). Graph Theory with Applications. New York: North-Holland, Elsevier Science.
4. Dowsland, K. (1993). "Simulated Annealing." In C. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems. New York: Wiley.
5. Eglese, R.W. (1990). "Simulated Annealing: A Tool for Operational Research." European Journal of Operational Research 46(3) (June 15), 271-281.
6. Fleischer, M. (1993). "Assessing the Performance of the Simulated Annealing Algorithm Using Information Theory." Doctoral dissertation, Case Western Reserve University.
7. Fleischer, M., and S.H. Jacobson. (1995). "Cybernetic Optimization by Simulated Annealing: An Implementation of Parallel Processing Using Probabilistic Feedback Control." In J. Kelly and I.H. Osman (eds.), Metaheuristics: The State of the Art 1995. Boston: Kluwer.
8. Frost, R., N. Priebe, and P. Salamon. (1993). "An Ensemble Based Simulated Annealing Library for Multiprocessors." Working paper.
9. Glover, F. (1977). "Heuristics for Integer Programming Using Surrogate Constraints." Decision Sciences 8(1), 156-166.
10. Glover, F. (1986). "Future Paths for Integer Programming and Links to Artificial Intelligence." Computers and Operations Research 13(5), 533-549.
11. Glover, F. (1995). "Tabu Thresholding: Improved Search by Non-Monotonic Trajectories." Informs Journal on Computing.
12. Goldie, C., and R. Pinch. (1991). Communication Theory. New York: Cambridge University Press.
13. Ingber, L. (1995). "Adaptive Simulated Annealing: Lessons Learned." Journal of Control and Cybernetics.
14. Manber, U. (1989). Introduction to Algorithms: A Creative Approach. New York: Addison-Wesley.
15. Metropolis, N., A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. (1953). "Equation of State Calculations by Fast Computing Machines." Journal of Chemical Physics 21, 1087-1092.
16. Mitra, D., F. Romeo, and A. Sangiovanni-Vincentelli. (1986). "Convergence and Finite-Time Behavior of Simulated Annealing." Advances in Applied Probability 18, 747-771.
17. Osman, I. (1993). "Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem." Annals of Operations Research 41, 421.
18. Peterson, I. (1994). "Team Sieving Cracks a Huge Number." Science News 145(19), 292.
19. Verhoeven, M.G.A., and E. Aarts. (1995). "Parallel Local Search." Journal of Heuristics 1.
20. Wiener, N. (1961). Cybernetics: or Control and Communication in the Animal and the Machine (2nd ed.). Cambridge, MA: MIT Press.