Timeline for Do better construction heuristics increase the performance of improvement heuristics?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2021 at 10:48 | comment | added | YcK | NFL is the part of the explanation which refers that 2-opt heuristic cannot achieve the optimal solution for each kind of TSP, also does not give the guarantee that " better initial solution always a better final solution" for all TSP instances, the algorithm can have stagnation or can convergence to the same point with or without 2-opt for one of the TSP instances. | |
| Sep 22, 2021 at 10:37 | comment | added | maxmitz | The No Free Luch theorem holds for every kind of optimisation problem. I asked especially for the TSP. The TSP is one specific optimisation algorithm. I think at this point the argument is not conclusive. | |
| Sep 22, 2021 at 8:56 | history | answered | YcK | CC BY-SA 4.0 |