Abstract
In this paper, an adaptive immune clone selection algorithm for multi-objective optimization (AICSAMO) is proposed. A novel adaptive polynomial mutation operator with dynamic mutation probability is employed in AICSAMO. This adaptive mutation operator executes a rapid global search at the earlier stage of the algorithm and a fine-tuning search at the later stage of the algorithm, which adopts generation-dependent parameters to improve the convergence speed and global optimum searching ability. The effectiveness of AICSAMO is evaluated through the truss sizing and shape optimization problems of a 10-bar plane truss and a 25-bar space truss. According to the comparison of AICSAMO with various multi-objective optimization algorithms developed recently, the simulation results illustrate that AICSAMO has remarkable performance in finding a wider spread of optimal solutions and in maintaining better uniformity of the solutions with better convergence.
