{"id":"https://openalex.org/W2759366012","doi":"https://doi.org/10.1002/9781119136736.ch1","title":"Single Solution Based Metaheuristics","display_name":"Single Solution Based Metaheuristics","publication_year":2017,"publication_date":"2017-08-15","ids":{"openalex":"https://openalex.org/W2759366012","doi":"https://doi.org/10.1002/9781119136736.ch1","mag":"2759366012"},"language":"en","primary_location":{"id":"doi:10.1002/9781119136736.ch1","doi":"https://doi.org/10.1002/9781119136736.ch1","is_oa":false,"landing_page_url":"https://doi.org/10.1002/9781119136736.ch1","pdf_url":null,"source":{"id":"https://openalex.org/S4306464293","display_name":"Wiley eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Metaheuristics for Intelligent Electrical Networks","raw_type":"other"},"volume":{"id":"https://openalex.org/W2757683603","display_name":"Metaheuristics for Intelligent Electrical Networks"},"type":"book-chapter","is_traditional":true,"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/A5084835369","display_name":"Fr\u00e9d\u00e9ric H\u00e9liodore","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric H\u00e9liodore","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067068847","display_name":"Amir Nakib","orcid":"https://orcid.org/0000-0001-9620-9324","observed_orcids":["https://orcid.org/0000-0001-9620-9324"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amir Nakib","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103782308","display_name":"Boussaad Ismail","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Boussaad Ismail","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074637281","display_name":"Salma Ouchraa","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Salma Ouchraa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Laurent Schmitt","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laurent Schmitt","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3232,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58369099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9980000257492065,"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.9980000257492065,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0006000000284984708,"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"}},{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/descent-methods","display_name":"descent methods","score":0.8859999775886536},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":1.0},{"id":"https://openalex.org/keywords/tabu-search","display_name":"tabu search","score":0.9990000128746033},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.7979999780654907},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"variable neighborhood search","score":0.9739999771118164},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"guided local search","score":0.9980000257492065},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"iterated local search","score":1.0},{"id":"https://openalex.org/keywords/nelder-mead-simplex-method","display_name":"Nelder-Mead algorithm","score":0.8949999809265137},{"id":"https://openalex.org/keywords/smoothing-methods","display_name":"smoothing methods","score":0.9769999980926514},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.9210000038146973},{"id":"https://openalex.org/keywords/intensification","display_name":"intensification","score":0.8019999861717224},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8169999718666077}],"concepts":[{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.845078706741333},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7801111936569214},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7390600442886353},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.7066051959991455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7017280459403992},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6985278725624084},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.6866468787193298},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6409385800361633},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6368808746337891},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.5775137543678284},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5018637180328369},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4975943863391876},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.4240937829017639},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41207006573677063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35668647289276123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3413330912590027},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/9781119136736.ch1","doi":"https://doi.org/10.1002/9781119136736.ch1","is_oa":false,"landing_page_url":"https://doi.org/10.1002/9781119136736.ch1","pdf_url":null,"source":{"id":"https://openalex.org/S4306464293","display_name":"Wiley eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Metaheuristics for Intelligent Electrical Networks","raw_type":"other"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3012481783","https://openalex.org/W3159237862","https://openalex.org/W2336557330","https://openalex.org/W7099348174","https://openalex.org/W1536823221","https://openalex.org/W4285255275","https://openalex.org/W3007457092","https://openalex.org/W4403138909","https://openalex.org/W7118407322","https://openalex.org/W4308985497"],"abstract_inverted_index":{"The":[0,107],"objective":[1],"of":[2,31,45,57],"optimization":[3,18],"is":[4],"to":[5,131,147],"find":[6],"the":[7,10,17,38,43,90,120],"global":[8],"and/or":[9],"local":[11,80,101,105,133],"optimum":[12],"or":[13,23],"optima.":[14],"Depending":[15],"on":[16,139],"problem":[19],"being":[20],"addressed,":[21],"one":[22,30],"more":[24,35],"methods":[25,41,47,59,87,112,128],"can":[26],"be":[27,34,132,148],"applied,":[28],"and":[29,72,103,116,123],"them":[32],"may":[33],"suitable":[36],"than":[37],"others.":[39],"These":[40],"include":[42],"class":[44],"path-based":[46,58,86],"also":[48,109],"called":[49],"single-solution":[50],"metaheuristics.":[51],"This":[52],"chapter":[53,108],"introduces":[54],"a":[55,143],"number":[56],"starting":[60],"with":[61,78],"most":[62],"common":[63],"algorithms,":[64],"notably":[65],"descent":[66],"methods,":[67],"simulated":[68],"annealing,":[69],"microcanonical":[70],"annealing":[71],"even":[73],"tabu":[74],"search.":[75,106],"It":[76],"proceeds":[77],"exploratory":[79],"search":[81,102],"algorithms":[82],"that":[83,141],"incorporate":[84],"other":[85,111],"such":[88,113],"as":[89,114],"Greedy":[91],"Randomized":[92],"Adaptive":[93],"Search":[94],"(GRASP)":[95],"method,":[96,119],"variable":[97],"neighborhood":[98],"search,":[99],"guided":[100],"iterated":[104],"presents":[110],"Nelder":[115],"Mead's":[117],"simplex":[118],"noising":[121],"method":[122],"smoothing":[124],"methods.":[125],"All":[126],"these":[127],"are":[129,137],"considered":[130],"searches,":[134],"because":[135],"they":[136],"based":[138],"intensification":[140],"allows":[142],"good":[144],"quality":[145],"solution":[146],"obtained.":[149]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2017-10-06T00:00:00"}