{"id":"https://openalex.org/W2013318791","doi":"https://doi.org/10.1016/s0377-2217(02)00401-0","title":"Genetic and Nelder\u2013Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions","display_name":"Genetic and Nelder\u2013Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions","publication_year":2003,"publication_date":"2003-04-05","ids":{"openalex":"https://openalex.org/W2013318791","doi":"https://doi.org/10.1016/s0377-2217(02)00401-0","mag":"2013318791"},"language":"en","primary_location":{"id":"doi:10.1016/s0377-2217(02)00401-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0377-2217(02)00401-0","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","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/A5004011502","display_name":"Rachid Chelouah","orcid":"https://orcid.org/0000-0002-7473-2680"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rachid Chelouah","raw_affiliation_strings":["Laboratoire de Mod\u00e9lisation et Optimisation des Syst\u00e8mes en Electronique, IUT de Cergy-Pontoise, D\u00e9partement GEII rue d\u2019Eragny, Neuville sur Oise, 95031 Cergy-Pontoise, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire de Mod\u00e9lisation et Optimisation des Syst\u00e8mes en Electronique, IUT de Cergy-Pontoise, D\u00e9partement GEII rue d\u2019Eragny, Neuville sur Oise, 95031 Cergy-Pontoise, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008986898","display_name":"Patrick Siarry","orcid":"https://orcid.org/0000-0002-5722-4115"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I197681013","display_name":"Universit\u00e9 Paris-Est Cr\u00e9teil","ror":"https://ror.org/05ggc9x40","country_code":"FR","type":"education","lineage":["https://openalex.org/I197681013"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Patrick Siarry","raw_affiliation_strings":["Laboratoire d\u2019Etude et de Recherche en Instrumentation Signaux et Syst\u00e8mes, Facult\u00e9 des Sciences et de Technologie LERISS, Universit\u00e9 de Paris 12, 61 avenue du G\u00e9n\u00e9ral de Gaulle, 94010 Cr\u00e9teil Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Etude et de Recherche en Instrumentation Signaux et Syst\u00e8mes, Facult\u00e9 des Sciences et de Technologie LERISS, Universit\u00e9 de Paris 12, 61 avenue du G\u00e9n\u00e9ral de Gaulle, 94010 Cr\u00e9teil Cedex, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I197681013"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008986898"],"corresponding_institution_ids":["https://openalex.org/I197681013","https://openalex.org/I204730241"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":19.6916,"has_fulltext":false,"cited_by_count":314,"citation_normalized_percentile":{"value":0.99366229,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"148","issue":"2","first_page":"335","last_page":"348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.7737743854522705},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.733284592628479},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7106557488441467},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6578304171562195},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6547268033027649},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6457779407501221},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.588001549243927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5463190674781799},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.5385251045227051},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5295646786689758},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5254793763160706},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.5210739374160767},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4386191666126251},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.4241219758987427},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4181877374649048},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4114152193069458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2214965522289276},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.19723841547966003},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17794084548950195}],"concepts":[{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.7737743854522705},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.733284592628479},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7106557488441467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6578304171562195},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6547268033027649},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6457779407501221},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.588001549243927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5463190674781799},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.5385251045227051},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5295646786689758},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5254793763160706},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5210739374160767},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4386191666126251},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.4241219758987427},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4181877374649048},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4114152193069458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2214965522289276},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.19723841547966003},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17794084548950195},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0377-2217(02)00401-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0377-2217(02)00401-0","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:eee:ejores:v:148:y:2003:i:2:p:335-348","is_oa":false,"landing_page_url":"http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00401-0","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1549119093","https://openalex.org/W1571059645","https://openalex.org/W1607768087","https://openalex.org/W1650224336","https://openalex.org/W1748199557","https://openalex.org/W1988155782","https://openalex.org/W1994996222","https://openalex.org/W2002592134","https://openalex.org/W2031103608","https://openalex.org/W2062960021","https://openalex.org/W2068687506","https://openalex.org/W2069144035","https://openalex.org/W2069514727","https://openalex.org/W2096590200","https://openalex.org/W2106263764","https://openalex.org/W2135038320","https://openalex.org/W2142183404","https://openalex.org/W2148490951","https://openalex.org/W2163528881","https://openalex.org/W2169061438","https://openalex.org/W2171074980","https://openalex.org/W2396809543","https://openalex.org/W2476502391","https://openalex.org/W2610216665","https://openalex.org/W2739559597","https://openalex.org/W3004042307","https://openalex.org/W3023540311","https://openalex.org/W6636486754","https://openalex.org/W6648972576","https://openalex.org/W6741930073"],"related_works":["https://openalex.org/W2476121495","https://openalex.org/W2460653416","https://openalex.org/W2382688260","https://openalex.org/W2370323645","https://openalex.org/W4237368524","https://openalex.org/W1543589757","https://openalex.org/W1533229056","https://openalex.org/W4247343174","https://openalex.org/W2367586046","https://openalex.org/W2794858631"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":17}],"updated_date":"2026-06-13T07:54:00.901334","created_date":"2025-10-10T00:00:00"}