A New Genetic Algorithm For The 0-1 Knapsack Problem

dc.contributor.author	Guler, A.
dc.contributor.author	Berberler, M.E.
dc.contributor.author	Nuriyev, U.G.
dc.date.accessioned	2021-12-08T13:46:26Z
dc.date.available	2021-12-08T13:46:26Z
dc.date.issued	2016
dc.identifier.issn	2147-4575
dc.identifier.uri	https://app.trdizin.gov.tr/makale/TWpJeU5UVTRPQT09/a-new-genetic-algorithm-for-the-0-1-knapsack-problem
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/18164
dc.description.abstract	In this paper, the 0-1 Knapsack Problem (KP) which occurs in many different applications is studied and a new genetic algorithm to solve the KP is proposed. In our methodology, n items are represented by n genes on a bit array that compactly stores the va
dc.language.iso	English
dc.title	A New Genetic Algorithm For The 0-1 Knapsack Problem
dc.relation.journal	Academic Platform-Journal Of Englishineering And Science
dc.relation.volume	4
dc.relation.issue	3
dc.identifier.issue	3
dc.identifier.startpage	9
dc.identifier.endpage	14
dc.identifier.volume	4

Files in this item

Files	Size	Format	View
There are no files associated with this item.