A Survey on Ant Colony Optimization for Solving Some of the Selected NP-Hard Problem

This paper analyses various ant colony optimization (ACO) based techniques for solving some of the selected intractable problems. ACO is one of the popularly used techniques in the field of meta-heuristic techniques that gave acceptable solutions to intractable problems like Travelling Salesperson (TS), Subset Selection (SS), Minimum Vertex Cover (MVC), and 0/1 Knapsack in tolerable amount of time. We have reviewed literature on the usage of aforesaid meta-heuristic algorithms for solving the intractable problems like TS, SS, MVC, and 0/1-Knapsack. A review of several ACO for NP-Hard problems with different instances shows that ACO algorithm demonstrates significant effectiveness and robustness in solving intractable problems.