{"id":"https://openalex.org/W4352981338","doi":"https://doi.org/10.1109/iscmi56532.2022.10068488","title":"A Cooperative Population-Based Method for Solving the Max-Min Knapsack Problem with Multi-scenarios","display_name":"A Cooperative Population-Based Method for Solving the Max-Min Knapsack Problem with Multi-scenarios","publication_year":2022,"publication_date":"2022-11-26","ids":{"openalex":"https://openalex.org/W4352981338","doi":"https://doi.org/10.1109/iscmi56532.2022.10068488"},"language":"en","primary_location":{"id":"doi:10.1109/iscmi56532.2022.10068488","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/iscmi56532.2022.10068488","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)","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/A5030041960","display_name":"M\u00e9ziane A\u0131\u0308der","orcid":"https://orcid.org/0000-0001-7195-810X"},"institutions":[{"id":"https://openalex.org/I157169809","display_name":"University of Sciences and Technology Houari Boumediene","ror":"https://ror.org/02kb89c09","country_code":"DZ","type":"education","lineage":["https://openalex.org/I157169809"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"M\u00e9ziane A\u00efder","raw_affiliation_strings":["USTHB,LaROMaD, Fac. Maths.,Alger,Algérie,16111"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"USTHB,LaROMaD, Fac. Maths.,Alger,Algérie,16111","institution_ids":["https://openalex.org/I157169809"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044647341","display_name":"Mhand Hifi","orcid":"https://orcid.org/0000-0002-1031-7701"},"institutions":[{"id":"https://openalex.org/I4401200255","display_name":"Eco-proc\u00e9d\u00e9s, optimisation et aide \u00e0 la d\u00e9cision","ror":"https://ror.org/02bn7hs48","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4401200255","https://openalex.org/I4647051"]},{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mhand Hifi","raw_affiliation_strings":["UPJV, EPROAD UR 4669,Amiens,France,80000"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UPJV, EPROAD UR 4669,Amiens,France,80000","institution_ids":["https://openalex.org/I4401200255","https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034440879","display_name":"Khadidja Latram","orcid":null},"institutions":[{"id":"https://openalex.org/I157169809","display_name":"University of Sciences and Technology Houari Boumediene","ror":"https://ror.org/02kb89c09","country_code":"DZ","type":"education","lineage":["https://openalex.org/I157169809"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Khadidja Latram","raw_affiliation_strings":["USTHB,LaROMaD, Fac. Maths.,Alger,Algérie,16111"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"USTHB,LaROMaD, Fac. Maths.,Alger,Algérie,16111","institution_ids":["https://openalex.org/I157169809"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2775,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65260438,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"118","last_page":"123"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9822373986244202},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7107235789299011},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6453084945678711},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6206408739089966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5292408466339111},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5256826877593994},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4947742819786072},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.488651305437088},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4636572003364563},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.44228595495224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3756617605686188}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9822373986244202},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7107235789299011},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6453084945678711},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6206408739089966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5292408466339111},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5256826877593994},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4947742819786072},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.488651305437088},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4636572003364563},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.44228595495224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3756617605686188},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iscmi56532.2022.10068488","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/iscmi56532.2022.10068488","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04124203v1","is_oa":false,"landing_page_url":"https://u-picardie.hal.science/hal-04124203","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI), Nov 2022, Toronto, Canada. pp.118-123, ⟨10.1109/ISCMI56532.2022.10068488⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.44999998807907104,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1979423668","https://openalex.org/W1987669018","https://openalex.org/W2007851455","https://openalex.org/W2025706613","https://openalex.org/W2035820111","https://openalex.org/W2050044094","https://openalex.org/W2061438946","https://openalex.org/W2076163541","https://openalex.org/W2536466699","https://openalex.org/W2921106043","https://openalex.org/W4244015093","https://openalex.org/W4246598646"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2393014972","https://openalex.org/W2357796514","https://openalex.org/W2357595179","https://openalex.org/W2169800510","https://openalex.org/W2351136238","https://openalex.org/W3171554204","https://openalex.org/W3199776955","https://openalex.org/W3112089036","https://openalex.org/W2167807475"],"abstract_inverted_index":{"In":[0,122],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,61,70,74,83,97,100,112,126,129,160,163,172,181,186],"max-min":[6],"knapsack":[7,29],"problem":[8],"with":[9,104,117],"multi-scenarios,":[10],"where":[11,87,174],"a":[12,28,33,53,88,105,118,132,146],"cooperative":[13],"population":[14],"based":[15,81],"method":[16,79,164],"is":[17,25,50,67,80,115,137,151,165],"designed":[18,78],"for":[19,95],"approximately":[20],"solving":[21],"it.":[22],"Its":[23,48],"instance":[24],"represented":[26],"by":[27],"of":[30,35,55,90,99,108,128,134,162,171],"fixed":[31],"capacity,":[32],"set":[34,107],"items":[36,56],"(with":[37],"weights":[38],"and":[39,41,63,148],"profits)":[40],"possible":[42],"scenarios":[43],"related":[44,110],"to":[45,51,111,124,142,154,180],"overall":[46],"items.":[47],"goal":[49],"select":[52],"subset":[54],"whose":[57,64],"total":[58,65],"weight":[59],"fills":[60],"knapsack,":[62],"profit":[66],"maximized":[68],"in":[69,140,185],"worst":[71],"scenario":[72],"according":[73],"whole":[75],"scenarios.":[76],"The":[77],"upon":[82],"grey":[84],"wolf":[85],"optimizer,":[86],"series":[89,133],"local":[91],"searches":[92],"are":[93,178],"employed":[94],"highlighting":[96],"performance":[98],"method.":[101],"It":[102],"starts":[103],"reference":[106],"positions":[109],"wolves,":[113],"which":[114],"provided":[116,176],"random":[119],"greedy":[120],"procedure.":[121],"order":[123,141],"enhance":[125],"behavior":[127,161],"standard":[130],"version,":[131],"exploring":[135],"strategies":[136],"employed.":[138],"Next,":[139],"avoid":[143],"premature":[144],"convergence,":[145],"drop":[147],"rebuild":[149],"strategy":[150],"added":[152],"hopping":[153],"exploit":[155],"new":[156],"unexplored":[157],"subspaces.":[158],"Finally,":[159],"computationally":[166],"analyzed":[167],"on":[168],"benchmark":[169],"instances":[170],"literature,":[173],"its":[175],"results":[177,183,189],"compared":[179],"best":[182],"available":[184],"literature.":[187],"Encouraging":[188],"have":[190],"been":[191],"obtained.":[192]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}