Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem

Mumford, Christine Lesley ORCID: https://orcid.org/0000-0002-4514-0272 2003. Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem. Presented at: 2003 Congress on Evolutionary Computation (CEC '03), 8-12 December 2003. The 2003 Congress on evolutionary computation 2003. CEC '03. , vol.2 IEEE, pp. 854-861. 10.1109/CEC.2003.1299756

Full text not available from this repository.

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.

Item Type:	Conference or Workshop Item (Paper)
Book Type:	Edited Book
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Publisher:	IEEE
Related URLs:	Publisher
Last Modified:	20 Oct 2022 09:25
URI:	https://orca.cardiff.ac.uk/id/eprint/31902

Citation Data

Cited 15 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item