Complex optimisation problems with many degrees of freedom are often characterised by the enormously large configuration space, typically O(eN) or O(N!). The idea of simulated annealing (SA) proposed by Kirkpatrick has been applied to the complex optimisation problems, which can be treated as annealing a statistical mechanical system from high temperature to low temperature; however, the SA is terribly slow for large problem sizes in typically O(N3lnN) time. We discover the hybrid algorithm (HA), which is based on a hybrid mechanism which combines conventional heuristics with low temperature simulated annealing (LTSA), which could be parallelised easily. The HA is a new approach of resolving optimisation problems with O(N) complexity where information propagation can be inhibited by restraining the range of searches in the configuration space. We use the HA to resolve several famous combinatorial optimisation problems, including the travelling salesman problem (TSP) of large sizes up to 1 000 000 cities within 3 to 5 percent of the optimal value in linear time and other nonuniformly distributed TSPs as well. We shall also discuss the applicability of the HA to the optimisation problems in general.
[1]
C. D. Gelatt,et al.
Optimization by Simulated Annealing
,
1983,
Science.
[2]
Scott Kirkpatrick,et al.
Optimization by simulated annealing: Quantitative studies
,
1984
.
[3]
Brian W. Kernighan,et al.
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
,
1973,
Oper. Res..
[4]
Shen Lin.
Computer solutions of the traveling salesman problem
,
1965
.
[5]
Michael Creutz,et al.
Microcanonical Monte Carlo Simulation
,
1983
.
[6]
E. Bonomi,et al.
The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
,
1984
.
[7]
G. C. Fox,et al.
Solving Problems on Concurrent Processors
,
1988
.
[8]
John J. Bartholdi,et al.
Spacefilling curves and the planar travelling salesman problem
,
1989,
JACM.