An Improved Clonal Selection Algorithm and Its Application to Traveling Salesman Problems

• GAO Shangce

  Faculty of Engineering, University of Toyama

• TANG Zheng

  Faculty of Engineering, University of Toyama

• DAI Hongwei

  Tele Electric Supply Service Co. Ltd.

• ZHANG Jianchen

  Faculty of Engineering, University of Toyama

Abstract

The clonal selection algorithm (CS), inspired by the basic features of adaptive immune response to antigenic stimulus, can exploit and explore the solution space parallelly and effectively. However, antibody initialization and premature convergence are two problems of CS. To overcome these two problems, we propose a chaotic distance-based clonal selection algorithm (CDCS). In this novel algorithm, we introduce a chaotic initialization mechanism and a distance-based somatic hypermutation to improve the performance of CS. The proposed algorithm is also verified for numerous benchmark traveling salesman problems. Experimental results show that the improved algorithm proposed in this paper provides better performance when compared to other metaheuristics.

Journal

• IEICE Transactions on Fundamentals, A

  IEICE Transactions on Fundamentals, A 90 (12), 2930-2938, 2007-12-01

  The Institute of Electronics, Information and Communication Engineers

Keywords

• clonal selection algorithm
• distance-based somatic hypermutation
• traveling salesman problem
• chaotic
• affinity

Details

• CRID: 1570009752661630720
• NII Article ID: 110007538040
• NII Book ID: AA10826239
• ISSN: 09168508
• Text Lang: en
• Data Source:
  • CiNii Articles