A note on hashing functions and tabu search algorithms

被引:24
作者
Carlton, WB [1 ]
Barnes, JW [1 ]
机构
[1] UNIV TEXAS,DEPT MECH ENGN,AUSTIN,TX 78712
关键词
D O I
10.1016/0377-2217(95)00249-9
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Woodruff and Zemel present four effective functions that can be used for hashing within tabu search algorithms. However, the authors overlook one property that may affect the performance of algorithms that use the proposed functions. This paper clarifies the effects that the ''birthday paradox'' may have on algorithms using these functions.
引用
收藏
页码:237 / 239
页数:3
相关论文
共 4 条
[1]  
Battiti R., 1994, ORSA Journal on Computing, V6, P126, DOI 10.1287/ijoc.6.2.126
[2]  
CARLTON WB, 1995, TABU SEARCH APPROACH
[3]  
Knuth D. E., 1973, The Art of Computer Programming Volume 3, Sorting and Searching, VIII
[4]   A SIMPLE-MODEL FOR OPTIMIZING ROTATIONAL GRAZING [J].
WOODWARD, SJR ;
WAKE, GC ;
PLEASANTS, AB ;
MCCALL, DG .
AGRICULTURAL SYSTEMS, 1993, 41 (02) :123-155