A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem

摘要

This paper presents a comparative study of multi-objective evolutionary algorithms on the bi-objective 2-dimensional vector packing problem. Three state-of-the-art methods which prove their efficiency for a large variety of multi-objective optimization problems were designed to approximate the whole Pareto set of the problem. Computational experiments are performed on well-known benchmark test instances. The proposed algorithms are extensively compared to each other using different performance metrics.