多目标0/1背包问题的表示与重组算子比较

The 2003 Congress on Evolutionary Computation, 2003. CEC '03. Pub Date : 2003-12-08 DOI:10.1109/CEC.2003.1299756

C. Mumford

{"title":"多目标0/1背包问题的表示与重组算子比较","authors":"C. Mumford","doi":"10.1109/CEC.2003.1299756","DOIUrl":null,"url":null,"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.","PeriodicalId":416243,"journal":{"name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem\",\"authors\":\"C. Mumford\",\"doi\":\"10.1109/CEC.2003.1299756\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":416243,\"journal\":{\"name\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2003.1299756\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2003.1299756","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 20

摘要

多背包问题是研究人员开发新的基于帕累托的多目标进化算法的一个流行的测试平台。我们探索了MKP的一系列不同的表示和运算符，这些表示和运算符是从单目标情况改编而来的。结果表明，对于这里考虑的问题实例，基于顺序的方法优于二进制表示。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

The 2003 Congress on Evolutionary Computation, 2003. CEC '03.

自引率

0.00%

发文量