Browsing by Author "Nuriyev, Urfat G."

Now showing 1 - 3 of 3

Citation - Scopus: 10
A genetic algorithm to solve the multidimensional Knapsack problem
(Association for Scientific Research membranes@mdpi.com, 2013) Murat Erşen Berberler; Asli Guler; Urfat Nuriyev; Berberler, Murat Ersen; Guler, Asli; Nuriyev, Urfat G.
In this paper The Multidimensional Knapsack Problem (MKP) which occurs in many different applications is studied and a genetic algorithm to solve the MKP is proposed. Unlike the technique of the classical genetic algorithm initial population is not randomly generated in the proposed algorithm thus the solution space is scanned more efficiently. Moreover the algorithm is written in C programming language and is tested on randomly generated instances. It is seen that the algorithm yields optimal solutions for all instances. © 2020 Elsevier B.V. All rights reserved.
A New Genetic Algorithm for the 0-1 Knapsack Problem
(2016) MURAT ERSEN BERBERLER; Urfat G. NURİYEV; Aslı GÜLER; Berberler, Murat Ersen; Güler, Aslı; Nuriyev, Urfat G.
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 values 0 or 1. When calculating fitness values of items coefficients of items whose values are 1 in the bit array are summed. Roulette wheel method is used for choosing parents, in this way it is provided that strong individuals produce more children. Crossover is applied in such a way that roulette wheel is rotated on genes with the same index of parents that the dominant parent can transfer its genes to the child. Mutation is applied for randomly chosen 25% genes and this process is repeated for the number of individuals. The algorithm is written in C programming language and is tested on randomly generated instances. In order to find the optimal solutions of these problems a program that has been written by dynamic programming technique is used. It is seen that the algorithm yields optimal solutions for all instances.
Citation - WoS: 1
Citation - Scopus: 3
Algorithms with guarantee value for knapsack problems
(Taylor & Francis Ltd, 2012) Asli Guler; Urfat Nuriyev; Murat Erşen Berberler; Fidan Nuriyeva; Berberler, Murat Ersen; Nuriyev, Urfat G.; Guler, Asli; Nuriyeva, Fidan
In this study one-dimensional knapsack problems (KP) which have many applications in technical and economic areas are studied, then greedy algorithms are discussed for these problems. Guarantee values of these algorithms are calculated in order to determine how the results returned by the algorithms are close to optimal solutions. Furthermore complementary problems for integer maximization KP and bounded integer maximization KP are defined, and it is aimed to improve the guarantee values which have been calculated before in terms of the complementary problems. © 2012 Copyright Taylor and Francis Group LLC. © 2012 Elsevier B.V. All rights reserved.