Table 1: Four heuristic method feature comparison.

MethodNeighbor local search used?Random?
Trap escaping mechanismSearch speed

Simulated annealing (SA)Yes
Use with probability
Use random neighbor
YesRandomly jump with probability, controlled by cooling schedule. (Reach optima by chance)Fast
Genetic algorithm (GA)NoYes Use crossover, mutation with probability to jump out. (Reach optima by chance)Slow
Landscape smoothing search (LSS)Yes
Use best neighbor
No Use adaptive smoothing function. (Reach optima by best neighbor)Medium
Fast landscape smoothing search (FLSS) Yes
Use best neighbor
No Use adaptive smoothing function. (Reach optima by best neighbor)Fast