{"id":"https://openalex.org/W2810575961","doi":"https://doi.org/10.1109/rait.2018.8389069","title":"A hybrid GA-GSA algorithm to solve multidimensional knapsack problem","display_name":"A hybrid GA-GSA algorithm to solve multidimensional knapsack problem","publication_year":2018,"publication_date":"2018-03-01","ids":{"openalex":"https://openalex.org/W2810575961","doi":"https://doi.org/10.1109/rait.2018.8389069","mag":"2810575961"},"language":"en","primary_location":{"id":"doi:10.1109/rait.2018.8389069","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rait.2018.8389069","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066304376","display_name":"Indresh Kumar Gupta","orcid":"https://orcid.org/0000-0002-3172-5843"},"institutions":[{"id":"https://openalex.org/I4210121466","display_name":"Indian Institute of Technology Bhilai","ror":"https://ror.org/02sscsx71","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210121466"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Indresh Kumar Gupta","raw_affiliation_strings":["Dept: Computer Science & Engineering-SSTC, Bhilai, India"],"affiliations":[{"raw_affiliation_string":"Dept: Computer Science & Engineering-SSTC, Bhilai, India","institution_ids":["https://openalex.org/I4210121466"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066304376"],"corresponding_institution_ids":["https://openalex.org/I4210121466"],"apc_list":null,"apc_paid":null,"fwci":0.9855,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.80922031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9691891074180603},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6822047829627991},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.638290524482727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6136956214904785},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.6126415133476257},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.60391765832901},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.5562061071395874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4617685377597809},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.43871286511421204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4080422520637512}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9691891074180603},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6822047829627991},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.638290524482727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6136956214904785},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.6126415133476257},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.60391765832901},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.5562061071395874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4617685377597809},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.43871286511421204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4080422520637512},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rait.2018.8389069","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rait.2018.8389069","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1483324164","https://openalex.org/W1586409345","https://openalex.org/W1593916827","https://openalex.org/W1608877958","https://openalex.org/W1980595160","https://openalex.org/W2015395371","https://openalex.org/W2040147130","https://openalex.org/W2045411541","https://openalex.org/W2118402343","https://openalex.org/W2190518115","https://openalex.org/W2324735073","https://openalex.org/W2612809652","https://openalex.org/W4299412006","https://openalex.org/W6628849708","https://openalex.org/W6737692105"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W2005493932","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2145407993","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W3169691842"],"abstract_inverted_index":{"Knapsack":[0],"problem":[1,39],"is":[2,25,45,52,62,82,95,110,151],"a":[3,10,20],"classical":[4],"combinatorial":[5],"optimization":[6],"problem;":[7],"which":[8],"hunt":[9],"best":[11],"solution":[12,68,142],"among":[13],"various":[14],"available":[15],"solutions.":[16],"In":[17,41,77,104],"this":[18],"paper":[19],"new":[21,105],"hybrid":[22,42,78,137,156],"GA-GSA":[23,79,122,138,157],"algorithm":[24,29,34,43,80,90],"develop":[26],"using":[27],"genetic":[28],"(GA)":[30],"and":[31,50,75,91,128],"gravitational":[32],"search":[33,49],"(GSA)":[35],"for":[36,47,54,69,115,130,158],"multidimensional":[37],"knapsack":[38],"(MDKP).":[40],"GA":[44,74,89,127],"used":[46,53],"global":[48],"GSA":[51,102],"local":[55],"search.":[56],"Central":[57],"interest":[58],"of":[59,67,73,86,99,119,145,155],"current":[60],"work":[61],"to":[63],"improve":[64],"the":[65],"quality":[66,141],"MDKP":[70],"in":[71,143,153],"comparison":[72,144],"GSA.":[76],"k%population":[81],"selected":[83,96],"after":[84,97],"creation":[85,98],"individuals":[87,100],"by":[88,101],"rest":[92],"(100-k)":[93],"%population":[94],"algorithm.":[103],"approach":[106],"top":[107],"k%":[108],"population":[109,114],"chosen":[111],"as":[112],"surviving":[113],"ne":[116],"w":[117],"generation":[118],"GA.":[120],"Hybrid":[121],"performance":[123],"has":[124],"examine":[125],"against":[126],"PSO":[129],"10":[131],"standard":[132],"MDKPs.":[133],"Simulation":[134],"outcomes":[135],"show":[136],"produce":[139],"high":[140],"both":[146],"approaches.":[147],"However":[148],"computational":[149],"time":[150],"sacrified":[152],"case":[154],"MDKP.":[159]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}