{"id":"https://openalex.org/W2363064809","doi":null,"title":"Study of Solving Knapsack Problem Based on Binary Codes Genetic Algorithm","display_name":"Study of Solving Knapsack Problem Based on Binary Codes Genetic Algorithm","alternate_titles":[],"publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2363064809","mag":"2363064809"},"language":"en","primary_location":{"id":"mag:2363064809","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=WJFZ201307029","pdf_url":null,"source":{"id":"https://openalex.org/S2764664041","display_name":"Computer Technology and Development","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4320800559","host_organization_name":"China Computer Federation","host_organization_lineage":["https://openalex.org/P4320800559"],"host_organization_lineage_names":["China Computer Federation"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computer Technology and Development","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2363064809"],"child_works_count":0,"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":"https://openalex.org/A5112114989","display_name":"Luo Yu-jun","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I16351329","display_name":"China West Normal University","ror":"https://ror.org/04s99y476","country_code":"CN","type":"education","lineage":["https://openalex.org/I16351329"]}],"countries":["CN"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Luo Yu-jun","raw_affiliation_strings":["Information College,West China Normal University,Nanchong 637007,China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information College,West China Normal University,Nanchong 637007,China)","institution_ids":["https://openalex.org/I16351329"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112114989"],"corresponding_institution_ids":["https://openalex.org/I16351329"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.6464999914169312,"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.6464999914169312,"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.34769999980926514,"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.0010999999940395355,"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/knapsack-problem","display_name":"knapsack problem","score":1.0},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"hybrid genetic algorithm","score":0.9110000133514404},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.5699999928474426},{"id":"https://openalex.org/keywords/constraint-handling","display_name":"constraint handling","score":0.859000027179718},{"id":"https://openalex.org/keywords/local-optima-avoidance","display_name":"local optima avoidance","score":0.8259999752044678},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.6759999990463257},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7770000100135803}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9675230979919434},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7967250943183899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7278777956962585},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6657508611679077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6427165269851685},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5486834049224854},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5320785045623779},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5081272125244141},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4940188527107239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47927969694137573},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.4605262875556946},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41140252351760864},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.38411203026771545},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2361556589603424},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2363064809","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=WJFZ201307029","pdf_url":null,"source":{"id":"https://openalex.org/S2764664041","display_name":"Computer Technology and Development","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4320800559","host_organization_name":"China Computer Federation","host_organization_lineage":["https://openalex.org/P4320800559"],"host_organization_lineage_names":["China Computer Federation"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computer Technology and Development","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/W2355502774","https://openalex.org/W2372043964","https://openalex.org/W4389453824","https://openalex.org/W2373584599","https://openalex.org/W2363563123","https://openalex.org/W2385262467","https://openalex.org/W2147202667","https://openalex.org/W2371321149","https://openalex.org/W2372164290","https://openalex.org/W2169800510"],"abstract_inverted_index":{"For":[0],"knapsack":[1,20,28,106],"problem":[2,107],"solutions":[3,41],"the":[4,8,47,51,57,62,66,78],"traditional":[5,67],"methods":[6,16,68],"are":[7],"branch":[9],"and":[10,14,110],"bound":[11],"method,dynamic":[12],"programming":[13],"backtracking.Traditional":[15],"cannot":[17],"effectively":[18],"solve":[19,27],"problem.Propose":[21],"dual-structure":[22,84,102],"coding":[23,85],"genetic":[24,86,95,99],"algorithm":[25,32,49,87,100],"to":[26,70,74,104],"problem,is":[29],"an":[30],"effective":[31,109],"is":[33,91,108],"suitable":[34],"for":[35,42,88,101],"a":[36],"large":[37],"number":[38],"of":[39,53,59,61],"viable":[40],"finding":[43],"optimal":[44],"solutions,combining":[45],"with":[46],"greedy":[48],"on":[50],"processing":[52],"constraints,not":[54],"only":[55],"accelerates":[56],"speed":[58],"convergence":[60],"algorithm,but":[63],"also":[64],"overcomes":[65],"vulnerable":[69],"local":[71],"optimization":[72],"features":[73],"improve":[75],"search":[76],"efficiency.Through":[77],"computer":[79],"simulation":[80],"results":[81],"show":[82],"that":[83],"approximate":[89],"solution":[90],"better":[92],"than":[93],"basic":[94],"coding,demonstrate":[96],"using":[97],"hybrid":[98],"codes":[103],"solving":[105],"practical.":[111]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2363064809","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
