{"id":"https://openalex.org/W2382996062","doi":null,"title":"Solving 0/1 knapsack problem using genetic algorithm","display_name":"Solving 0/1 knapsack problem using genetic algorithm","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2382996062","mag":"2382996062"},"language":"en","primary_location":{"id":"mag:2382996062","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-XDKD904.022.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764397410","display_name":"Jounal of Xidian University","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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Jounal of Xidian University","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hong Huo","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hong Huo","raw_affiliation_strings":["wei,XU Jin,BAO Zheng"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"wei,XU Jin,BAO Zheng","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.307,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85788863,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.7685999870300293,"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.7685999870300293,"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.22529999911785126,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.0007999999797903001,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/0-1-knapsack-problem","display_name":"0-1 knapsack problem","score":1.0},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9549999833106995},{"id":"https://openalex.org/keywords/penalty-function","display_name":"penalty method","score":0.8429999947547913},{"id":"https://openalex.org/keywords/repair-algorithm","display_name":"repair algorithm","score":0.9850000143051147},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8859999775886536},{"id":"https://openalex.org/keywords/optimal-solution","display_name":"optimal solution","score":0.6349999904632568}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9634133577346802},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7633943557739258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.641990065574646},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6305731534957886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5862101316452026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48925304412841797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32783156633377075}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2382996062","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-XDKD904.022.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764397410","display_name":"Jounal of Xidian University","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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Jounal of Xidian University","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W567637878","https://openalex.org/W3162831392","https://openalex.org/W2386595662","https://openalex.org/W2116899094","https://openalex.org/W2349093256","https://openalex.org/W2366077755","https://openalex.org/W2355325864","https://openalex.org/W2143872647","https://openalex.org/W2530147769","https://openalex.org/W2373584599"],"abstract_inverted_index":{"Three":[0],"algorithms":[1,9],"which":[2],"are":[3,18,50],"penalty":[4],"functions,":[5],"repair":[6,25],"and":[7,46],"decoder":[8],"for":[10],"0/1":[11],"knapsack":[12],"problem":[13],"using":[14],"the":[15,24,30,41,47,54],"genetic":[16],"algorithm":[17,26],"presented.":[19],"The":[20],"analysis":[21],"shows":[22],"that":[23],"can":[27],"result":[28],"in":[29,51],"optimal":[31],"solution.":[32],"We":[33],"make":[34],"some":[35],"comparisons":[36],"among":[37],"presented":[38],"method":[39],"on":[40],"different":[42],"test":[43],"data":[44],"sets":[45],"results":[48],"obtained":[49],"coincidence":[52],"with":[53],"analysis.":[55]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-09-29T14:09:16.559479","created_date":"2016-06-24T00:00:00"}