{"id":"https://openalex.org/W1973155857","doi":"https://doi.org/10.1109/is.2012.6335159","title":"Meta-RaPS with Path Relinking for the 0&amp;#x2013;1 multidimensional knapsack problem","display_name":"Meta-RaPS with Path Relinking for the 0&amp;#x2013;1 multidimensional knapsack problem","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W1973155857","doi":"https://doi.org/10.1109/is.2012.6335159","mag":"1973155857"},"language":"en","primary_location":{"id":"doi:10.1109/is.2012.6335159","is_oa":false,"landing_page_url":"https://doi.org/10.1109/is.2012.6335159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 6th IEEE INTERNATIONAL CONFERENCE INTELLIGENT SYSTEMS","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/A5060786745","display_name":"Arif Arin","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arif Arin","raw_affiliation_strings":["Department of Engineering Management and Systems Engineering, Old Dominion University, Norfolk, VA, USA","Dept. of Engineering Management and Systems Engineering, Old Dominion University, 241 Kaufman Hall, Norfolk, VA 23529 USA"],"affiliations":[{"raw_affiliation_string":"Department of Engineering Management and Systems Engineering, Old Dominion University, Norfolk, VA, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Dept. of Engineering Management and Systems Engineering, Old Dominion University, 241 Kaufman Hall, Norfolk, VA 23529 USA","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054798706","display_name":"Ghaith Rabadi","orcid":"https://orcid.org/0000-0001-8145-313X"},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ghaith Rabadi","raw_affiliation_strings":["Department of Engineering Management and Systems Engineering, Old Dominion University, Norfolk, VA, USA","Dept. of Engineering Management and Systems Engineering, Old Dominion University, 241 Kaufman Hall, Norfolk, VA 23529 USA"],"affiliations":[{"raw_affiliation_string":"Department of Engineering Management and Systems Engineering, Old Dominion University, Norfolk, VA, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Dept. of Engineering Management and Systems Engineering, Old Dominion University, 241 Kaufman Hall, Norfolk, VA 23529 USA","institution_ids":["https://openalex.org/I81365321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060786745"],"corresponding_institution_ids":["https://openalex.org/I81365321"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.1279404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"1","issue":null,"first_page":"347","last_page":"352"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994999766349792,"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.9994999766349792,"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/T12707","display_name":"Vehicle License Plate Recognition","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9152871370315552},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.654853105545044},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6491152048110962},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3749929666519165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26124274730682373},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2508683204650879},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.19382882118225098}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9152871370315552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.654853105545044},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6491152048110962},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3749929666519165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26124274730682373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2508683204650879},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.19382882118225098}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/is.2012.6335159","is_oa":false,"landing_page_url":"https://doi.org/10.1109/is.2012.6335159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 6th IEEE INTERNATIONAL CONFERENCE INTELLIGENT SYSTEMS","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W179940750","https://openalex.org/W1568906816","https://openalex.org/W1964498901","https://openalex.org/W1968972013","https://openalex.org/W1968989933","https://openalex.org/W1980922590","https://openalex.org/W1982788340","https://openalex.org/W2003677825","https://openalex.org/W2009651104","https://openalex.org/W2011041206","https://openalex.org/W2034368997","https://openalex.org/W2040055824","https://openalex.org/W2043513057","https://openalex.org/W2045411541","https://openalex.org/W2049967755","https://openalex.org/W2052307457","https://openalex.org/W2061292604","https://openalex.org/W2072270250","https://openalex.org/W2078628347","https://openalex.org/W2081941840","https://openalex.org/W2085317433","https://openalex.org/W2089088038","https://openalex.org/W2089811144","https://openalex.org/W2096131675","https://openalex.org/W2099009360","https://openalex.org/W2099861483","https://openalex.org/W2106045974","https://openalex.org/W2116303323","https://openalex.org/W2284330674","https://openalex.org/W2506386042","https://openalex.org/W2509790245","https://openalex.org/W2798741797","https://openalex.org/W4212899374","https://openalex.org/W4252732074","https://openalex.org/W4253572765","https://openalex.org/W4256012320"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W2168163332","https://openalex.org/W3177799343"],"abstract_inverted_index":{"The":[0,116],"rapid":[1],"increase":[2],"of":[3,7,38,43,58,91],"dimensions":[4],"and":[5,27,40,68,93],"complexity":[6],"real":[8],"life":[9],"problems":[10],"makes":[11],"it":[12],"more":[13],"difficult":[14],"to":[15,30,78,124],"find":[16],"optimal":[17],"solutions":[18,82],"by":[19],"traditional":[20],"optimization":[21,85],"methods.":[22],"This":[23],"challenge":[24],"requires":[25],"intelligent":[26],"sophisticated":[28],"algorithms":[29],"make":[31],"the":[32,47,56,89,126],"right":[33],"decisions":[34],"given":[35],"a":[36,41,113],"set":[37],"inputs":[39],"variety":[42],"possible":[44],"actions.":[45],"In":[46],"problem":[48,120],"solving":[49],"arena,":[50],"this":[51],"definition":[52],"is":[53,110],"transformed":[54],"into":[55,95,102],"term":[57],"artificial":[59],"intelligence.":[60],"Artificial":[61],"intelligence":[62],"emerges":[63],"in":[64,70],"metaheuristics":[65,74],"via":[66],"memory":[67,92],"learning":[69,94],"algorithms.":[71],"Many":[72],"successful":[73],"employ":[75],"\u201cintelligent\u201d":[76],"procedures":[77],"obtain":[79],"high":[80],"quality":[81],"for":[83,105],"discrete":[84],"problems.":[86],"To":[87],"demonstrate":[88],"contribution":[90],"metaheuristics,":[96],"Path":[97],"Relinking":[98],"will":[99,121],"be":[100,122],"incorporated":[101],"Meta-RaPS":[103],"(Metaheuristic":[104],"Randomized":[106],"Priority":[107],"Search)":[108],"which":[109],"classified":[111],"as":[112],"memoryless":[114],"metaheuristic.":[115],"0-1":[117],"multidimensional":[118],"knapsack":[119],"used":[123],"evaluate":[125],"proposed":[127],"algorithm.":[128]},"counts_by_year":[{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
