Caching in the TSP search space

Abstract

Heuristic search techniques can often benefit from record keeping and saving of intermediate results, thereby improving performance through exploitation of time / space tradeoffs. Iterative hill climbing (ITHC) is one of these heuristics. This paper demonstrates that record keeping in the ITHC domain can significantly speed up the ITHC. The record keeping method is similar to the mechanism of a cache. The new approach is implemented and tested in the traveling salesperson search space. The research compares a traditional random restart (RR) procedure to a new greedy enumeration (GE) method. GE produces Hamiltonian-cycles that are about 10% shorter than the RR. Moreover, the cached RR achieves a speedup of 3x with a relatively small number of cities and only 20% with a medium number of cities (~17). The cached GE shows a highly significant speedup of 4x over traditional methods even with a relatively large number of cities (>80). © 2009 Springer Berlin Heidelberg.