{"id":"https://openalex.org/W2142030241","doi":"https://doi.org/10.1145/1569901.1569946","title":"A cooperative and self-adaptive metaheuristic for the facility location problem","display_name":"A cooperative and self-adaptive metaheuristic for the facility location problem","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2142030241","doi":"https://doi.org/10.1145/1569901.1569946","mag":"2142030241"},"language":"en","primary_location":{"id":"doi:10.1145/1569901.1569946","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","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/A5005544026","display_name":"David Meignan","orcid":"https://orcid.org/0000-0001-7225-8615"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"David Meignan","raw_affiliation_strings":["Universit\u00e9 de Technologie de Belfort-Montb\u00e9liard, Belfort, France","[Universite de Technologie de Belfort Montbeliard, Belfort, France]"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Technologie de Belfort-Montb\u00e9liard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]},{"raw_affiliation_string":"[Universite de Technologie de Belfort Montbeliard, Belfort, France]","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110268118","display_name":"Jean-Charles Cr\u00e9put","orcid":"https://orcid.org/0000-0001-8534-2891"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Charles Cr\u00e9put","raw_affiliation_strings":["Universit\u00e9 de Technologie de Belfort-Montb\u00e9liard, Belfort, France","[Universite de Technologie de Belfort Montbeliard, Belfort, France]"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Technologie de Belfort-Montb\u00e9liard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]},{"raw_affiliation_string":"[Universite de Technologie de Belfort Montbeliard, Belfort, France]","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022466993","display_name":"Abderraf\u00ec\u00e2a Koukam","orcid":"https://orcid.org/0000-0002-7383-5143"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Abderrafiaa Koukam","raw_affiliation_strings":["Universit\u00e9 de Technologie de Belfort-Montb\u00e9liard, Belfort, France","[Universite de Technologie de Belfort Montbeliard, Belfort, France]"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Technologie de Belfort-Montb\u00e9liard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]},{"raw_affiliation_string":"[Universite de Technologie de Belfort Montbeliard, Belfort, France]","institution_ids":["https://openalex.org/I37553959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005544026"],"corresponding_institution_ids":["https://openalex.org/I37553959"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.20613842,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"317","last_page":"324"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9984999895095825,"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.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.9084992408752441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6873814463615417},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6358773708343506},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.631841242313385},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.5913125872612},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.5725192427635193},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5154002904891968},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4330247640609741},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.4315554201602936},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4289153814315796},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.41468381881713867},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3304646611213684},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1615360975265503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13930052518844604}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.9084992408752441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6873814463615417},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6358773708343506},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.631841242313385},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.5913125872612},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.5725192427635193},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5154002904891968},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4330247640609741},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.4315554201602936},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4289153814315796},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.41468381881713867},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3304646611213684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1615360975265503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13930052518844604},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1569901.1569946","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W74749346","https://openalex.org/W1668207500","https://openalex.org/W1748133846","https://openalex.org/W1765898577","https://openalex.org/W1865843128","https://openalex.org/W1875371786","https://openalex.org/W1998208600","https://openalex.org/W2000974793","https://openalex.org/W2004617458","https://openalex.org/W2039568841","https://openalex.org/W2053567707","https://openalex.org/W2062545539","https://openalex.org/W2078637295","https://openalex.org/W2081029938","https://openalex.org/W2097487309","https://openalex.org/W2105002757","https://openalex.org/W2107726111","https://openalex.org/W2114224867","https://openalex.org/W2148948822","https://openalex.org/W2152195021","https://openalex.org/W2165061252","https://openalex.org/W2166348281","https://openalex.org/W2168939712","https://openalex.org/W2170201357","https://openalex.org/W2402846924","https://openalex.org/W2606195968","https://openalex.org/W3040744424","https://openalex.org/W4211231030","https://openalex.org/W4285719527","https://openalex.org/W6674921877","https://openalex.org/W6677916085"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W4236055036","https://openalex.org/W4381955442","https://openalex.org/W2462483068","https://openalex.org/W1968397678","https://openalex.org/W4391505632","https://openalex.org/W4367557724","https://openalex.org/W1547053391","https://openalex.org/W4387932000","https://openalex.org/W4382044826"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2,142],"a":[3,16,22,50,73,103],"coalition-based":[4],"metaheuristic":[5,18],"(CBM)":[6],"to":[7,32,53,63,98,114,122],"solve":[8],"the":[9,64,79,88,100,116],"uncapacitated":[10,80],"facility":[11,81],"location":[12,82],"problem.":[13],"CBM":[14,134],"is":[15,48,72,112,135],"population-based":[17],"where":[19],"individuals":[20],"encapsulate":[21],"single":[23],"solution":[24],"and":[25,44,121,141,149],"are":[26],"considered":[27],"as":[28],"agents.":[29],"In":[30],"comparison":[31],"classical":[33],"evolutionary":[34],"algorithms,":[35],"these":[36],"agents":[37],"have":[38],"additional":[39],"capacities":[40],"of":[41,66,102,118,147],"decision,":[42],"learning":[43,119],"cooperation.":[45],"Our":[46],"approach":[47,125],"also":[49],"case":[51],"study":[52],"present":[54],"how":[55],"concepts":[56],"from":[57],"multiagent":[58],"systems'":[59],"domain":[60],"may":[61],"contribute":[62],"design":[65],"new":[67],"metaheuristics.":[68,129],"The":[69,130],"tackled":[70],"problem":[71],"well-known":[74],"combinatorial":[75],"optimization":[76],"problem,":[77,83],"namely":[78],"that":[84,133],"consists":[85],"in":[86,90,145],"determining":[87],"sites":[89],"which":[91],"some":[92],"facilities":[93],"must":[94],"be":[95],"set":[96,105],"up":[97],"satisfy":[99],"requirements":[101],"client":[104],"at":[106],"minimum":[107],"cost.":[108],"A":[109],"computational":[110],"experiment":[111],"conducted":[113],"test":[115],"performance":[117],"mechanisms":[120],"compare":[123],"our":[124],"with":[126,137],"several":[127,143],"existing":[128],"results":[131],"showed":[132],"competitive":[136],"powerful":[138],"heuristics":[139],"approaches":[140],"advantages":[144],"terms":[146],"flexibility":[148],"modularity.":[150]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}