ON THE CONVERGENCE OF THRESHOLD ACCEPTING

被引:53
作者
ALTHOFER, I
KOSCHNICK, KU
机构
[1] Fakultät für Mathematik, Universität Bielefeld, Bielefeld 1, W-4800
关键词
D O I
10.1007/BF01447741
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Simulated Annealing (SA) has become a very popular tool in combinatorial optimization since its introduction in 1982. Recently Dueck and Scheuer proposed another simple modification of local search which they called "Threshold Accepting" (TA). In this paper some convergence results for TA are presented. The proofs are not constructive and make use of the fact that in a certain sense "SA belongs to the convex hull of TA".
引用
收藏
页码:183 / 195
页数:13
相关论文
共 9 条
[1]   THRESHOLD ACCEPTING - A GENERAL-PURPOSE OPTIMIZATION ALGORITHM APPEARING SUPERIOR TO SIMULATED ANNEALING [J].
DUECK, G ;
SCHEUER, T .
JOURNAL OF COMPUTATIONAL PHYSICS, 1990, 90 (01) :161-175
[2]  
Erdos P., 1974, PROBABILISTIC METHOD
[3]  
GELFAND SB, 1985, LIDSP1495 TECHN REP
[4]  
GELFAND SB, 1985, 24TH P C DEC CONTR F, P779
[5]  
GROTSCHEL M, 1984, 38 U AUGSB PREPR
[6]   SIMULATED ANNEALING - TO COOL OR NOT [J].
HAJEK, B ;
SASAKI, G .
SYSTEMS & CONTROL LETTERS, 1989, 12 (05) :443-447
[7]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[8]  
KIRKPATRICK S, 1982, IBM RC9355 RES REP
[9]  
Laarhoven Van PJM, 1987, SIMULATED ANNEALING