{"id":"https://openalex.org/W2889512156","doi":"https://doi.org/10.1109/ieeegcc.2017.8448239","title":"Solving 0/1 Knapsack Problem Using Metaheuristic Techniques","display_name":"Solving 0/1 Knapsack Problem Using Metaheuristic Techniques","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2889512156","doi":"https://doi.org/10.1109/ieeegcc.2017.8448239","mag":"2889512156"},"language":"en","primary_location":{"id":"doi:10.1109/ieeegcc.2017.8448239","doi":"https://doi.org/10.1109/ieeegcc.2017.8448239","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieeegcc.2017.8448239","pdf_url":null,"source":{"id":"https://openalex.org/S4306498127","display_name":"IEEE GCC Conference and Exhibition (GCCCE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 9th IEEE-GCC Conference and Exhibition (GCCCE)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5003173020","display_name":"Hayatullahi Bolaji Adeyemo","orcid":"https://orcid.org/0000-0001-5229-9591","observed_orcids":["https://orcid.org/0000-0001-5229-9591"]},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Hayatullahi Adeyemo","raw_affiliation_strings":["Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058370129","display_name":"Moataz Ahmed","orcid":"https://orcid.org/0000-0003-0042-8819","observed_orcids":["https://orcid.org/0000-0003-0042-8819"]},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Moataz Ahmed","raw_affiliation_strings":["Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I134085113"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.6776999831199646,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.6776999831199646,"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/T12176","display_name":"Optimization and Packing Problems","score":0.3149000108242035,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/0-1-knapsack-problem","display_name":"0-1 knapsack problem","score":0.9990000128746033},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.8629999756813049},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.9020000100135803},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"iterated local search","score":0.9990000128746033},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9940000176429749},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"particle swarm optimization","score":1.0},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.984000027179718}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.9556608200073242},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9091845750808716},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.8050561547279358},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7298045754432678},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6900078058242798},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6369260549545288},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5136832594871521},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.5042070150375366},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4692680239677429},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.44643062353134155},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.42422235012054443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37383297085762024},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.16215381026268005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ieeegcc.2017.8448239","doi":"https://doi.org/10.1109/ieeegcc.2017.8448239","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieeegcc.2017.8448239","pdf_url":null,"source":{"id":"https://openalex.org/S4306498127","display_name":"IEEE GCC Conference and Exhibition (GCCCE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 9th IEEE-GCC Conference and Exhibition (GCCCE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322323","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W72506400","https://openalex.org/W1586409345","https://openalex.org/W1608877958","https://openalex.org/W2006371937","https://openalex.org/W2025596470","https://openalex.org/W2040147130","https://openalex.org/W2121802785","https://openalex.org/W2969379352"],"related_works":["https://openalex.org/W3003159528","https://openalex.org/W2928611323","https://openalex.org/W4214915541","https://openalex.org/W2622846141","https://openalex.org/W4386439792","https://openalex.org/W4407638217","https://openalex.org/W2804605181","https://openalex.org/W2737853514","https://openalex.org/W2080252745","https://openalex.org/W4408443072"],"abstract_inverted_index":{"Knapsack":[0],"problem":[1,17,33,65],"has":[2],"gained":[3],"popularity":[4],"in":[5,88],"the":[6,32,40,52,64,68,89],"field":[7],"of":[8,16,23],"combinatorial":[9],"optimization.":[10],"In":[11],"this":[12],"paper,":[13],"different":[14],"types":[15],"instances":[18,66],"were":[19,29,36,48,61,70,79],"selected.":[20],"Two":[21],"each":[22],"S-Metaheuristic":[24],"methods":[25,28],"and":[26,43,57,67,75,91],"P-Metaheuristic":[27],"applied":[30,37,49],"on":[31,50,63],"instances.":[34],"S-Metaheuristics":[35],"to":[38],"both":[39],"small":[41],"problems":[42,45],"large":[44,53],"while":[46],"P-Metaheuristics":[47],"only":[51],"problems.":[54],"Simulated":[55],"Annealing":[56],"Iterated":[58],"Local":[59],"Search":[60],"tested":[62],"results":[69],"compared.":[71,80],"Also,":[72],"Genetic":[73],"Algorithm":[74],"Particle":[76],"Swarm":[77],"Optimization":[78],"The":[81],"techniques":[82],"perform":[83],"excellently":[84],"with":[85],"slight":[86],"differences":[87],"efficiency":[90],"time.":[92]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-10-05T09:50:58.205359","created_date":"2018-09-07T00:00:00"}