The irregular cutting-stock problem mdash; a new procedure for deriving the no-fit polygon
Computers and Operations Research
Polygon decomposition for efficient construction of Minkowski sums
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
Applied Soft Computing
International Journal of Bio-Inspired Computation
International Journal of Computer Applications in Technology
International Journal of Computer Applications in Technology
International Journal of Computer Applications in Technology
Hi-index | 0.00 |
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.