{"id":"https://openalex.org/W2074212800","doi":"https://doi.org/10.1007/s10852-005-9029-7","title":"COSEARCH: A Parallel Cooperative Metaheuristic","display_name":"COSEARCH: A Parallel Cooperative Metaheuristic","publication_year":2006,"publication_date":"2006-02-14","ids":{"openalex":"https://openalex.org/W2074212800","doi":"https://doi.org/10.1007/s10852-005-9029-7","mag":"2074212800"},"language":"en","primary_location":{"id":"doi:10.1007/s10852-005-9029-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10852-005-9029-7","pdf_url":null,"source":{"id":"https://openalex.org/S80764785","display_name":"Journal of Mathematical Modelling and Algorithms","issn_l":"1570-1166","issn":["1570-1166","1572-9214"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Mathematical Modelling and Algorithms","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/A5107857046","display_name":"El\u2010Ghazali Talbi","orcid":null},"institutions":[{"id":"https://openalex.org/I174424907","display_name":"Laboratoire d'Informatique Fondamentale de Lille","ror":"https://ror.org/05rhg0h08","country_code":"FR","type":"facility","lineage":["https://openalex.org/I174424907"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"El-Ghazali Talbi","raw_affiliation_strings":["Universit\u00e9 des Sciences et Technologies de Lille LIFL \u2013 CNRS \u2013 INRIA Futurs, Bat. M3 Cit\u00e9 Scientifique, 59655, Villeneuve d'Ascq, France","Universit\u00e9 des Sciences et Technologies de Lille LIFL \u2013 CNRS \u2013 INRIA Futurs"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 des Sciences et Technologies de Lille LIFL \u2013 CNRS \u2013 INRIA Futurs, Bat. M3 Cit\u00e9 Scientifique, 59655, Villeneuve d'Ascq, France","institution_ids":["https://openalex.org/I174424907","https://openalex.org/I1294671590","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Universit\u00e9 des Sciences et Technologies de Lille LIFL \u2013 CNRS \u2013 INRIA Futurs","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087902993","display_name":"Vincent Bachelet","orcid":null},"institutions":[{"id":"https://openalex.org/I174424907","display_name":"Laboratoire d'Informatique Fondamentale de Lille","ror":"https://ror.org/05rhg0h08","country_code":"FR","type":"facility","lineage":["https://openalex.org/I174424907"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vincent Bachelet","raw_affiliation_strings":["Universit\u00e9 des Sciences et Technologies de Lille LIFL \u2013 CNRS \u2013 INRIA Futurs, Bat. M3 Cit\u00e9 Scientifique, 59655, Villeneuve d'Ascq, France","Universit\u00e9 des Sciences et Technologies de Lille LIFL \u2013 CNRS \u2013 INRIA Futurs"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 des Sciences et Technologies de Lille LIFL \u2013 CNRS \u2013 INRIA Futurs, Bat. M3 Cit\u00e9 Scientifique, 59655, Villeneuve d'Ascq, France","institution_ids":["https://openalex.org/I174424907","https://openalex.org/I1294671590","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Universit\u00e9 des Sciences et Technologies de Lille LIFL \u2013 CNRS \u2013 INRIA Futurs","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107857046"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I174424907"],"apc_list":null,"apc_paid":null,"fwci":4.6835,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.9454189,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"5","issue":"1","first_page":"5","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983000159263611,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.7510072588920593},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.7215993404388428},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.672958493232727},{"id":"https://openalex.org/keywords/adaptive-memory","display_name":"Adaptive memory","score":0.5916345119476318},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.5511115789413452},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5235457420349121},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.46684321761131287},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.44299134612083435},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4284174144268036},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4247405230998993},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.36127761006355286},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29442596435546875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1460786759853363}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7510072588920593},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7215993404388428},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.672958493232727},{"id":"https://openalex.org/C30390489","wikidata":"https://www.wikidata.org/wiki/Q4680748","display_name":"Adaptive memory","level":3,"score":0.5916345119476318},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.5511115789413452},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5235457420349121},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.46684321761131287},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.44299134612083435},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4284174144268036},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4247405230998993},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.36127761006355286},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29442596435546875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1460786759853363},{"id":"https://openalex.org/C169900460","wikidata":"https://www.wikidata.org/wiki/Q2200417","display_name":"Cognition","level":2,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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/C169760540","wikidata":"https://www.wikidata.org/wiki/Q207011","display_name":"Neuroscience","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10852-005-9029-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10852-005-9029-7","pdf_url":null,"source":{"id":"https://openalex.org/S80764785","display_name":"Journal of Mathematical Modelling and Algorithms","issn_l":"1570-1166","issn":["1570-1166","1572-9214"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Mathematical Modelling and Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W22448193","https://openalex.org/W163403078","https://openalex.org/W239257767","https://openalex.org/W360615779","https://openalex.org/W1489902578","https://openalex.org/W1503085769","https://openalex.org/W1525105362","https://openalex.org/W1557589462","https://openalex.org/W1559215823","https://openalex.org/W1833366547","https://openalex.org/W1952294948","https://openalex.org/W1971700807","https://openalex.org/W2009832821","https://openalex.org/W2011039300","https://openalex.org/W2036737894","https://openalex.org/W2053567707","https://openalex.org/W2098677716","https://openalex.org/W2121035504","https://openalex.org/W2142183404","https://openalex.org/W2150834164","https://openalex.org/W2153996255","https://openalex.org/W2165061252","https://openalex.org/W2187867568","https://openalex.org/W2401300680","https://openalex.org/W2403173049","https://openalex.org/W2798944314","https://openalex.org/W2976664243","https://openalex.org/W3040744424","https://openalex.org/W4230109265","https://openalex.org/W4285719527","https://openalex.org/W4301173492"],"related_works":["https://openalex.org/W3022707108","https://openalex.org/W4247343174","https://openalex.org/W1987877777","https://openalex.org/W2168643831","https://openalex.org/W4249421848","https://openalex.org/W2104017828","https://openalex.org/W2494989913","https://openalex.org/W2075514833","https://openalex.org/W1605808593","https://openalex.org/W4388740316"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}