{"id":"https://openalex.org/W1605768620","doi":"https://doi.org/10.1142/7438","title":"Theory of Randomized Search Heuristics","display_name":"Theory of Randomized Search Heuristics","publication_year":2011,"publication_date":"2011-02-01","ids":{"openalex":"https://openalex.org/W1605768620","doi":"https://doi.org/10.1142/7438","mag":"1605768620"},"language":"en","primary_location":{"id":"doi:10.1142/7438","is_oa":false,"landing_page_url":"https://doi.org/10.1142/7438","pdf_url":null,"source":{"id":"https://openalex.org/S4210230093","display_name":"Theoretical computer science","issn_l":"1793-849X","issn":["1793-849X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Series on Theoretical Computer Science","raw_type":"edited-book"},"type":"book","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/A5108074862","display_name":"Anne Auger","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Anne Auger","raw_affiliation_strings":["INRIAFrance"],"affiliations":[{"raw_affiliation_string":"INRIAFrance","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102961331","display_name":"Benjamin Doerr","orcid":"https://orcid.org/0000-0002-9786-220X"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Benjamin Doerr","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr InformatikGermany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr InformatikGermany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108074862"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":13.5582,"has_fulltext":false,"cited_by_count":312,"citation_normalized_percentile":{"value":0.98696282,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9832000136375427,"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.9832000136375427,"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.9412999749183655,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.930899977684021,"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/heuristics","display_name":"Heuristics","score":0.7427172660827637},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5205727219581604}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7427172660827637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5205727219581604},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/7438","is_oa":false,"landing_page_url":"https://doi.org/10.1142/7438","pdf_url":null,"source":{"id":"https://openalex.org/S4210230093","display_name":"Theoretical computer science","issn_l":"1793-849X","issn":["1793-849X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Series on Theoretical Computer Science","raw_type":"edited-book"},{"id":"pmh:oai:edoc.mpg.de:618718","is_oa":false,"landing_page_url":"http://edoc.mpg.de/618718","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book"},{"id":"pmh:oai:pure.atira.dk:publications/91b85d95-7226-4cc6-8491-464dc7091409","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/91b85d95-7226-4cc6-8491-464dc7091409","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Auger , A & Witt , C 2012 , ' Theory of Randomized Search Heuristics ' , Algorithmica , vol. 64 , no. 4 , pp. 621-622 . https://doi.org/10.1007/s00453-012-9686-7","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.5699999928474426,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W2401723157","https://openalex.org/W2952904874","https://openalex.org/W4297690216"],"abstract_inverted_index":{"Randomized":[0],"search":[1,31,72,111,151],"heuristics":[2,73,112,152],"such":[3,74],"as":[4,75],"evolutionary":[5],"algorithms,":[6,8],"genetic":[7],"evolution":[9],"strategies,":[10],"ant":[11],"colony":[12],"and":[13,61,80,91,97,118,123,130,153],"particle":[14],"swarm":[15],"optimization":[16,24],"turn":[17],"out":[18],"to":[19,45,162],"be":[20,138],"highly":[21],"successful":[22],"for":[23,125,144,155],"in":[25,38,52,67,109,132,146,164],"practice.":[26],"The":[27,135],"theory":[28],"of":[29,49,70,87,100,142,149,179],"randomized":[30,71,110,150],"heuristics,":[32],"which":[33],"has":[34],"been":[35],"growing":[36],"rapidly":[37],"the":[39,47,50,62,68,95,147,176],"last":[40],"five":[41],"years,":[42],"also":[43,154],"attempts":[44],"explain":[46],"success":[48],"methods":[51],"practical":[53],"applications.":[54],"This":[55],"book":[56,136],"covers":[57],"both":[58],"classical":[59],"results":[60],"most":[63],"recent":[64],"theoretical":[65],"developments":[66],"field":[69],"runtime":[76],"analysis,":[77],"drift":[78],"analysis":[79],"convergence.":[81],"Each":[82],"chapter":[83],"provides":[84],"an":[85,139,168],"overview":[86],"a":[88,115],"particular":[89],"domain":[90,148],"gives":[92],"insights":[93],"into":[94],"proofs":[96],"proof":[98],"techniques":[99],"more":[101],"specialized":[102],"areas.":[103],"Open":[104],"problems":[105,122],"still":[106],"remain":[107],"widely":[108],"--":[113],"being":[114],"relatively":[116],"young":[117],"vast":[119],"field.":[120,166],"These":[121],"directions":[124],"future":[126],"research":[127],"are":[128,158],"addressed":[129],"discussed":[131],"this":[133,165],"book.":[134],"will":[137,173],"essential":[140],"source":[141],"reference":[143],"experts":[145],"researchers":[156],"who":[157],"involved":[159],"or":[160],"ready":[161],"embark":[163],"As":[167],"advanced":[169],"textbook,":[170],"graduate":[171],"students":[172],"benefit":[174],"from":[175],"comprehensive":[177],"coverage":[178],"topics.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":23},{"year":2018,"cited_by_count":24},{"year":2017,"cited_by_count":28},{"year":2016,"cited_by_count":34},{"year":2015,"cited_by_count":35},{"year":2014,"cited_by_count":28},{"year":2013,"cited_by_count":26},{"year":2012,"cited_by_count":25}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}