(distanceMatrix, tour)

(seed)

(state, src, dst)

(state, src, dst)

(route0)

(distanceMatrix, rng = Math.random)

(distance_matrix, route0)

(seed)

(rng, maxExclusive)

(state, v)

(state, v)

(msg, kind = '')

(distanceMatrix, tour)

(route0)

(kind, text)

(name, fallback)

(x)

(state, v)

(state, v)

(route_0)

(route0)

(route)

(status, extra)

(u, distance_matrix)

(distance_matrix, city_tour)

(distance_matrix, city_tour)

(msg, kind = 'info')

(route)

(arr, i, j)

(distanceMatrix, route0)

(distanceMatrix, params, label = 'k-opt')

(coords, info = {})

(state, v)

(state, v)

(candidates, candidate_size, distance_matrix = None)

()

(individual, distanceMatrix)

()

(distance_matrix, city_tour)

(distance_matrix, city_tour)

(seed)

(bits, k)

(distance_matrix, city_tour, recursive_seeding = -1, verbose = True)

(arr, rng = Math.random)

(route)

(state, a, b)

(i, j)

(distance_matrix, path, max_neighbors, trials_param, rng)

(state, v)

(route_0)

(route_1)

(distance_matrix, route_0)

(route0)

(route)

()

(o, a, b)

(individual, distance_matrix, cost_only = False)

(distance_matrix, city_tour)

(distance_matrix, city_tour)

(a, b)

(i, j)

(self, node)

(state, a, b)

(c1, c2)

(distance_matrix, i)

(distanceMatrix, path, maxNeighbors, trialsParam, rng)

(a, b)

(key)

()

()

(state, v)

(distanceMatrix, route0)

()

(dm, route0)

(route_0)

(population, rng)

()

(parent_a, parent_b, distance_matrix, near_cities, rng)

(distance_matrix, candidate_size = 20)

(route)

(route0)

(start_time, time_limit)

(population, elite, closest)

(route0)

(distance_matrix, city_tour, penalty, limit)

(population, rng)