{"id":"https://openalex.org/W4413311666","doi":"https://doi.org/10.1145/3729878.3746697","title":"Optimal Restart Strategies for Parameter-dependent Optimization Algorithms","display_name":"Optimal Restart Strategies for Parameter-dependent Optimization Algorithms","publication_year":2025,"publication_date":"2025-08-19","ids":{"openalex":"https://openalex.org/W4413311666","doi":"https://doi.org/10.1145/3729878.3746697"},"language":"en","primary_location":{"id":"doi:10.1145/3729878.3746697","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729878.3746697","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3729878.3746697","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074674311","display_name":"Lisa Sch\u00f6nenberger","orcid":"https://orcid.org/0009-0007-5694-7067"},"institutions":[{"id":"https://openalex.org/I675453","display_name":"Vorarlberg University of Applied Sciences","ror":"https://ror.org/031wyx077","country_code":"AT","type":"education","lineage":["https://openalex.org/I675453"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Lisa Sch\u00f6nenberger","raw_affiliation_strings":["Ulm University, Institute of Theoretical Computer Science, Ulm, Germany, Vorarlberg University of Applied Sciences, Research Center Business Informatics, Dornbirn, Austria"],"affiliations":[{"raw_affiliation_string":"Ulm University, Institute of Theoretical Computer Science, Ulm, Germany, Vorarlberg University of Applied Sciences, Research Center Business Informatics, Dornbirn, Austria","institution_ids":["https://openalex.org/I675453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058598249","display_name":"Hans-Georg Beyer","orcid":"https://orcid.org/0000-0002-7455-8686"},"institutions":[{"id":"https://openalex.org/I675453","display_name":"Vorarlberg University of Applied Sciences","ror":"https://ror.org/031wyx077","country_code":"AT","type":"education","lineage":["https://openalex.org/I675453"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Hans-Georg Beyer","raw_affiliation_strings":["Vorarlberg University of Applied Sciences, Research Center Business Informatics, Dornbirn, Austria"],"affiliations":[{"raw_affiliation_string":"Vorarlberg University of Applied Sciences, Research Center Business Informatics, Dornbirn, Austria","institution_ids":["https://openalex.org/I675453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074674311"],"corresponding_institution_ids":["https://openalex.org/I675453"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10725682,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"273","last_page":"284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.996399998664856,"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.996399998664856,"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.9857000112533569,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9740999937057495,"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.6481838822364807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49598345160484314},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.43693429231643677},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.401143342256546},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1811498999595642}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6481838822364807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49598345160484314},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.43693429231643677},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.401143342256546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1811498999595642}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3729878.3746697","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729878.3746697","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3729878.3746697","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729878.3746697","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3820721721","display_name":null,"funder_award_id":"P33702-N","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1503296932","https://openalex.org/W1576660662","https://openalex.org/W2005483113","https://openalex.org/W2033032438","https://openalex.org/W2097263684","https://openalex.org/W2127220062","https://openalex.org/W2154318861","https://openalex.org/W2475725195","https://openalex.org/W2810845241","https://openalex.org/W3158741236","https://openalex.org/W4384155549","https://openalex.org/W4396909847","https://openalex.org/W4400078705"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4366549320","https://openalex.org/W4287863136","https://openalex.org/W3006015132","https://openalex.org/W2965078190","https://openalex.org/W4408464351","https://openalex.org/W2140656843","https://openalex.org/W3040644038","https://openalex.org/W3203633096"],"abstract_inverted_index":{"This":[0],"paper":[1,248],"examines":[2],"restart":[3,64,76,106],"strategies":[4,77],"for":[5,36,59,103,146],"algorithms":[6,221],"whose":[7],"successful":[8],"termination":[9],"depends":[10],"on":[11,201],"a":[12,147,157,232],"parameter":[13],"\u03bb.":[14,37,74],"After":[15],"each":[16,63],"restart,":[17],"\u03bb":[18,61,152],"is":[19,27,31,52,87,108,153,165,238],"increased,":[20],"until":[21],"the":[22,39,69,91,97,114,127,161,187,192,202,207,224,241,249],"algorithm":[23,40],"terminates":[24],"successfully.":[25],"It":[26],"assumed":[28],"that":[29,68,109,138,172,185],"there":[30,54,177],"an":[32,56,179],"unknown,":[33],"optimal":[34,57,98,115,180,196,204],"value":[35,45,181],"For":[38],"to":[41,89,96,113,222],"run":[42],"successfully,":[43],"this":[44,120,174,195,247],"must":[46],"be":[47,136,170],"surpassed.":[48],"The":[49],"key":[50],"question":[51],"whether":[53],"exists":[55,178],"strategy":[58,82,107,141,149,175,209],"selecting":[60],"after":[62],"taking":[65],"into":[66,80],"account":[67],"computational":[70,93],"costs":[71],"increase":[72],"with":[73,210],"Potential":[75],"are":[78,129,143,244],"classified":[79],"parameter-dependent":[81],"types.":[83],"A":[84,100],"loss":[85,128,163],"function":[86,164],"introduced":[88],"quantify":[90],"wasted":[92],"cost":[94],"relative":[95,112,162,189],"strategy.":[99],"crucial":[101],"requirement":[102],"any":[104],"efficient":[105],"its":[110,236],"loss,":[111],"\u03bb,":[116],"remains":[117],"bounded.":[118,144,166],"To":[119],"end,":[121],"upper":[122],"and":[123,240],"lower":[124],"bounds":[125,133],"of":[126,219,235],"derived.":[130],"Using":[131],"these":[132],"it":[134,168],"will":[135,169],"shown":[137],"not":[139,199],"all":[140],"types":[142],"However,":[145],"particular":[148],"type,":[150,176],"where":[151],"increased":[154],"multiplicatively":[155],"by":[156],"constant":[158],"factor":[159],"\u03c1,":[160],"Furthermore,":[167],"demonstrated":[171],"within":[173],"\u03c1":[182,211],"=":[183,212],"2":[184,213],"minimizes":[186],"maximum":[188],"loss.":[190],"In":[191],"asymptotic":[193],"limit,":[194],"choice":[197],"does":[198],"depend":[200],"unknown":[203],"A.":[205],"While":[206],"multiplicative":[208],"was":[214],"already":[215],"used":[216],"in":[217,230,246],"implementations":[218],"evolutionary":[220],"control":[223],"population":[225],"size":[226],"showing":[227],"acceptable":[228],"performance":[229],"applications,":[231],"formal":[233],"proof":[234],"optimality":[237],"presented":[239],"underlying":[242],"conditions":[243],"discussed":[245],"first":[250],"time.":[251]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}