search

kamil271e / double-tsp

Assorted heuristics for solving a modified Traveling Salesperson Problem (TSP) combinatorial challenge.
0 stars 0 forks source link

Multiple start local search #34

Closed unbreaking-V closed 3 months ago

unbreaking-V commented 4 months ago

Local search from various random or randomized starting points. You can create random solutions, or use the randomized heuristics from previous classes.

Pseudo code:

Repeat
    Generate a randomized starting solution x
    Local search (x)
Until stop conditions are met
Return the best solution found
unbreaking-V commented 4 months ago

The code does not work correctly because the end cycles contain duplicates. Where do they come from ? Good question, doesn't seem to be known yet.