General local search methods

被引:152
作者
Pirlot, M
机构
[1] Faculté Polytechnique de Mons, B-7000 Mons
关键词
combinatorial optimization; heuristic search; local search; Simulated Annealing; Tabu Search; Genetic Algorithms; metaheuristics;
D O I
10.1016/0377-2217(96)00007-0
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper is a tutorial introduction to three recent yet widely used general heuristics: Simulated Annealing, Tabu Search, and Genetic Algorithms. A relatively precise description and an example of application are provided for each of the methods, as well as a tentative evaluation and comparison from a pragmatic point of view.
引用
收藏
页码:493 / 511
页数:19
相关论文
共 54 条
[1]  
[Anonymous], 1986, C NUM METH COMB OPT
[2]  
Azencott R., 1992, SIMULATED ANNEALING
[3]  
Belew R., 1991, P 4 INT C GEN ALG SA
[5]   SOME EXPERIMENTS WITH SIMULATED ANNEALING FOR COLORING GRAPHS [J].
CHAMS, M ;
HERTZ, A ;
DEWERRA, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 32 (02) :260-266
[6]  
CHARONI, 1993, 93D003 TELECOM
[7]  
COLLINS NE, 1988, 88019 U MAR COLL BUS
[8]  
Colorni A., 1994, JORBEL BELGIAN J OPE, V34, P39
[9]  
De Jong K.A., 1975, ANAL BEHAV CLASS GEN
[10]  
DEJONG KA, 1992, PARALLEL PROBLEM SOLVING FROM NATURE, 2, P3