Fig. 3: Probability of selecting the next city under different temperature (kBT) conditions.
When kBT approaches 0, the algorithm always selects the closest city, equivalent to a greedy algorithm. When kBT approaches infinity, the selection probability for each remaining city is equal, which is analogous to random selection. When kBT is within a suitable intermediate range, a probabilistic greedy algorithm can be achieved.
