遗传算法与动态规划求解背包问题的比较

Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence Pub Date : 2020-12-24 DOI:10.1145/3446132.3446142

Yan Wang, M. Wang, Jia Li, Xiang Xu

{"title":"遗传算法与动态规划求解背包问题的比较","authors":"Yan Wang, M. Wang, Jia Li, Xiang Xu","doi":"10.1145/3446132.3446142","DOIUrl":null,"url":null,"abstract":"In this paper, the genetic algorithm and the dynamic programming algorithm are used to solve the 0-1 knapsack problem, and the principles and implementation process of the two methods are analyzed. For the two methods, the initial condition values are changed respectively, and the running time, the number of iterations and the accuracy of the running results of each algorithm under different conditions are compared and analyzed, with the reasons for the differences are studied to show the characteristics in order to find different features of these algorithms.","PeriodicalId":125388,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Comparison of genetic algorithm and dynamic programming solving knapsack problem\",\"authors\":\"Yan Wang, M. Wang, Jia Li, Xiang Xu\",\"doi\":\"10.1145/3446132.3446142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the genetic algorithm and the dynamic programming algorithm are used to solve the 0-1 knapsack problem, and the principles and implementation process of the two methods are analyzed. For the two methods, the initial condition values are changed respectively, and the running time, the number of iterations and the accuracy of the running results of each algorithm under different conditions are compared and analyzed, with the reasons for the differences are studied to show the characteristics in order to find different features of these algorithms.\",\"PeriodicalId\":125388,\"journal\":{\"name\":\"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3446132.3446142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3446132.3446142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文采用遗传算法和动态规划算法求解0-1背包问题，并分析了这两种方法的原理和实现过程。对于两种方法，分别改变初始条件值，对不同条件下各算法的运行时间、迭代次数和运行结果的精度进行比较分析，研究差异的原因，显示出其特点，从而发现这两种算法的不同特点。

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

查看原文本刊更多论文

Comparison of genetic algorithm and dynamic programming solving knapsack problem

In this paper, the genetic algorithm and the dynamic programming algorithm are used to solve the 0-1 knapsack problem, and the principles and implementation process of the two methods are analyzed. For the two methods, the initial condition values are changed respectively, and the running time, the number of iterations and the accuracy of the running results of each algorithm under different conditions are compared and analyzed, with the reasons for the differences are studied to show the characteristics in order to find different features of these algorithms.

求助全文

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

来源期刊

Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence

自引率

0.00%

发文量