GAP is a combinatorial optimization problem. If we are given with n number of items to be packed into m number of bags, then the Generalized Assignment Problem (GAP) is to find the maximized assignment of each item to exactly one bag, without exceeding the maximum capacity of any bag. This kind of problem is also called as knapsack problem. This paper proposes a Hybrid Ant Breeding Algorithm (HABA) for solving Knapsack problem that is one of the Generalized Assignment Problem (GAP). HABA is based on the natural evolution of the ant breeding and seed dispersal. This algorithm consists of two stages. In first stage the algorithm mimics the seed dispersal for finding the density of flesh in a seed. The second stage involves the mating process of ant for finding the best population for next generation. The obtained results are compared with seed based plant prorogation algorithm, and the results are shown. The result proves that the HABA finds optimal solution without omitting the even worst search area. HABA proves that exploitation and exploration are good.
Volume 11 | 04-Special Issue
Pages: 951-956