Simulated annealing algorithm with adaptive neighborhood

Applied Soft Computing Journal

Volumn 11, Issue 2, 2011, Pages 1827-1836

  Xinchao, Zhao ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Adaptive neighborhood; Gaussian mutation; Global optimization; Non uniform mutation; Simulated annealing

Indexed keywords

ADAPTIVE NEIGHBORHOOD; ANALYSIS AND SIMULATION; EXCELLENT PERFORMANCE; GAUSSIAN MUTATION; GLOBAL OPTIMUM; INITIAL CONFIGURATION; INITIAL STAGES; LARGE NEIGHBORHOOD; NEIGHBORHOOD SIZE; NEW SOLUTIONS; NON-UNIFORM MUTATION; NUMERICAL EXPERIMENTS; SA ALGORITHM; SEARCH SPACES; SIMULATED ANNEALING ALGORITHMS; STEP SIZE;

ADAPTIVE ALGORITHMS; EXPERIMENTS; GLOBAL OPTIMIZATION; MULTIOBJECTIVE OPTIMIZATION; PROBABILITY; SEARCH ENGINES;

SIMULATED ANNEALING;

EID: 78751613509     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2010.05.029     Document Type: Conference Paper

References (27)

1. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
2. V. Cerny A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm J. Optimization Theory Appl. 45 1985 41 51
3. S. Geman, and D. Geman Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images IEEE Trans. Pattern Anal. Mach. Intell. 6 1984 721 741
4. L Ingber Simulated annealing: practice versus theory J. Math. Comput. Model. 18 11 1993 29 57
5. M.E. Aydin, and T.C. Fogarty A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems J. Heuristics 10 2004 269 292
6. C.Y. Low Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines Comput. Operations Res. 32 2005 2013 2025
7. E.K. Burke, A. Eckersley, and B. McCollum Using simulated annealing to study behaviour of various exam timetabling data sets Proceedings of the Fifth Metaheuristics International Conference (MIC 2003) Kyoto, Japan, August 2003
8. J.M. Framinana, and C. Schusterb An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach Comput. Operations Res. 331 2006 1200 1213
9. S. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling salesman problem Operations Res. 21 2 1973 498 516
10. S. Salcedo-Sanz, R. Santiago-Mozos, and C. Bousono-Calzon A hybrid hopfield network-simulated annealing approach for frequency assignment in satellite communications systems IEEE Trans. Syst. Man Cybernet. Part B: Cybernet. 34 2 2004 1108 1116
11. C.-H. Paik, and S. Soni A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks Eur. J. Operational Res. 178 2007 579 594
12. M. Locatelli Convergence of a simulated annealing algorithm for continuous global optimization J. Global Optimization 18 2000 219 234
13. H.H. Szu, and R.L. Hartley Fast simulated annealing Phys. Lett. A 122 1987 157 162
14. L. Ingber Very fast simulated reannealing Math. Comput. Model. 12 8 1989 967 973
15. X. Yao A new simulated annealing algorithm Int. J. Comput. Math. 56 1995 161 168
16. L. Ingber Adaptive simulated annealing (ASA): lessons learned Pol. J. Control Cybernet. 25 1 1996 33 54
17. O. Cordon, F. Moya, and C. Zarco A new evolutionary algorithm combining simulated annealing and genetic programming for relevance feedback in fuzzy information retrieval systems Soft Comput. 6 2002 308 319
18. G. Pajares, and J.M. Cruz On combining support vector machines and simulated annealing in stereovision matching IEEE Trans. Syst. Man Cybernet. Part B: Cybernet. 34 4 2004 1646 1657
19. M. Lavielle, and E. Moulines A simulated annealing version of the EM algorithm for non-Gaussian deconvolution Stat. Comput. 7 1997 229 236
20. L. Wang, and L. Zhang Stochastic optimization using simulated annealing with hypothesis test Appl. Math. Comput. 174 2006 1329 1342
21. A. Bevilacqua A methodological approach to parallel simulated annealing on an SMP system J. Parallel Distributed Comput. 62 10 2002 1548 1570
22. Z. Michalewicz Genetic Algorithms + Data Structures = Evolution Programs 3rd ed. 1996 Springer
23. X.C. Zhao, X.-S. Gao, and Z.-C. Hu Evolutionary programming based on non-uniform mutation Appl. Math. Comput. 192 2007 1 11
24. X. Yao, Y. Liu, and G.M. Lin Evolutionary programming made faster IEEE Trans. Evol. Comput. 3 2 1999 82 102
25. X. Yao, and Y. Liu Fast evolution strategies Control Cybernet. 26 3 1997 467 496
26. D.H. Wolpert, and W.G. Macready No free lunch theorems for optimization IEEE Trans. Evol. Comput. 1 1997 67 82
27. L.S. Kang, Y. Xie, S.Y. You, and Z.H. Luo Nonnumerical Parallel Algorithm: Simulated Annealing Algorithm 2000 Science Press Beijing (in Chinese)