Stopping and restarting strategy for stochastic sequential search in global optimization

Journal of Global Optimization

Volumn 46, Issue 2, 2010, Pages 273-286

  Zabinsky, Zelda B ^a   Bulger, David ^b   Khompatraporn, Charoenchai ^c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b MACQUARIE UNIVERSITY   (Australia)

^c KING MONGKUT'S UNIVERSITY OF TECHNOLOGY THONBURI   (Thailand)

Author keywords

Pure adaptive search; Sequential search; Stopping criteria

Indexed keywords

ADAPTIVE SEARCH; COMPUTATIONAL EFFORT; GLOBAL OPTIMUM; LOCAL SEARCH HEURISTICS; MULTISTART; POWER-LAW; SEQUENTIAL SEARCH; STOCHASTIC GLOBAL OPTIMIZATION; STOCHASTIC OPTIMIZATION ALGORITHM; STOCHASTIC PROCESS; STOPPING CRITERIA; TEST PROBLEM;

GLOBAL OPTIMIZATION; HEURISTIC ALGORITHMS; RANDOM PROCESSES; SIPHONS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

SIMULATED ANNEALING;

EID: 77949261611     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-009-9425-z     Document Type: Article

References (25)

1. Abramowitz M., Stegun I.: Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables. Dover, New York (1964)
2. M.M. Ali C. Khompatraporn Z.B. Zabinsky 2005 A numerical evaluation of several global optimization algorithms on selected benchmark test problems J. Glob. Optim. 31 635 672 10.1007/s10898-004-9972-2 (Pubitemid 40963404)
3. A. Atkinson 1992 A segmented algorithm for simulated annealing Stat. Comput. 2 221 230 10.1007/BF01889682
4. B. Betrò F. Schoen 1987 Sequential stopping rules for the multistart algorithm in global optimisation Math. Program. 38 271 286 10.1007/BF02592015
5. C. Boender A. Rinnooy Kan 1987 Bayesian stopping rules for multistart global optimization methods Math. Program. 37 59 80 10.1007/BF02591684
6. Boender C.G.E., Romeijn H.E.: Stochastic methods. In: Horst, R., Pardalos, P. (eds) Handbook of Global Optimization, pp. 829-869. Kluwer, The Netherlands (1995)
7. D.W. Bulger G.R. Wood 1998 Hesitant adaptive search for global optimisation Math. Program. 81 89 102
8. A. Dekkers E. Aarts 1991 Global optimization and simulated annealing Math. Program. 50 367 393 10.1007/BF01594945
9. M. Dür C. Khompatraporn Z.B. Zabinsky 2007 Solving fractional problems with dynamic multistart improving Hit-and-Run Ann. Oper. Res. 156 25 44 10.1007/s10479-007-0232-y
10. Glidewell, M., Ng, K., Hensel, E.: A combinatorial optimization approach as a pre-processor for impedance tomography. In: Proceedings of the Annual Conference of the IEEE/Engineering in Medicine and Biology Society, pp. 1-2 (1991)
11. B. Hajek 1988 Cooling schedules for optimal annealing Math. Oper. Res. 18 311 329 10.1287/moor.13.2.311
12. Khompatraporn, C.: Analysis and Development of Stopping Criteria for Stochastic Global Optimization Algorithms. Ph.D. Dissertation, University of Washington, Washington (2004)
13. Li, H., Lim, A.: A Metaheuristic for the Pickup and Delivery Problem with Time Windows. In: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence, pp. 160-167 (2001) (Pubitemid 34658736)
14. M. Locatelli 2000 Convergence of a simulated annealing algorithm for continuous global optimization J. Glob. Optim. 18 219 234 10.1023/A: 1008339019740
15. M. Lundy A. Mees 1986 Convergence of an annealing algorithm Math. Program. 34 111 124 10.1007/BF01582166
16. M. Muselli 1997 A theoretical approach to restart in global optimization J. Glob. Optim. 10 1 16 10.1023/A:1008238928345
17. H.E. Romeijn R.L. Smith 1994 Simulated annealing and adaptive search in global optimization Probab. Eng. Inf. Sci. 8 571 590 10.1017/S0269964800003624
18. N. Treadgold T. Gedeon 1998 Simulated annealing and weight decay in adaptive learning: the SARPROP algorithm IEEE Trans. Neural Netw. 9 662 668 10.1109/72.701179
19. Theodosopoulos T.V.: Some remarks on the optimal level of randomization in global optimization. In: Pardalos, P., Rajasekaran, S., Rolim, J. (eds) Randomization Methods in Algorithm Design, DIMACS Series 43., pp. 303-318. American Mathematical Society, RI (1999)
20. D.J. Wales J.P.K. Doye 1997 Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms J. Phys. Chem. A 101 5111 5116 10.1021/jp970984n
21. G.R. Wood Z.B. Zabinsky B.P. Kristinsdóttir 2001 Hesitant adaptive search: the distribution of the number of iterations to convergence Math. Program. A 89 479 486 10.1007/PL00011410
22. Zabinsky Z.B.: Stochastic Adaptive Search for Global Optimization. Kluwer, The Netherlands (2003)
23. Z.B. Zabinsky R.L. Smith 1992 Pure adaptive search in global optimization Math. Program. 53 323 338 10.1007/BF01585710
24. Z.B. Zabinsky R.L. Smith J.F. McDonald H.E. Romeijn D.E. Kaufman 1993 Improving Hit-and-Run for global optimization J. Glob. Optim. 3 171 192 10.1007/BF01096737
25. R. Zielinski 1981 A statistical estimate of the structure of multiextremal problems Math. Program. 21 348 356 10.1007/BF01584254