Performance Evaluation of Multiagent Genetic Algorithm

  • Authors:
  • J. J. Liang;S. Baskar;P. N. Suganthan;A. K. Qin

  • Affiliations:
  • School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore 639798;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore 639798;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore 639798;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore 639798

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Zhong et al. (2004 [IEEE Trans. on Systems, Man and Cybernetics (Part B), 34: 1128---1141]) proposed the multiagent genetic algorithm (MAGA) in their publication titled "A multiagent genetic algorithm for global numerical optimization". The MAGA exploits the known characteristics of some benchmark functions to achieve outstanding results. For example, the MAGA exploits the fact that all variables have the same numerical value at the global optimum and the same upper and lower bounds to solve several 100 dimensional and 1000 dimensional benchmark problems with high precision requiring on average 7000 and 16,000 function evaluations respectively. In this paper, we evaluate the performance of the MAGA experimentally1 and demonstrate that the performance of the MAGA significantly deteriorates when the relative positions of the variables at the global optimal point are shifted with respect to the search ranges.