threshold_accepting_tsp(G, init_cycle, weight='weight', source=None, threshold=1, move='1-1', max_iterations=10, N_inner=100, alpha=0.1, seed=None)
This function uses threshold accepting methods to approximate the minimal cost cycle through the nodes. Starting from a suboptimal solution, threshold accepting methods perturb that solution, accepting any changes that make the solution no worse than increasing by a threshold amount. Improvements in cost are accepted, but so are changes leading to small increases in cost. This allows the solution to leave suboptimal local minima in solution space. The threshold is decreased slowly as iterations proceed helping to ensure an optimum. In summary, the function returns a cycle starting at :None:None:`source` for which the total cost is minimized.
Threshold Accepting is a metaheuristic local search algorithm. The main characteristic of this algorithm is that it accepts even solutions which lead to the increase of the cost in order to escape from low quality local optimal solutions.
This algorithm needs an initial solution. This solution can be constructed by a simple greedy algorithm. At every iteration, it selects thoughtfully a neighbor solution. Consider $c(x)$ cost of current solution and $c(x')$ cost of neighbor solution. If $c(x') - c(x) <= threshold$ then the neighbor solution becomes the current solution for the next iteration, where the threshold is named threshold.
In comparison to the Simulated Annealing algorithm, the Threshold Accepting algorithm does not accept very low quality solutions (due to the presence of the threshold value). In the case of Simulated Annealing, even a very low quality solution can be accepted with probability $p$.
Time complexity: It has a running time $O(m * n *
<SubstitutionRef: |value: '|V|' |>)$ where $m$ and $n$ are the number of times the outer and inner loop run respectively.
For more information and how algorithm is inspired see: https://doi.org/10.1016/0021-9991(90)90201-B
G should be a complete weighted undirected graph. The distance between all pairs of nodes should be included.
The initial solution (a cycle through all nodes returning to the start). This argument has no default to make you think about it. If "greedy", use :None:None:`greedy_tsp(G, weight)`. Other common starting cycles are :None:None:`list(G) + [next(iter(G))]` or the final result of simulated_annealing_tsp
when doing threshold_accepting_tsp
.
Edge data key corresponding to the edge weight. If any edge does not have this attribute the weight is set to 1.
Starting node. If None, defaults to next(iter(G))
The algorithm's threshold parameter. It represents the initial threshold's value
Indicator of what move to use when finding new trial solutions. Strings indicate two special built-in moves:
"1-1": 1-1 exchange which transposes the position of two elements of the current solution. The function called is swap_two_nodes
. For example if we apply 1-1 exchange in the solution A = [3, 2, 1, 4, 3]
we can get the following by the transposition of 1 and 4 elements: A' = [3, 2, 4, 1, 3]
"1-0": 1-0 exchange which moves an node in the solution to a new position. The function called is move_one_node
. For example if we apply 1-0 exchange in the solution A = [3, 2, 1, 4, 3]
we can transfer the fourth element to the second position: A' = [3, 4, 2, 1, 3]
You may provide your own functions to enact a move from one solution to a neighbor solution. The function must take the solution as input along with a :None:None:`seed` input to control random number generation (see the :None:None:`seed` input here). Your function should maintain the solution as a cycle with equal first and last node and all others appearing once. Your function should return the new solution.
Declared done when this number of consecutive iterations of the outer loop occurs without any change in the best cost solution.
The number of iterations of the inner loop.
Percentage of threshold decrease when there is at least one acceptance of a neighbor solution. If no inner loop moves are accepted the threshold remains unchanged.
Indicator of random number generation state. See Randomness<randomness>
.
If G is not complete the algorithm raises an exception.
Returns the cycle (list of nodes) that a salesman can follow to minimize total weight of the trip.
Returns an approximate solution to the traveling salesman problem.
>>> from networkx.algorithms import approximation as approx
... G = nx.DiGraph()
... G.add_weighted_edges_from({
... ("A", "B", 3), ("A", "C", 17), ("A", "D", 14), ("B", "A", 3),
... ("B", "C", 12), ("B", "D", 16), ("C", "A", 13),("C", "B", 12),
... ("C", "D", 4), ("D", "A", 14), ("D", "B", 15), ("D", "C", 2)
... })
... cycle = approx.threshold_accepting_tsp(G, "greedy", source="D")
... cost = sum(G[n][nbr]["weight"] for n, nbr in nx.utils.pairwise(cycle))
... cycle ['D', 'C', 'B', 'A', 'D']
>>> cost 31
>>> incycle = ["D", "B", "A", "C", "D"]
... cycle = approx.threshold_accepting_tsp(G, incycle, source="D")
... cost = sum(G[n][nbr]["weight"] for n, nbr in nx.utils.pairwise(cycle))
... cycle ['D', 'C', 'B', 'A', 'D']
>>> cost 31See :
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.approximation.traveling_salesman.simulated_annealing_tsp
networkx.algorithms.approximation.traveling_salesman.threshold_accepting_tsp
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them