Optimal anytime constrained simulated annealing for constrained global optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1894, Issue , 2000, Pages 425-440

  Wah, Benjamin W ^a   Chen, Yi Xin ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; COOLING; EXPONENTIAL FUNCTIONS; GENETIC ALGORITHMS; ITERATIVE METHODS; SIMULATED ANNEALING; STOCHASTIC SYSTEMS;

CONSTRAINED GLOBAL OPTIMIZATION; CONSTRAINED NONLINEAR PROGRAMMING PROBLEM; COOLING SCHEDULE; FEASIBLE SOLUTION; ITERATIVE DEEPENING; NON-DECREASING FUNCTIONS; OPTIMAL SCHEDULE; STOCHASTIC SEARCH ALGORITHMS;

GLOBAL OPTIMIZATION;

EID: 84945957009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45349-0_31     Document Type: Conference Paper

References (17)

1. E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. J. Wiley and Sons, 1989.
2. E. H. L. Aarts. A new polynomial-time cooling schedule. Proc. of the IEEE Int. Conf. on CAD-85, pages 206-208, 1985.
3. J. Bernasconi. Low autocorrelation binary sequences: Statistical mechanics and configuration space analysis. J. Physique, 48(4): 559-567, 1987.
4. M. F. Cardoso, R. L. Salcedo, and S. F. de Azevedo. Non-equilibrium simulated annealing: A faster approach to combinatorial minimization. Industrial Eng. Chemical Research, 33: 1908-1918, 1994.
5. C. A. Floudas and P. M. Pardalos. A Collection of Test Problems for Constrained Global Optimization Algorithms, volume 455 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
6. B. Hajek. Cooling schedules for optimal annealing. Mathematics of Operations Research, 13(2): 311-329, 1988.
7. L. Ingber and N. Rosen. Genetic algorithms and very fast simulated re-annealing: A comparison. J. Math. Comput. Modelling, 16: 87-100, 1992.
8. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598): 671-680, May 1983.
9. R. Korf. Heuristics as invariants and its application to learning. Machine Learning, pages 100-103, 1985.
10. Z. Michalewicz and M. Schoenauer. Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation, 4(1): 1-32, 1996.
11. C. N. Potts and L. N. V. Wassenhove. Single machine tardiness sequencing heuristics. IIE Transactions, 23: 346-354, 1991.
12. S. Rees and B. C. Ball. Citeria for an optimal simulated annealing schedule for problems of the traveling salesman type. J. Physics, 20(5): 1239-1249, 1987.
13. H. Szu and R. Hartley. Fast simulated annealing. Phys. Lett. A, 122(3-4): 157-162, 1987.
14. B. W. Wah and T. Wang. Simulated annealing with asymptotic convergence for nonlinear constrained global optimization. Principles and Practice of Constraint Programming, pages 461-475, Oct. 1999.
15. B. W. Wah and Z. Wu. The theory of discrete Lagrange multipliers for nonlinear discrete optimization. Principles and Practice of Constraint Programming, pages 28-42, Oct. 1999.
16. Y. Wang, W. Yan, and G. Zhang. Adaptive simulated annealing for optimal design of electromagnetic devices. IEEE Trans. on Magnetics, 32(3): 1214-1217, 1996.
17. Z. Wu. The Theory and Applications of Nonlinear Constrained Optimization using Lagrange Multipliers. Ph.D. Thesis, Dept. of Computer Science, Univ. of Illinois, Urbana, IL, Aug. 2000.