Journal Name:
- International Journal of Science and Engineering Investigations
Author Name | University of Author |
---|---|
Abstract (2. Language):
Many optimization problems are assumed as NPcomplete
and on the other hand, some researchers are to find
the fast algorithms to solve these. Moreover, algorithms such
as DNA, GA are the most usable in solving NP-complete
problems because of their high density computation. Besides,
there exist several proposed approaches to resolve this
problem. However, a different methodology is proposed due to
its powerful discriminatory performance, in this paper. For this
purpose, the nephron algorithm (NA) as a biological
computation was inspired based of nephron performance
because of its intelligent screening. It can be applied as data
mining technique in order to excrete infeasible as well as non
optimized solutions. Therefore, optimized solution will be
figured out after these cyclic and repeated operations. To
illustrate the proposed model, the example of 0-1 linear
programming (LP) was taken into account. Consequently,
applied model is supposed to solve 0-1 LP precisely and
accurately according to intellectual logic of nephron.
Bookmark/Search this post with
- 8
60-64