Evolutionary Many-Objective Algorithms for Combinatorial Optimization Problems: A Comparative Study

Publication Type:
Journal Article
Archives of Computational Methods in Engineering, 2020
Issue Date:
Full metadata record
© 2020, CIMNE, Barcelona, Spain. Many optimization problems encountered in the real-world have more than two objectives. To address such optimization problems, a number of evolutionary many-objective optimization algorithms were developed recently. In this paper, we tested 18 evolutionary many-objective algorithms against well-known combinatorial optimization problems, including knapsack problem (MOKP), traveling salesman problem (MOTSP), and quadratic assignment problem (mQAP), all up to 10 objectives. Results show that some of the dominance and reference-based algorithms such as non-dominated sort genetic algorithm (NSGA-III), strength Pareto-based evolutionary algorithm based on reference direction (SPEA/R), and Grid-based evolutionary algorithm (GrEA) are promising algorithms to tackle MOKP and MOTSP with 5 and 10 while increasing the number of objectives. Also, the dominance-based algorithms such as MaOEA-DDFC as well as the indicator-based algorithms such as HypE are promising to solve mQAP with 5 and 10 objectives. In contrast, decomposition based algorithms present the best on almost problems at saving time. For example, t-DEA displayed superior performance on MOTSP for up to 10 objectives.
Please use this identifier to cite or link to this item: