{"id":"https://openalex.org/W1970287911","doi":"https://doi.org/10.4018/ijaec.2014010104","title":"Solution of \u201cHard\u201d Knapsack Instances Using Quantum Inspired Evolutionary Algorithm","display_name":"Solution of \u201cHard\u201d Knapsack Instances Using Quantum Inspired Evolutionary Algorithm","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1970287911","doi":"https://doi.org/10.4018/ijaec.2014010104","mag":"1970287911"},"language":"en","primary_location":{"id":"doi:10.4018/ijaec.2014010104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijaec.2014010104","pdf_url":null,"source":{"id":"https://openalex.org/S144758376","display_name":"International Journal of Applied Evolutionary Computation","issn_l":"1942-3594","issn":["1942-3594","1942-3608"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Evolutionary Computation","raw_type":"journal-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/A5072764860","display_name":"C. Patvardhan","orcid":null},"institutions":[{"id":"https://openalex.org/I178254495","display_name":"Dayalbagh Educational Institute","ror":"https://ror.org/04q4j2f69","country_code":"IN","type":"education","lineage":["https://openalex.org/I178254495"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. Patvardhan","raw_affiliation_strings":["Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India","Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India","institution_ids":["https://openalex.org/I178254495"]},{"raw_affiliation_string":"Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India#TAB#","institution_ids":["https://openalex.org/I178254495"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034129361","display_name":"Sulabh Bansal","orcid":"https://orcid.org/0000-0003-4993-8879"},"institutions":[{"id":"https://openalex.org/I178254495","display_name":"Dayalbagh Educational Institute","ror":"https://ror.org/04q4j2f69","country_code":"IN","type":"education","lineage":["https://openalex.org/I178254495"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sulabh Bansal","raw_affiliation_strings":["Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India","Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India","institution_ids":["https://openalex.org/I178254495"]},{"raw_affiliation_string":"Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India#TAB#","institution_ids":["https://openalex.org/I178254495"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108463602","display_name":"Anand Srivastav","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Anand Srivastav","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t zu Kiel, Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu Kiel, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4971,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.88972921,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"5","issue":"1","first_page":"52","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"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.9994000196456909,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9975000023841858,"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.996399998664856,"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.8784826993942261},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7818669080734253},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6827617287635803},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5861735343933105},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5753219127655029},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5105019807815552},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5022845268249512},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.467779278755188},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.439424067735672},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4385153651237488},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.42078647017478943}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8784826993942261},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7818669080734253},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6827617287635803},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5861735343933105},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5753219127655029},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5105019807815552},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5022845268249512},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.467779278755188},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.439424067735672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4385153651237488},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.42078647017478943},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijaec.2014010104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijaec.2014010104","pdf_url":null,"source":{"id":"https://openalex.org/S144758376","display_name":"International Journal of Applied Evolutionary Computation","issn_l":"1942-3594","issn":["1942-3594","1942-3608"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Evolutionary Computation","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jaec00:v:5:y:2014:i:1:p:52-68","is_oa":false,"landing_page_url":"http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijaec.2014010104","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1488163535","https://openalex.org/W1492845317","https://openalex.org/W1493556863","https://openalex.org/W1546189072","https://openalex.org/W1557489584","https://openalex.org/W1566637627","https://openalex.org/W1606853695","https://openalex.org/W1825489654","https://openalex.org/W1966693694","https://openalex.org/W1981434190","https://openalex.org/W1985329394","https://openalex.org/W1989184333","https://openalex.org/W2017316844","https://openalex.org/W2037698864","https://openalex.org/W2045492613","https://openalex.org/W2047501124","https://openalex.org/W2056380589","https://openalex.org/W2067258022","https://openalex.org/W2077604419","https://openalex.org/W2079932996","https://openalex.org/W2116400650","https://openalex.org/W2116899094","https://openalex.org/W2122274805","https://openalex.org/W2122960219","https://openalex.org/W2127172809","https://openalex.org/W2136885049","https://openalex.org/W2145068995","https://openalex.org/W2147553941","https://openalex.org/W2153455505","https://openalex.org/W2156293131","https://openalex.org/W2165066103","https://openalex.org/W2165102583","https://openalex.org/W2170853840","https://openalex.org/W2341171179","https://openalex.org/W4236127247","https://openalex.org/W6636227002","https://openalex.org/W6685044440"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2005493932","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W2133099979","https://openalex.org/W3103982436"],"abstract_inverted_index":{"Knapsack":[0],"Problem":[1],"(KP)":[2],"is":[3,85,115],"a":[4,86,91],"popular":[5],"combinatorial":[6],"optimization":[7],"problem":[8,123],"having":[9],"application":[10],"in":[11,22,58],"many":[12],"technical":[13],"and":[14,30,46],"economic":[15],"areas.":[16],"Several":[17],"attempts":[18],"have":[19,76],"been":[20],"made":[21],"past":[23],"to":[24,34],"solve":[25,35,55],"the":[26,69,133,136,143],"problem.":[27],"Various":[28],"exact":[29,74,138],"non-exact":[31],"approaches":[32,62,75],"exist":[33,53],"KP.":[36],"Exact":[37],"algorithms":[38],"for":[39,132],"KP":[40,56],"are":[41,129],"based":[42,95],"on":[43],"either":[44],"branch":[45],"bound":[47],"or":[48],"dynamic":[49],"programming":[50],"technique.":[51,97],"Heuristics":[52],"which":[54,117],"non-exactly":[57],"lesser":[59],"time.":[60],"Heuristic":[61],"do":[63],"not":[64],"provide":[65],"any":[66],"guarantee":[67],"regarding":[68],"quality":[70],"of":[71,88,101,113,135],"solution":[72],"whereas":[73],"high":[77],"worst":[78],"case":[79],"complexities.":[80],"Quantum-inspired":[81,106],"Evolutionary":[82,89,107],"Algorithm":[83,108],"(QEA)":[84],"subclass":[87],"Algorithm,":[90],"naturally":[92],"inspired":[93],"population":[94],"search":[96],"QEA":[98],"uses":[99],"concepts":[100],"quantum":[102],"computing.":[103],"An":[104],"engineered":[105],"(QEA-E),":[109],"an":[110],"improved":[111],"version":[112],"QEA,":[114],"presented":[116],"quickly":[118],"solves":[119],"extremely":[120],"large":[121],"spanner":[122],"instances":[124],"(e.g.":[125],"290,000":[126],"items)":[127],"that":[128],"very":[130],"difficult":[131],"state":[134],"art":[137],"algorithm":[139],"as":[140,142],"well":[141],"original":[144],"QEA.":[145]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}