|
| Method | Neighbor local search used? | Random?
| Trap escaping mechanism | Search speed |
|
| Simulated annealing (SA) | Yes
Use with probability
Use random neighbor | Yes | Randomly jump with probability, controlled by cooling schedule. (Reach optima by chance) | Fast |
| Genetic algorithm (GA) | No | Yes |
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 |
|