A genetic algorithm to solve the multidimensional Knapsack problem
| dc.contributor.author | Murat Erşen Berberler | |
| dc.contributor.author | Asli Guler | |
| dc.contributor.author | Urfat Nuriyev | |
| dc.contributor.author | Berberler, Murat Ersen | |
| dc.contributor.author | Guler, Asli | |
| dc.contributor.author | Nuriyev, Urfat G. | |
| dc.date.accessioned | 2025-10-06T17:52:49Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | 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. | |
| dc.identifier.doi | 10.3390/mca18030486 | |
| dc.identifier.issn | 22978747, 1300686X | |
| dc.identifier.issn | 2297-8747 | |
| dc.identifier.issn | 1300-686X | |
| dc.identifier.scopus | 2-s2.0-84884225064 | |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884225064&doi=10.3390%2Fmca18030486&partnerID=40&md5=fe1a972d53f812d5f9158cea723fc6c6 | |
| dc.identifier.uri | https://gcris.yasar.edu.tr/handle/123456789/10136 | |
| dc.identifier.uri | https://doi.org/10.3390/mca18030486 | |
| dc.identifier.uri | https://search.trdizin.gov.tr/en/yayin/detay/233455 | |
| dc.language.iso | English | |
| dc.publisher | Association for Scientific Research membranes@mdpi.com | |
| dc.relation.ispartof | Mathematical and Computational Applications | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.source | Mathematical and Computational Applications | |
| dc.subject | Evolutionary Algorithms, Genetic Algorithm, Heuristic Approach, Multidimensional Knapsack Problem, C (programming Language), Combinatorial Optimization, Evolutionary Algorithms, Heuristic Algorithms, Heuristic Methods, Heuristic Approach, Initial Population, Multidimensional Knapsack Problems, Optimal Solutions, Solution Space, Genetic Algorithms | |
| dc.subject | C (programming language), Combinatorial optimization, Evolutionary algorithms, Heuristic algorithms, Heuristic methods, Heuristic approach, Initial population, Multidimensional knapsack problems, Optimal solutions, Solution space, Genetic algorithms | |
| dc.subject | Genetic Algorithm | |
| dc.subject | Matematik | |
| dc.subject | Bilgisayar Bilimleri, Teori Ve Metotlar | |
| dc.subject | Evolutionary Algorithms | |
| dc.subject | Heuristic Approach | |
| dc.subject | Multidimensional Knapsack Problem | |
| dc.title | A genetic algorithm to solve the multidimensional Knapsack problem | |
| dc.type | Article | |
| dspace.entity.type | Publication | |
| gdc.author.id | 0000-0002-9227-2040 | |
| gdc.author.scopusid | 35174269000 | |
| gdc.author.scopusid | 8679093800 | |
| gdc.author.scopusid | 55180262600 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C4 | |
| gdc.coar.type | text::journal::journal article | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | ||
| gdc.description.departmenttemp | [Nuriyev, Urfat G.] Department Of Mathematics, Ege University, Izmir, Turkey; [Berberler, Murat Ersen] Department Of Computer Science, Dokuz Eylul University, Izmir, Turkey; [Güler, Aslı] Department Of Mathematics, Yasar University, Izmir, Turkey | |
| gdc.description.endpage | 494 | |
| gdc.description.issue | 3 | |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
| gdc.description.startpage | 486 | |
| gdc.description.volume | 18 | |
| gdc.identifier.openalex | W2295545633 | |
| gdc.identifier.trdizinid | 233455 | |
| gdc.index.type | Scopus | |
| gdc.index.type | TR-Dizin | |
| gdc.oaire.accesstype | GOLD | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.7569036E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Matematik | |
| gdc.oaire.keywords | Genetic Algorithm | |
| gdc.oaire.keywords | Heuristic approach | |
| gdc.oaire.keywords | Evolutionary algorithms | |
| gdc.oaire.keywords | Genetic algorithm | |
| gdc.oaire.keywords | Uygulamalı | |
| gdc.oaire.keywords | Multidimensional Knapsack Problem | |
| gdc.oaire.keywords | Evolutionary Algorithms | |
| gdc.oaire.keywords | Heuristic Approach | |
| gdc.oaire.keywords | Multidimensional Knapsack problem | |
| gdc.oaire.popularity | 3.767744E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 05 social sciences | |
| gdc.oaire.sciencefields | 0211 other engineering and technologies | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.sciencefields | 0502 economics and business | |
| gdc.oaire.sciencefields | 0202 electrical engineering, electronic engineering, information engineering | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 1.3791 | |
| gdc.openalex.normalizedpercentile | 0.85 | |
| gdc.opencitations.count | 4 | |
| gdc.plumx.crossrefcites | 3 | |
| gdc.plumx.mendeley | 9 | |
| gdc.plumx.scopuscites | 10 | |
| gdc.scopus.citedcount | 10 | |
| gdc.virtual.author | Serinken, Asli | |
| oaire.citation.endPage | 494 | |
| oaire.citation.startPage | 486 | |
| person.identifier.scopus-author-id | Berberler- Murat Erşen (35174269000), Guler- Asli (55180262600), Nuriyev- Urfat (8679093800) | |
| publicationissue.issueNumber | 3 | |
| publicationvolume.volumeNumber | 18 | |
| relation.isAuthorOfPublication | ba06e0be-608f-456a-b538-376c1d982d8f | |
| relation.isAuthorOfPublication.latestForDiscovery | ba06e0be-608f-456a-b538-376c1d982d8f | |
| relation.isOrgUnitOfPublication | ac5ddece-c76d-476d-ab30-e4d3029dee37 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | ac5ddece-c76d-476d-ab30-e4d3029dee37 |