期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2014
卷号：5
期号：3
页码：4313-4316
出版社：TechScience Publications
摘要：This paper develops a new approach to find solution to the Bounded Knapsack problem (BKP).The Knapsack problem is a combinatorial optimization problem where the aim is to maximize the profits of objects in a knapsack without exceeding its capacity. BKP is a generalization of 0/1 knapsack problem in which multiple instances of distinct items but a single knapsack is taken. Real life applications of this problem include cryptography, finance, etc. This paper proposes an estimation of distribution algorithm (EDA) using greedy operator approach to find solution to the BKP. EDA is stochastic optimization technique that explores the space of potential solutions by modelling probabilistic models of promising candidate solutions
关键词：Bounded Knapsack; Greedy Algorithm;Estimation of Distribution Algorithm; Combinatorial Problem;Optimization
