DocumentCode
412613
Title
Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem
Author
Mumford, Christine L.
Author_Institution
Dept. of Comput. Sci., Univ. of Cardiff, UK
Volume
2
fYear
2003
fDate
8-12 Dec. 2003
Firstpage
854
Abstract
The multiple knapsack problem (MKP) is a popular test-bed for researchers developing new Pareto-based multiobjective evolutionary algorithms. We explore a range of different representations and operators for the MKP, which have been adapted from the single objective case. Results indicate that order-based approaches are superior to binary representations for the problem instances considered here.
Keywords
Pareto optimisation; genetic algorithms; knapsack problems; Pareto-based multiobjective evolutionary algorithms; binary representations; multiobjective 0/1 knapsack problem; order-based approaches; recombination operators; Computer industry; Computer science; Degradation; Evolutionary computation; Genetics; Industrial relations; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN
0-7803-7804-0
Type
conf
DOI
10.1109/CEC.2003.1299756
Filename
1299756
Link To Document