{"id":"https://openalex.org/W7166719646","doi":"https://doi.org/10.7148/2026-0608","title":"On the computational scalability of simheuristics in high-dimensional search spaces","display_name":"On the computational scalability of simheuristics in high-dimensional search spaces","publication_year":2026,"publication_date":"2026-06-23","ids":{"openalex":"https://openalex.org/W7166719646","doi":"https://doi.org/10.7148/2026-0608"},"language":null,"primary_location":{"id":"doi:10.7148/2026-0608","is_oa":true,"landing_page_url":"https://doi.org/10.7148/2026-0608","pdf_url":"https://doi.org/10.7148/2026-0608","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2026 Proceedings edited by Filippo Sanfilippo, Florenc Demrozi, Fabio Sgarbossa, Mohammad Poursina","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.7148/2026-0608","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062193600","display_name":"Philip Cammin","orcid":"https://orcid.org/0000-0001-7502-7003"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philip Cammin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139668311","display_name":"Jingjing Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jingjing Yu","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":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"608","last_page":"615"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.7749999761581421,"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"}},"topics":[{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.7749999761581421,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.04690000042319298,"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/T10142","display_name":"Formal Methods in Verification","score":0.016100000590085983,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.703000009059906},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5947999954223633},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5807999968528748},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4986000061035156},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4498000144958496},{"id":"https://openalex.org/keywords/interdependence","display_name":"Interdependence","score":0.44440001249313354},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4375999867916107},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.398499995470047}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7200999855995178},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.703000009059906},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5947999954223633},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5807999968528748},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4986000061035156},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4498000144958496},{"id":"https://openalex.org/C185874996","wikidata":"https://www.wikidata.org/wiki/Q269699","display_name":"Interdependence","level":2,"score":0.44440001249313354},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4375999867916107},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4343999922275543},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.398499995470047},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.39590001106262207},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3939000070095062},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3919999897480011},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.3077000081539154},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3046000003814697},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C66024118","wikidata":"https://www.wikidata.org/wiki/Q1122506","display_name":"Computational model","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.27000001072883606},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.26460000872612},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.25949999690055847},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7148/2026-0608","is_oa":true,"landing_page_url":"https://doi.org/10.7148/2026-0608","pdf_url":"https://doi.org/10.7148/2026-0608","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2026 Proceedings edited by Filippo Sanfilippo, Florenc Demrozi, Fabio Sgarbossa, Mohammad Poursina","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.7148/2026-0608","is_oa":true,"landing_page_url":"https://doi.org/10.7148/2026-0608","pdf_url":"https://doi.org/10.7148/2026-0608","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2026 Proceedings edited by Filippo Sanfilippo, Florenc Demrozi, Fabio Sgarbossa, Mohammad Poursina","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7224901914596558}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166719646.pdf","grobid_xml":"https://content.openalex.org/works/W7166719646.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Simheuristics":[0],"offer":[1,67],"a":[2,68,84,101],"robust":[3],"framework":[4],"by":[5,15,40,55],"integrating":[6],"metaheuristic":[7],"search":[8],"capabilities":[9],"with":[10],"the":[11,24,41,98,111,116],"high-fidelity":[12],"modeling":[13],"offered":[14],"simulation.":[16],"This":[17],"combination":[18],"is":[19,110],"particularly":[20],"effective":[21],"for":[22,52,119],"capturing":[23],"complex":[25],"interdependencies":[26],"and":[27,62,91,114],"procedural":[28],"constraints":[29],"of":[30,45,108],"real-world":[31],"systems.":[32],"Despite":[33],"these":[34],"advantages,":[35],"practitioners":[36],"are":[37],"often":[38],"deterred":[39],"perceived":[42],"computational":[43],"overhead":[44],"simulations":[46],"compared":[47],"to":[48],"mathematical":[49],"heuristics.":[50],"However,":[51],"problems":[53],"characterized":[54],"tightly":[56],"coupled":[57],"constraints,":[58],"high-dimensional":[59],"decision":[60],"spaces,":[61],"event-based":[63],"logic,":[64],"simheuristics":[65],"can":[66],"significant":[69],"performance":[70],"advantage,":[71],"although":[72],"this":[73,80],"has":[74],"rarely":[75],"been":[76],"quantified.":[77],"To":[78],"address":[79],"gap,":[81],"we":[82],"investigate":[83],"transit":[85],"synchronization":[86],"problem":[87],"using":[88],"exact,":[89],"heuristic,":[90],"simheuristic":[92,99],"approaches.":[93],"Our":[94],"results":[95],"demonstrate":[96],"that":[97],"achieves":[100],"0%":[102],"optimality":[103],"gap":[104],"and,":[105],"in":[106],"terms":[107],"runtime,":[109],"most":[112],"stable":[113],"generally":[115],"fastest":[117],"approach":[118],"large-scale":[120],"instances.":[121]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-07-01T00:00:00"}