Solving 0-1 Knapsack Problem Using Genetic Algorithms

摘要：

This is a research project on using Genetic Algorithm to solve 0-1 Knapsack Problem. Knapsack problem is a combinational optimization problem. Given a set of items, each with a weight & value, it determine the number of each item to include in a collection so that the total weight is less than a given limit & the total value is as large as possible. The paper consists of three parts. In the first section we give brief description of Genetic Algorithms and some of its basic elements. Next, we describe the Knapsack Problem and Implementation of Knapsack problem using Genetic Algorithm.

关键词： Genetic Algorithms Knapsack Problem Selection operators

作者: Rattan Preet Singh

作者单位: University School of Information Technology (GGS Indraprastha University) New Delhi, India

会议类型: 国际会议

会议名称: 2011 International Conference on System Modeling and Optimization(ICSMO 2011)(2011年系统建模与优化国际会议)

会议地点: 贵阳

会议语种:英文

页码: 26-30

在线出版日期: 2011-01-26（万方平台首次上网日期，不代表论文的发表时间）