Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP

作者：Pan, Guo; Li, Kenli; Ouyang, Aijia; Li, Keqin

来源：Soft Computing, 2016, 20(2): 555-566.

DOI：10.1007/s00500-014-1522-3

• Delete-cross operator
• Dynamic mutation
• Greedy algorithm
• Immune algorithm
• TSP

This paper first introduces the fundamental principles of immune algorithm (IA), greedy algorithm (GA) and delete-cross operator (DO). Based on these basic algorithms, a hybrid immune algorithm (HIA) is constructed to solve the traveling salesman problem (TSP). HIA employs GA to initialize the routes of TSP and utilizes DO to delete routes of crossover. With dynamic mutation operator (DMO) adopted to improve searching precision, this proposed algorithm can increase the likelihood of global optimum after the hybridization. Experimental results demonstrate that the HIA algorithm is able to yield a better solution than that of other algorithms, which also takes less computation time.

• 出版日期2016-2
• 单位湖南大学