(distanceMatrix, individual, recursive)

(distance_matrix, stm_and_ltm, city_list)

(distanceMatrix, populationSize, rng, localSearch = true)

(distanceMatrix, tour, options = {})

(qRow, unvisitedSet)

(nodes, pairs, sav)

(alphaCands, nearestCands, candidateSize, distanceMatrix)

(distanceMatrix, i)

(distanceMatrix, i)

(x, y, size)

(weight, nodes)

(distanceMatrix, candidate, rng)

(distanceMatrix, individual, mutationSearch, rng)

(distance_matrix, candidate)

(population, mutants, min_values, max_values)

(distance_matrix, offspring, mutation_rate, mutation_search, elite)

(distance_matrix, individual, mutation_search)

(distanceMatrix, candidateSize)

(distanceMatrix)

(distanceMatrix, start = 0)

(memory, pairs, A, B, route)

(result)

(s)

(dm, route, params)

(parentA, parentB, rng)

(filename, text)

(text)

(a, b, distance_matrix)

(arr, start)

(distanceMatrix, tour, rng)

(distance_matrix, city_tour)

()

(weights, sum, rng)

(distanceMatrix, route, localSearch = true)

(route0, n, rng)

(n, rng)

(n, rng)

(n, rng = Math.random)

(city_tour, neighborhood_size)

(distanceMatrix, rng, restrictedCandidateList = 3)

(distance_matrix, city = 0, tau = 1.8)

(distanceMatrix, city, tau)

(distanceMatrix, city)

(n, edgeSet, start)

(adj, distanceMatrix, nearCities)

(q_table_a, q_table_b, distance_matrix, num_cities)

()

(M, n)

(matrix)

(distanceMatrix, partial, removed)

(new_tour, to_insert, distance_matrix)

()

(G, target)

(G, target)

(distance_matrix, greediness_value = 0.5)

(rank, cityTour, tau, rng)

(rank, city_tour, tau = 1.8)

(adj, start = 0)

(self, start = None)

(chain, chain_set, C_X, C_Y, level)

(chain, chainSet, CX, CY, level)

(distance_matrix)

(distance_matrix)

(distance_matrix)

(p1, p2, p3, p4)

(n)

(n, search)

(n, search)

(n)

(n)

(n, search)

(n)

(n, search)

(n)

(n, search)

(state, i, t, rng)

(suffix_values, visited_rows, visited_cols)

(ms)

()

(distance)

(x, y, size)

(G)

(G)

(distanceMatrix, tour)

(L, num_vecs = 3, tol = 1e-6, maxiter = 5000)

(distanceMatrix, tour, rng)

(distanceMatrix, tour, rng)

(distanceMatrix, tour, rng)

(distance_matrix, city_tour)

(distance_matrix, city_tour)

(distanceMatrix, root, ascentIterations)

(G, vertices)

(G, vertices)

(M, n)

(route, rng)

(k_points, point_1, point_0)

(distanceMatrix)

(distance_matrix, stm_and_ltm, city_list, best_distance, tabu_list, tabu_tenure = 20, diversify = False)

(state)

(self, start = None)