{"id":"https://openalex.org/W2379547707","doi":null,"title":"Multiple Bits Greedy Mutation-based Genetic Algorithm for Knapsack Problem","display_name":"Multiple Bits Greedy Mutation-based Genetic Algorithm for Knapsack Problem","alternate_titles":[],"publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2379547707","mag":"2379547707"},"language":"en","primary_location":{"id":"mag:2379547707","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=GXSF201304008","pdf_url":null,"source":{"id":"https://openalex.org/S2764446469","display_name":"Journal of Guangxi Normal University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4361729663","host_organization_name":"Guangxi Normal University","host_organization_lineage":["https://openalex.org/P4361729663"],"host_organization_lineage_names":["Guangxi Normal University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Guangxi Normal University","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2379547707"],"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/A5084103452","display_name":"Zhao Xin-cha","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Zhao Xin-cha","raw_affiliation_strings":["School of Science,Beijing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Science,Beijing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084103452"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.6273999810218811,"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.6273999810218811,"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.3582000136375427,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.0034000000450760126,"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":0.9070000052452087},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.8270000219345093},{"id":"https://openalex.org/keywords/crossover-operator","display_name":"crossover operator","score":0.6970000267028809},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.7139999866485596},{"id":"https://openalex.org/keywords/population-diversity","display_name":"population diversity","score":0.871999979019165},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9300000071525574}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.82987380027771},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7882221937179565},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7869112491607666},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.6974326372146606},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6289648413658142},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5655328035354614},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5324407815933228},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.525654673576355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5143481492996216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46881794929504395},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.44417884945869446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3824569582939148},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.16206493973731995},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12724411487579346},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.10444095730781555},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.08824855089187622},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"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/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2379547707","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=GXSF201304008","pdf_url":null,"source":{"id":"https://openalex.org/S2764446469","display_name":"Journal of Guangxi Normal University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4361729663","host_organization_name":"Guangxi Normal University","host_organization_lineage":["https://openalex.org/P4361729663"],"host_organization_lineage_names":["Guangxi Normal University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Guangxi Normal University","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2388258794","https://openalex.org/W4392972279","https://openalex.org/W4389451836","https://openalex.org/W2895169725","https://openalex.org/W2375713280","https://openalex.org/W2385628901","https://openalex.org/W2363563123","https://openalex.org/W128059576","https://openalex.org/W2353525267","https://openalex.org/W2380329296"],"abstract_inverted_index":{"Crossover":[0],"and":[1,25,103],"mutation":[2,12,69,85],"operators":[3],"are":[4],"the":[5,31,40,45,59,62,76,109],"core":[6],"operations":[7],"of":[8,47,61],"genetic":[9,99],"algorithm.":[10],"Efficient":[11],"operator":[13,70],"not":[14],"only":[15],"plays":[16],"an":[17,52],"important":[18],"role":[19],"to":[20,38,73],"enhance":[21],"local":[22],"search":[23],"ability":[24],"keep":[26],"population":[27],"diverse,but":[28],"also":[29],"optimizes":[30],"offspring":[32],"individuals":[33],"with":[34,75,82,108],"targeted":[35],"amending":[36],"strategy":[37],"correct":[39],"present":[41],"trajectory.":[42],"Thus,it":[43],"enhances":[44],"efficiency":[46],"optimizing.":[48],"Firstly,this":[49],"paper":[50],"proposes":[51],"even":[53],"better":[54],"extremely":[55,83],"greedy":[56,64,68,84,97],"algorithm":[57],"on":[58,89],"basis":[60],"very":[63],"algorithm.Then,a":[65],"multiple":[66,77,95],"bits":[67,96],"is":[71],"designed":[72],"deal":[74],"consecutive":[78],"or":[79],"discontinuous":[80],"genes":[81],"operation.":[86],"Experimental":[87],"results":[88],"classic":[90],"knapsack":[91],"instances":[92],"show":[93],"that":[94],"mutation-based":[98],"algorithm(MBGGA)":[100],"has":[101],"efficient,effective":[102],"steady":[104],"performance":[105],"when":[106],"comparing":[107],"existing":[110],"methods.":[111]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2379547707","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
