An approximate annealing search algorithm to global optimization and its connection to stochastic approximation

Proceedings - Winter Simulation Conference

Volumn , Issue , 2010, Pages 1223-1234

  Hu, Jiaqiao ^a   Hu, Ping ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SEARCH; BOLTZMANN DISTRIBUTION; CANDIDATE SOLUTION; FEASIBLE REGIONS; GLOBAL CONVERGENCE; MODEL-BASED; NUMERICAL RESULTS; OPTIMIZATION PROBLEMS; PRACTICAL PROBLEMS; RANDOM SEARCHES; SEARCH ALGORITHMS; STOCHASTIC APPROXIMATION METHODS; STOCHASTIC APPROXIMATIONS;

ANNEALING; APPROXIMATION THEORY; BOLTZMANN EQUATION; CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION; ITERATIVE METHODS; OPTIMIZATION; STOCHASTIC SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 79951643127     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2010.5679070     Document Type: Conference Paper

References (19)

1. Dorigo, M., and L. M. Gambardella. 1997. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1:53-66.
2. Evans, S. N., and N. C. Weber. 1986. On the almost sure convergence of a general stochastic approximation procedure. Bulletin of the Australian Mathematical Society 34:335-342.
3. Fabian, V. 1968. On asymptotic normality in stochastic approximation. The Annals of Mathematical Statistics 39:1327-1332.
4. Glover, F. W. 1990. Tabu search: a tutorial. Interfaces 20:74-94.
5. Goldberg, D. E. 1989. Genetic algorithms in search, optimization, and machine learning. Boston, MA: Academic Publishers.
6. Hu, J., M. C. Fu, and S. I. Marcus. 2007. A model reference adaptive search algorithm for global optimization. Operations Research 55:549-568.
7. Hu, J., and P. Hu. 2010. Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization. working paper.
8. Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220:671-680.
9. Kushner, H. J., and G. G. Yin. 1997. Stochastic approximation algorithms and applications. New York, NY: Springer-Verlag.
10. Larranaga, P., and J. A. Lozano. 2002. Estimation of distribution algorithms: a newtool for evolutionary computation. Boston, MA: Kluwer Academic Publishers.
11. Morris, C. N. 1982. Natural exponential families with quadratic variance functions. Annals of Statistics 10:65-80.
12. Robbins, H., and S. Monro. 1951. A stochastic approximation method. Annals of Mathematical Statistics 22:400-407.
13. Romeijn, H. E., and R. L. Smith. 1994a. Simulated annealing and adaptive search in global optimization. Probability in the Engineering and Informational Sciences 8:571-590.
14. Romeijn, H. E., and R. L. Smith. 1994b. Simulated annealing for constrained global optimization. Journal of Global Optimization 5:101-126.
15. Rubinstein, R. Y., and D. P. Kroese. 2004. The cross-entropy method: A unified approach to combinatorial optimization, monte-carlo simulation, and machine learning. New York, NY: Springer.
16. Shi, L., and S. Ólafsson. 2000. Nested partitions method for global optimization. Operations Research 48:390-407. (Pubitemid 32415966)
17. Spall, J. C. 2003. Introduction to stochastic search and optimization. Hoboken, NJ: John Wiley & Sons.
18. Zabinksy, Z. B. 2003. Stochastic adaptive search for global optimization. Norwell, MA: Kluwer Academic Publishers.
19. Zabinsky, Z. B., and R. L. Smith. 1992. Pure adaptive search in global optimization. Mathematical Programming 53:323-338.