A fast heuristic ant colony approach for weighted circles layout problem

  • Authors:

  • Lin Yang;Zi-qiang Li;Jin-Hua Zheng;Hong-liang Zhang;Shou-chao Liao

  • Affiliations:

  • School of Information and Engineering, Xiangtan University, Xiangtan, China;School of Information and Engineering, Xiangtan University, Xiangtan, China;School of Information and Engineering, Xiangtan University, Xiangtan, China;School of Information and Engineering, Xiangtan University, Xiangtan, China;School of Information and Engineering, Xiangtan University, Xiangtan, China

  • Venue:
  • IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The layout problem of weighted circles is a class of layout optimization problems with behavior constraints. Aiming at this NP-hard problem, this paper puts forward a fast heuristic ant colony approach(FHACA). This approach obtains the heuristic information from weighted matrix and uses it to construct the better ants and design parameters of ant colony optimization. The layout schemes of some ants are generated quickly by constructing the non-isomorphic layout scheme of existing ants in the process of iteration. The experimental results show that the FHACA improves obviously the solution efficiency and precision compared with existing algorithms.