{"id":"https://openalex.org/W2017993102","doi":"https://doi.org/10.1109/grc.2009.5255033","title":"The improved genetic algorithm for solving knapsack problem based on Handel-C","display_name":"The improved genetic algorithm for solving knapsack problem based on Handel-C","publication_year":2009,"publication_date":"2009-08-01","ids":{"openalex":"https://openalex.org/W2017993102","doi":"https://doi.org/10.1109/grc.2009.5255033","mag":"2017993102"},"language":"en","primary_location":{"id":"doi:10.1109/grc.2009.5255033","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grc.2009.5255033","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Granular Computing","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/A5102822513","display_name":"Yi Yang","orcid":"https://orcid.org/0009-0002-1682-1957"},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]},{"id":"https://openalex.org/I206451062","display_name":"University of Architecture, Civil Engineering and Geodesy","ror":"https://ror.org/033cz7157","country_code":"BG","type":"education","lineage":["https://openalex.org/I206451062"]}],"countries":["BG","CN"],"is_corresponding":true,"raw_author_name":"Yi Yang","raw_affiliation_strings":["School of Electronic and Information Engineering, Anhui University of Architecture, Hefei, China","School of Electronic and Information Engineering, Anhui University of Architecture, Hefei 230022, China"],"affiliations":[{"raw_affiliation_string":"School of Electronic and Information Engineering, Anhui University of Architecture, Hefei, China","institution_ids":["https://openalex.org/I143868143"]},{"raw_affiliation_string":"School of Electronic and Information Engineering, Anhui University of Architecture, Hefei 230022, China","institution_ids":["https://openalex.org/I206451062"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013364083","display_name":"Qiansheng Fang","orcid":"https://orcid.org/0009-0005-7344-0028"},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]},{"id":"https://openalex.org/I206451062","display_name":"University of Architecture, Civil Engineering and Geodesy","ror":"https://ror.org/033cz7157","country_code":"BG","type":"education","lineage":["https://openalex.org/I206451062"]}],"countries":["BG","CN"],"is_corresponding":false,"raw_author_name":"Qian-sheng Fang","raw_affiliation_strings":["School of Electronic and Information Engineering, Anhui University of Architecture, Hefei, China","School of Electronic and Information Engineering, Anhui University of Architecture, Hefei 230022, China"],"affiliations":[{"raw_affiliation_string":"School of Electronic and Information Engineering, Anhui University of Architecture, Hefei, China","institution_ids":["https://openalex.org/I143868143"]},{"raw_affiliation_string":"School of Electronic and Information Engineering, Anhui University of Architecture, Hefei 230022, China","institution_ids":["https://openalex.org/I206451062"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102822513"],"corresponding_institution_ids":["https://openalex.org/I143868143","https://openalex.org/I206451062"],"apc_list":null,"apc_paid":null,"fwci":0.3236,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58065619,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":null,"first_page":"702","last_page":"705"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9821000099182129,"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/T12288","display_name":"Optimization and Search Problems","score":0.9724000096321106,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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":0.9867923259735107},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.8127840161323547},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.7101687788963318},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6266352534294128},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6128236651420593},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5502106547355652},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.48944345116615295},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.44054919481277466},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4152410626411438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23139163851737976}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9867923259735107},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.8127840161323547},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.7101687788963318},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6266352534294128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6128236651420593},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5502106547355652},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.48944345116615295},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.44054919481277466},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4152410626411438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23139163851737976},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/grc.2009.5255033","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grc.2009.5255033","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Granular Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1986940172","https://openalex.org/W2348499642","https://openalex.org/W2360394640","https://openalex.org/W2360481720","https://openalex.org/W2790980272"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3169691842","https://openalex.org/W3166857172","https://openalex.org/W1701984136","https://openalex.org/W2122137596","https://openalex.org/W2060645964","https://openalex.org/W1984121220","https://openalex.org/W1601835603","https://openalex.org/W1556368910"],"abstract_inverted_index":{"Knapsack":[0],"problem":[1,15],"is":[2,78],"applied":[3],"broadly":[4],"to":[5,24],"practice":[6],"in":[7,45,47],"resource":[8],"allocation,":[9,13],"investment":[10],"decision-making,":[11],"storage":[12],"loading":[14],"and":[16,29,59],"so":[17],"on.":[18],"The":[19,37,50],"paper":[20],"adopts":[21],"Handel-C":[22],"language":[23],"program":[25],"for":[26],"the":[27,40,48,64,68,72,75],"simple":[28],"improved":[30,51,76],"genetic":[31,52],"algorithm":[32,53,77],"that":[33],"solve":[34],"knapsack":[35],"problem.":[36],"procedures":[38],"of":[39,67,74],"two":[41,69],"algorithms":[42],"are":[43],"provided":[44],"detail":[46],"paper.":[49],"enhances":[54],"obviously":[55],"global":[56],"search":[57],"ability":[58],"converging":[60],"velocity":[61],"through":[62],"contrasting":[63],"experiment":[65],"results":[66],"algorithms.":[70],"Thus":[71],"effectiveness":[73],"demonstrated.":[79]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}