Local optimum of the permutation-based chromosomes is defined, and a hill-climbingalgorithm is proposed to get the local optimum.
定义了基于排列的染色体的局部极值,并以此为基础构造了求极值的爬山算法。
2
Iterative TFIDF algorithm belongs to hill-climbingalgorithm, it has the common problem of converging to local optimal value and sensitive to initial point.
迭代tfidf算法属于爬山算法,初始值的选取对精度影响较大,算法容易收敛到局部最优值。
3
By flexibly adjusting grid workload, the algorithm of random multi-start hillclimbing is evaluated comprehensively.