Adding Negative Learning to Ant Colony Optimization: A Comprehensive Study

Ant colony optimization is a metaheuristic that mainly used for solving hard combinatorial problems. The distinctive feature of ant learning mechanism based on from positive examples. This also the case in other learning-based metaheuristics such as evolutionary algorithms and particle swarm optimization. Examples nature, however, indicate negative learning—in addition to learning—can beneficially be certain purposes. Several research papers have explored this topic over last decades context optimization, mostly with limited success. In work we present study an alternative making use mathematical programming incorporation Moreover, compare our proposal some well-known existing approaches related literature. Our considers two classical problems: minimum dominating set problem multi dimensional knapsack problem. both cases are able show approach significantly improves standard competing mechanisms