An intelligent approach to the irregular polygon layout problem based on adaptive artificial bee colony algorithm
by Renbin Xiao; Zhendong Huang
International Journal of Computer Applications in Technology (IJCAT), Vol. 43, No. 4, 2012

Abstract: Taking the layout problem of satellite cabins as background, the authors present a ringwave exploratory heuristic algorithm (REHA) based on the discrete gravity centre no fit polygon (DGCNFP) for the optimal layout problem of irregular polygons in a circular container with performance constraint in two-dimensional space. Proposed an adaptive artificial bee colony (AABC) algorithm which can dynamically adjust the select press in the solution process, so it can avoid falling into local optima too early. Parameters of the sort function in REHA are optimised by the AABC to form a hybrid algorithm for the irregularity polygon layout problem. The numerical results on the benchmark show that the hybrid algorithm is effective to the layout problem.

Online publication date: Fri, 01-Jun-2012

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com