You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A small app for creating the optimal roundtrip between up to 11 places. Uses Nearest-Neighbour-Algorithm to find upper bound and 2-Opt to optimize route. Written in February 2017 for a Code Competition sponsored by Hermes.
Solving the traveling salesman problem using the Gurobi Solver, the farthest insertion algorithm, the nearest neighbor algorithm and, finally, using the 2-opt optimization method.