Scholars Central

Review articlePublished 3 May 2019

Solving Knapsack problem by simulating eurygaster life

Authors: Fariborz Ahmadi, Hamid Salehi, Khosro Karimi

Archives of Applied Science Research

Volume 6 · Issue 5 · Pages 172–177

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

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.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Archives of Applied Science Research.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalArchives of Applied Science Research
  • SubjectComputer Science & IT
  • SubjectGenetics & Molecular Biology
  • SubjectPhysics & Astronomy
  • BylineArticles whose byline prints “Fariborz Ahmadi”
  • BylineArticles whose byline prints “Hamid Salehi”
  • BylineArticles whose byline prints “Khosro Karimi”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels