Enhanced Hyper-Cube Framework Aco for Combinatorial Optimization Problems

Many combinatorial optimization problems are hard to solve within the polynomial computational time or NP-hard problems. Therefore, developing new optimization techniques or improving existing ones still grab attention. This paper presents an improved variant of the Ant Colony Optimization meta-heuristic called Enhanced Hyper Cube Framework ACO (EHCFACO). This variant has an enhanced exploitation feature that works through two added local search movements of insertion and bit flip. In order to examine the performance of the improved meta-heuristic, a well-known structural optimization problem of laminate Stacking Sequence Design (SSD) for maximizing critical buckling load has been used. Furthermore, five different ACO variants were concisely presented and implemented to solve the same optimization problem. The performance assessment results reveal that EHCFACO outperforms the other ACO variants and produces a cost-effective solution with considerable quality.