Research on the Route Search Method Based on Ant-Colony Microcanonical Annealing Algorithm

The paper proposes a large-scale route search method based on bidirectional ant-colony microcanonical annealing algorithm, which adopts double search. The underlying idea is to verify the proposed path search method under the real road network of Changchun city. The paper uses matlab to encode algorithm and adopts Mapinfo software mapping network for contrastive analyzing the proposed path search method and classical algorithm. The results demonstrate that the proposed method is larger advantage in running time and the global optimal solution, which has a good practicability.

Microcanonical Optimization Applied to the Traveling Salesman Problem

Optimization strategies based on simulated annealing and its variants have been extensively applied to the traveling salesman problem (TSP). Recently, there has appeared a new physics-based metaheuristic, called the microcanonical optimization algorithm (μO), which does not resort to annealing, and which has proven a superior alternative to the annealing procedures in various applications. Here we present the first performance evaluation of μO as applied to the TSP. When compared to three annealing strategies (simulated annealing, microcanonical annealing and Tsallis annealing), and to a tabu search algorithm, the microcanonical optimization has yielded the best overall results for several instances of the euclidean TSP. This confirms μO as a competitive approach for the solution of general combinatorial optimization problems.