A fast and efficient teaching-learning-based optimization algorithm for large-scale multi-objective optimization problems

Multi-objective optimization problems with large-scale decision variables, known as LSMOPs, are characterized by their large-scale search space and multiple conflicting objectives to be optimized. They have been involved in many emergent real-world applications, such as feature and instance selection, data clustering, adversarial attack, vehicle routing problem, and others. In this work, we propose a new teaching-learning-based optimization algorithm to effectively tackle large-scale multi-objective optimization problems. The proposed approach ensures both the diversity of solutions, requested for high dimensionality of LSMOPs, and the balance between the exploitation and exploration during the optimization process. The experimental studies conducted on 54 instances of a large-scale multi-objective optimization problems test suite and the comparisons against well-known and state-of-the-art algorithms have shown the superiority of the proposed algorithm in terms of Pareto front approximation and computation time by using limited evaluation budget.