{"id":"https://openalex.org/W2268535910","doi":"https://doi.org/10.17562/pb-51-7","title":"The Multiple Knapsack Problem Approached by a Binary Differential Evolution Algorithm with Adaptive Parameters","display_name":"The Multiple Knapsack Problem Approached by a Binary Differential Evolution Algorithm with Adaptive Parameters","alternate_titles":[],"publication_year":2015,"publication_date":"2015-01-31","ids":{"openalex":"https://openalex.org/W2268535910","doi":"https://doi.org/10.17562/pb-51-7","mag":"2268535910"},"language":"en","primary_location":{"id":"doi:10.17562/pb-51-7","doi":"https://doi.org/10.17562/pb-51-7","is_oa":false,"landing_page_url":"https://doi.org/10.17562/pb-51-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210186437","display_name":"Polibits","issn_l":"1870-9044","issn":["1870-9044","2395-8618"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Polibits","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2268535910"],"child_works_count":0,"type":"article","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/A5091258019","display_name":"Leanderson Andr\u00e9","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Leanderson Andr\u00e9","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071906708","display_name":"Rafael Stubs Parpinelli","orcid":"https://orcid.org/0000-0001-7326-5032","observed_orcids":["https://orcid.org/0000-0001-7326-5032"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Rafael Stubs Parpinelli","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.394,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.61334168,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":93},"biblio":{"volume":"51","issue":null,"first_page":"47","last_page":"54"},"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.9868000149726868,"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.9868000149726868,"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.011599999852478504,"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":9.999999747378752e-05,"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/multiple-knapsack-problem","display_name":"multiple knapsack problem","score":0.9679999947547913},{"id":"https://openalex.org/keywords/binary-differential-evolution","display_name":"binary differential evolution","score":0.8840000033378601},{"id":"https://openalex.org/keywords/adaptive-parameter-control","display_name":"adaptive parameter control","score":0.906000018119812},{"id":"https://openalex.org/keywords/mutation-rate-adaptation","display_name":"mutation rate adaptation","score":0.734000027179718},{"id":"https://openalex.org/keywords/0-1-knapsack-problem","display_name":"0-1 knapsack problem","score":0.8610000014305115},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.8619999885559082},{"id":"https://openalex.org/keywords/genetic-algorithm-comparison","display_name":"genetic algorithm comparison","score":0.7979999780654907}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9809283018112183},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6315217018127441},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5928003787994385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5754554271697998},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5154000520706177},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4609639346599579},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45504796504974365},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4303011894226074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3287135362625122},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0660807192325592}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.17562/pb-51-7","doi":"https://doi.org/10.17562/pb-51-7","is_oa":false,"landing_page_url":"https://doi.org/10.17562/pb-51-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210186437","display_name":"Polibits","issn_l":"1870-9044","issn":["1870-9044","2395-8618"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Polibits","raw_type":"journal-article"},{"id":"pmh:oai:redalyc.org:402641203008","doi":null,"is_oa":false,"landing_page_url":"https://www.redalyc.org/articulo.oa?id=402641203008","pdf_url":null,"source":{"id":"https://openalex.org/S4377196100","display_name":"Redalyc (Universidad Aut\u00f3noma del Estado de M\u00e9xico)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I179647637","host_organization_name":"Universidad Aut\u00f3noma del Estado de M\u00e9xico","host_organization_lineage":["https://openalex.org/I179647637"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Polibits (M\u00e9xico) Vol.51","raw_type":"art\u00edculo cient\u00edfico"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W5201354","https://openalex.org/W36858941","https://openalex.org/W137575789","https://openalex.org/W1489512665","https://openalex.org/W1563965013","https://openalex.org/W1595159159","https://openalex.org/W1972300623","https://openalex.org/W1982052938","https://openalex.org/W2027981492","https://openalex.org/W2078341713","https://openalex.org/W2080365948","https://openalex.org/W2094859983","https://openalex.org/W2119396705","https://openalex.org/W2135366549","https://openalex.org/W2146879413"],"related_works":["https://openalex.org/W956368620","https://openalex.org/W2736355270","https://openalex.org/W2392315465","https://openalex.org/W2566904163","https://openalex.org/W2970857346","https://openalex.org/W2119545340","https://openalex.org/W3043752008","https://openalex.org/W2152957777","https://openalex.org/W2897554731","https://openalex.org/W2748796848"],"abstract_inverted_index":{"\"In":[0],"this":[1],"paper":[2],"the":[3,25,30,34,76,115,120,131],"well-known":[4],"0-1":[5],"Multiple":[6],"KnapsackProblem":[7],"(MKP)":[8],"is":[9,20,27,123],"approached":[10],"by":[11],"an":[12,98,124],"adaptive":[13,104],"Binary":[14],"DifferentialEvolution":[15],"(aBDE)":[16],"algorithm.":[17],"The":[18,50,82,107],"MKP":[19],"a":[21,47,60,88,127],"NP-hard":[22],"optimizationproblem":[23],"and":[24,56,93,97,126,133],"aim":[26],"to":[28,46,129],"maximize":[29],"total":[31,35],"profit":[32],"subjectedto":[33],"weight":[36],"in":[37],"each":[38,68],"knapsack":[39],"that":[40,63,110],"must":[41],"be":[42],"less":[43],"than":[44,114],"orequal":[45],"given":[48],"limit.":[49],"aBDE":[51],"self":[52],"adjusts":[53],"two":[54],"parameters,perturbation":[55],"mutation":[57],"rates,":[58],"using":[59,72],"linear":[61],"adaptationprocedure":[62],"changes":[64],"their":[65],"probabilities":[66],"at":[67],"generation.Results":[69],"were":[70,84],"obtained":[71],"11":[73],"instances":[74],"of":[75,80],"problem":[77],"withdifferent":[78],"degrees":[79],"complexity.":[81],"results":[83,108,113],"compared":[85],"usingaBDE,":[86],"BDE,":[87],"standard":[89],"Genetic":[90,100],"Algorithm":[91,101],"(GA)":[92],"its":[94,103],"adaptiveversion":[95],"(aGA),":[96],"island-inspired":[99],"(IGA)and":[102],"version":[105],"(aIGA).":[106],"show":[109],"aBDEobtained":[111],"better":[112],"other":[116],"algorithms.":[117],"This":[118],"indicatesthat":[119],"proposed":[121],"approach":[122],"interesting":[125],"promisingstrategy":[128],"control":[130],"parameters":[132],"for":[134],"optimization":[135],"ofcomplex":[136],"problems.\"":[137]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2268535910","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
