Ant-antlion Optimizer for Multi-objective Knapsack Problem

The multi-objective knapsack problem (MOKP) is a significant multi-objective combinatorial optimization issue which widely exists in various real-world applicatiodns. Ant-antlion optimizer (AAO) is a modified evolutionary algorithm adopted for resolving complicated combinatorial optimization problems. In order to handle MOKP by AAO, we develop a novel method named multi-objective ant-antlion optimizer (MOAAO). MOAAO has three improvement units to advance algorithm’s searching ability, i.e., boundary individuals record, improved elite selection, and prudent search policy. Twelve typical testing instances and four state-of-the-art methods are applied for comprehensive experiments, and the results demonstrate the superiority of our approach.