In this research, 0-1 knapsack problem are solved by simulating eurygaster life in wheat farms. Knapsack problem is a NP-Hard problem that has been focused to solve by researchers. On the other hand, eurygaster algorithm is a method invented to solve non-deterministic polynomial by researchers. This algorithm divides problems to several partitions and distributed eurygasters on each partition separately. In this research the proposed approach to solve knapsack problem is discussed. The assessment results indicate solving 0-1 knapsack problem using this method is faster that genetic one.
