{"id":"https://openalex.org/W7123396945","doi":"https://doi.org/10.48550/arxiv.2601.07258","title":"Simulated Annealing-based Candidate Optimization for Batch Acquisition Functions","display_name":"Simulated Annealing-based Candidate Optimization for Batch Acquisition Functions","publication_year":2026,"publication_date":"2026-01-12","ids":{"openalex":"https://openalex.org/W7123396945","doi":"https://doi.org/10.48550/arxiv.2601.07258"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.07258","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07258","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.07258","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015003176","display_name":"Sk Md Ahnaf Akif Alvi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alvi, Sk Md Ahnaf Akif","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122958376","display_name":"Raymundo Arr\u00f3yave","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arr\u00f3yave, Raymundo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015668401","display_name":"Douglas Allaire","orcid":"https://orcid.org/0000-0003-3460-8412"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Allaire, Douglas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015003176"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.8285999894142151,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.8285999894142151,"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/T11053","display_name":"Process Optimization and Integration","score":0.03269999846816063,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T11413","display_name":"Risk and Portfolio Optimization","score":0.027899999171495438,"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/simulated-annealing","display_name":"Simulated annealing","score":0.8181999921798706},{"id":"https://openalex.org/keywords/bayesian-optimization","display_name":"Bayesian optimization","score":0.8050000071525574},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6180999875068665},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5145999789237976},{"id":"https://openalex.org/keywords/test-functions-for-optimization","display_name":"Test functions for optimization","score":0.505299985408783},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4392000138759613},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.4205999970436096},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4115999937057495},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.4047999978065491}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.8181999921798706},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.8050000071525574},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6180999875068665},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6169000267982483},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5569000244140625},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5145999789237976},{"id":"https://openalex.org/C150185637","wikidata":"https://www.wikidata.org/wiki/Q7705773","display_name":"Test functions for optimization","level":4,"score":0.505299985408783},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.4205999970436096},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4115999937057495},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.4047999978065491},{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.3817000091075897},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.3707999885082245},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.3695000112056732},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3122999966144562},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3111000061035156},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.3041999936103821},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.29899999499320984},{"id":"https://openalex.org/C2983394010","wikidata":"https://www.wikidata.org/wiki/Q19885330","display_name":"Continuous variable","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C2778915421","wikidata":"https://www.wikidata.org/wiki/Q3643177","display_name":"Performance improvement","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26249998807907104},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.07258","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07258","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.07258","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07258","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Bayesian":[0,190],"Optimization":[1],"with":[2],"multi-objective":[3,87,189],"acquisition":[4,18,66,202],"functions":[5,67],"such":[6],"as":[7,68],"q-Expected":[8],"Hypervolume":[9],"Improvement":[10],"(qEHVI)":[11],"requires":[12],"efficient":[13],"candidate":[14,35,62,186],"optimization":[15,26,63,74,88,175,187],"to":[16,71,119,196],"maximize":[17],"function":[19,203],"values.":[20],"Traditional":[21],"approaches":[22,176],"rely":[23],"on":[24],"continuous":[25,73],"methods":[27,40,199],"like":[28,177],"Sequential":[29],"Least":[30],"Squares":[31],"Programming":[32],"(SLSQP)":[33],"for":[34,61,130,188,200],"selection.":[36],"However,":[37],"these":[38],"gradient-based":[39,198],"can":[41,180],"become":[42],"trapped":[43],"in":[44,48,64,121],"local":[45],"optima,":[46],"particularly":[47,128],"complex":[49],"or":[50],"high-dimensional":[51],"objective":[52,152],"landscapes.":[53],"This":[54],"paper":[55],"presents":[56],"a":[57,193],"simulated":[58,79,111,136,158,178],"annealing-based":[59],"approach":[60,81],"batch":[65,201],"an":[69],"alternative":[70,195],"conventional":[72],"methods.":[75],"We":[76],"evaluate":[77],"our":[78],"annealing":[80,112,137,159,179],"against":[82],"SLSQP":[83,120],"across":[84],"four":[85],"benchmark":[86],"problems:":[89],"ZDT1":[90],"(30D,":[91],"2":[92,100,105],"objectives),":[93,97,101],"DTLZ2":[94,131],"(7D,":[95],"3":[96],"Kursawe":[98],"(3D,":[99],"and":[102,132,143,163,184],"Latent-Aware":[103,133],"(4D,":[104],"objectives).":[106],"Our":[107],"results":[108],"demonstrate":[109],"that":[110,157,173],"consistently":[113],"achieves":[114],"superior":[115],"hypervolume":[116,141],"performance":[117],"compared":[118],"most":[122],"test":[123],"functions.":[124],"The":[125,148],"improvement":[126],"is":[127],"pronounced":[129],"problems,":[134],"where":[135],"reaches":[138],"significantly":[139],"higher":[140],"values":[142],"maintains":[144],"better":[145],"convergence":[146],"characteristics.":[147],"histogram":[149],"analysis":[150],"of":[151,166],"space":[153],"coverage":[154],"further":[155],"reveals":[156],"explores":[160],"more":[161,182],"diverse":[162],"optimal":[164],"regions":[165],"the":[167],"Pareto":[168],"front.":[169],"These":[170],"findings":[171],"suggest":[172],"metaheuristic":[174],"provide":[181],"robust":[183],"effective":[185],"optimization,":[191],"offering":[192],"promising":[194],"traditional":[197],"optimization.":[204]},"counts_by_year":[],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2026-01-14T00:00:00"}