I was reading this question on CS stack exchange called How important is initial state for local search optimisation?
I would like to extend it with the following example:
I have been reading about optimisation techniques and noticed that if a random initial state is provided to a genetic algorithm, it may still find a good enough solution. However, a simulated annealing algorithm may be stuck and never get out of really bad initial solution.
Does it mean these two are not comparable if a bad initial solution is provided? Are there any other algorithms that are not that sensitive to an initial solution?