A multiagent evolutionary algorithm for combinatorial optimization problems

  • Authors:

  • Jing Liu;Weicai Zhong;Licheng Jiao

  • Affiliations:

  • Institute of Intelligent Information Processing, Xidian University, Xi'an, China;Institute of Intelligent Information Processing, Xidian University, Xi'an, China;Institute of Intelligent Information Processing, Xidian University, Xi'an, China

  • Venue:
  • IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Based on our previous works, multiagent systems and evolutionary algorithms (EAs) are integrated to form a new algorithm for combinatorial optimization problems (CmOPs), namely, MultiAgent EA for CmOPs (MAEA-CmOPs). In MAEA-CmOPs, all agents live in a latticelike environment, with each agent fixed on a lattice point. To increase energies, all agents compete with their neighbors, and they can also increase their own energies by making use of domain knowledge. Theoretical analyses show that MAEA-CmOPs converge to global optimum solutions. Since deceptive problems are the most difficult CmOPs for EAs, in the experiments, various deceptive problems with strong linkage, weak linkage, and overlapping linkage, and more difficult ones, namely, hierarchical problems with treelike structures, are used to validate the performance of MAEA-CmOPs. The results show that MAEA-CmOP outperforms the other algorithms and has a fast convergence rate. MAEA-CmOP is also used to solve large-scale deceptive and hierarchical problems with thousands of dimensions, and the experimental results show that MAEA-CmOP obtains a good performance and has a low computational cost, which the time complexity increases in a polynomial basis with the problem size.