ISBN: 978-981-09-5471-0 DOI: 10.18178/wcse.2015.04.001
The Solution of the 0-1 Multi-objective Knapsack Problem with the Assistance of Multi-objective Evolutionary Algorithms Based on Decomposition: A Comparative Study
Abstract— The 0/1 knapsack problem has been studied extensively due to its practical importance in many and diverse domains such as economics, engineering and management. This paper examines the 0/1 Multiobjective Knapsack problem (MOKP) with the assistance of two state-of-the-art Multiobjective Evolutionary Algorithms (MOEAs) based on decomposition, namely the MOEA/D and the MOEA/D-DRA. The compared multiobjective algorithms are analyzed and tested on four test instances of the MOKP with the assistance of two performance metrics. Experimental results show that the two algorithms generate comparable results for the four benchmark multiobjective knapsack problems examined in this study.
Index Terms— 0/1 Knapsack problem, Multi-objective optimization, Evolutionary algorithms, MOEAs
Konstantinos Metaxiotisa, Konstantinos Liagkouras
Decision Support Systems Laboratory, Department of Informatics, University of Piraeus, GREECE
Cite: Konstantinos Metaxiotisa, Konstantinos Liagkouras, "The Solution of the 0-1 Multi-objective Knapsack Problem with the Assistance of Multi-objective Evolutionary Algorithms Based on Decomposition: A Comparative Study," 2015 The 5th International Workshop on Computer Science and Engineering-Information Processing and Control Engineering (WCSE 2015-IPCE), pp. 1-7, Moscow, Russia, April 15-17, 2015.