Comparing algorithms, representations and operators for the multi-objective knapsack problem

Colombo, Gualtiero and Mumford, Christine Lesley ORCID: https://orcid.org/0000-0002-4514-0272 2005. Comparing algorithms, representations and operators for the multi-objective knapsack problem. Presented at: 2005 IEEE Congress on Evolutionary Computation, Edinburgh, UK, 2-5 September 2005. The 2005 IEEE Congress on Evolutionary Computation. , vol.2 IEEE, pp. 1268-1275. 10.1109/CEC.2005.1554836

Preview

PDF - Accepted Post-Print Version Download (293kB) | Preview

Abstract

This paper compares the performance of three evolutionary multi-objective algorithms on the multiobjective knapsack problem. The three algorithms are SPEA2 (strength Pareto evolutionary algorithm, version 2), MOGLS (multi objective genetic local search) and SEAMO2 (simple evolutionary algorithm for multiobjective optimization, version 2). For each algorithm, we try two representations: bit-string and order-based. Our results suggest that a bit-string representation works best for MOGLS, but that SPEA2 and SEAMO2 perform better with an order-based approach. Although MOGLS outperforms the other algorithms in terms of solution quality, SEAMO2 runs much faster than its competitors and produces results of a similar standard to SPEA2.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Additional Information:	Date of conference: 2-5 September 2005
Publisher:	IEEE
ISBN:	07803-93635
Date of First Compliant Deposit:	30 March 2016
Last Modified:	04 Feb 2025 16:45
URI:	https://orca.cardiff.ac.uk/id/eprint/31248

Citation Data

Actions (repository staff only)

Edit Item