关键词: 遗传算法, 小生境, 模拟退火, 异步操作, 旅行商问题, 并行虚拟机

Abstract: In order to overcome the drawbacks of the simple and normal hybrid Genetic Algorithm (GA), which has poor local searching ability and low computing efficiency, respectively, an asynchronous hybrid GA frame was proposed. Such algorithm frame mainly consists of three parts, which are genetic algorithm, niche operation and simulated annealing. To such proposed algorithm, simulated annealing running in asynchronous way made the main difference when being compared with others. Two computers connected by a switch made up the parallel computing environment. One of the two computers executed genetic algorithm and niche operation and the other executed simulated annealing. The Parallel Virtual Machine (PVM) was used for exchanging data between two computers. Experimental results on Traveling Salesman Problem (TSP) demonstrate that the proposed algorithm is viable and efficient.

Key words: Genetic Algorithm (GA), hierarchy genetic algorithm, simulated annealing, asynchronous operation, Travelling Salesman Problem (TSP), Parallel Virtual Machine (PVM)