{"id":"https://openalex.org/W7160085486","doi":"https://doi.org/10.3390/a19050352","title":"A QUBO-Driven Simulated Annealing Methodology for Solving the Shortest Path Problem in Urban Transportation Networks","display_name":"A QUBO-Driven Simulated Annealing Methodology for Solving the Shortest Path Problem in Urban Transportation Networks","publication_year":2026,"publication_date":"2026-05-02","ids":{"openalex":"https://openalex.org/W7160085486","doi":"https://doi.org/10.3390/a19050352"},"language":"en","primary_location":{"id":"doi:10.3390/a19050352","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19050352","pdf_url":"https://www.mdpi.com/1999-4893/19/5/352/pdf?version=1777705658","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/19/5/352/pdf?version=1777705658","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134266360","display_name":"Isaac Oliva-Gonz\u00e1lez","orcid":null},"institutions":[{"id":"https://openalex.org/I157492648","display_name":"Autonomous University of Queretaro","ror":"https://ror.org/00v8fdc16","country_code":"MX","type":"education","lineage":["https://openalex.org/I157492648"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Isaac Oliva-Gonz\u00e1lez","raw_affiliation_strings":["Facultad de Inform\u00e1tica, Universidad Aut\u00f3noma de Quer\u00e9taro, Av. de las Ciencias S/N, Juriquilla, Santiago de Quer\u00e9taro 76230, Mexico"],"raw_orcid":"https://orcid.org/0009-0006-2174-8861","affiliations":[{"raw_affiliation_string":"Facultad de Inform\u00e1tica, Universidad Aut\u00f3noma de Quer\u00e9taro, Av. de las Ciencias S/N, Juriquilla, Santiago de Quer\u00e9taro 76230, Mexico","institution_ids":["https://openalex.org/I157492648"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083401390","display_name":"Hugo Jim\u00e9nez\u2010Hern\u00e1ndez","orcid":"https://orcid.org/0000-0003-0827-6645"},"institutions":[{"id":"https://openalex.org/I157492648","display_name":"Autonomous University of Queretaro","ror":"https://ror.org/00v8fdc16","country_code":"MX","type":"education","lineage":["https://openalex.org/I157492648"]}],"countries":["MX"],"is_corresponding":true,"raw_author_name":"Hugo Jim\u00e9nez-Hern\u00e1ndez","raw_affiliation_strings":["Facultad de Inform\u00e1tica, Universidad Aut\u00f3noma de Quer\u00e9taro, Av. de las Ciencias S/N, Juriquilla, Santiago de Quer\u00e9taro 76230, Mexico"],"raw_orcid":"https://orcid.org/0000-0003-0827-6645","affiliations":[{"raw_affiliation_string":"Facultad de Inform\u00e1tica, Universidad Aut\u00f3noma de Quer\u00e9taro, Av. de las Ciencias S/N, Juriquilla, Santiago de Quer\u00e9taro 76230, Mexico","institution_ids":["https://openalex.org/I157492648"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5083401390"],"corresponding_institution_ids":["https://openalex.org/I157492648"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.51758038,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"5","first_page":"352","last_page":"352"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.18610000610351562,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.18610000610351562,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.16760000586509705,"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"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.11580000072717667,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6876999735832214},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.633899986743927},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5949000120162964},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5896000266075134},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5602999925613403},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.45840001106262207},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4113999903202057},{"id":"https://openalex.org/keywords/ranging","display_name":"Ranging","score":0.3926999866962433},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.39169999957084656}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7315000295639038},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6876999735832214},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.633899986743927},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6333000063896179},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5949000120162964},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5896000266075134},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5602999925613403},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.45840001106262207},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4113999903202057},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.3926999866962433},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.39169999957084656},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3716999888420105},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.358599990606308},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3434000015258789},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3188000023365021},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2833999991416931},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2660999894142151},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2597000002861023},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a19050352","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19050352","pdf_url":"https://www.mdpi.com/1999-4893/19/5/352/pdf?version=1777705658","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:59151e8df5904ed29c61e7672fa07522","is_oa":true,"landing_page_url":"https://doaj.org/article/59151e8df5904ed29c61e7672fa07522","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 19, Iss 5, p 352 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a19050352","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19050352","pdf_url":"https://www.mdpi.com/1999-4893/19/5/352/pdf?version=1777705658","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.8066772818565369,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7160085486.pdf","grobid_xml":"https://content.openalex.org/works/W7160085486.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"shortest":[1],"path":[2,46,173],"problem":[3,131,249],"presents":[4],"formidable":[5],"challenges":[6],"in":[7,209,217,231],"graph":[8],"optimization,":[9],"particularly":[10],"within":[11],"dense":[12,218],"or":[13],"large-scale":[14],"networks,":[15],"where":[16,251],"traditional":[17],"algorithms":[18],"face":[19],"serious":[20],"scalability":[21,208],"limitations.":[22],"This":[23],"paper":[24],"puts":[25],"forth":[26],"a":[27,37,71],"robust":[28],"QUBO-based":[29,252],"simulated":[30],"annealing":[31],"(QUBO-SA)":[32],"methodology":[33],"that":[34],"effectively":[35],"utilizes":[36],"Quadratic":[38],"Unconstrained":[39],"Binary":[40],"Optimization":[41],"(QUBO)":[42],"framework":[43],"to":[44,67,149,181,191,211],"encode":[45],"costs":[47],"and":[48,69,96,152,167,244],"structural":[49],"constraints":[50],"simultaneously.":[51],"Our":[52],"approach":[53],"has":[54],"been":[55],"rigorously":[56],"evaluated":[57],"on":[58,70,121,170],"synthetic":[59,108],"graphs":[60],"with":[61,119,123,141,175],"controlled":[62],"connectivity,":[63],"varying":[64],"from":[65,76,144,179,189],"n=10":[66,148],"n=40,":[68],"real-world":[72,225],"urban":[73,158],"transportation":[74],"network":[75],"Quer\u00e9taro,":[77],"Mexico,":[78],"comprising":[79],"n=443":[80],"nodes.":[81],"We":[82],"assess":[83],"performance":[84,230],"through":[85],"rigorous":[86],"probabilistic":[87],"reliability":[88,243],"indicators,":[89],"notably":[90],"the":[91,97,111,124,130,157,171,185,204,220,239],"success":[92,116,134,163],"probability":[93],"psuccess,":[94],"Time-to-Solution,":[95],"relative":[98],"runtime":[99,194],"ratio":[100],"R(ptarget),":[101],"benchmarked":[102],"against":[103],"Dijkstra\u2019s":[104],"algorithm.":[105],"In":[106],"small":[107],"instances":[109],"(n=10),":[110],"QUBO-SA":[112],"method":[113],"demonstrates":[114,207],"outstanding":[115],"rates":[117],"(psuccess\u22650.97)":[118],"runtimes":[120],"par":[122],"deterministic":[125],"baseline":[126],"(R0.99\u22481).":[127],"However,":[128],"as":[129],"size":[132],"increases,":[133],"probabilities":[135,164],"diminish":[136],"while":[137],"computational":[138,245],"overhead":[139,195],"rises,":[140],"R0.99":[142,176],"soaring":[143],"approximately":[145,197],"1.0":[146],"at":[147,154],"between":[150,165,241],"4.63":[151],"5.83":[153],"n=40.":[155],"For":[156],"network,":[159],"our":[160],"solver":[161],"achieves":[162],"0.49":[166],"0.91,":[168],"depending":[169],"specified":[172],"length,":[174],"values":[177],"ranging":[178],"2.17":[180],"9.41.":[182],"Notably,":[183],"reducing":[184],"target":[186],"confidence":[187],"level":[188],"99%":[190],"90%":[192],"cuts":[193],"by":[196],"fifty":[198],"percent":[199],"across":[200],"all":[201],"configurations.":[202],"Although":[203],"QUBO":[205],"formulation":[206],"relation":[210],"n+m,":[212],"potentially":[213],"limiting":[214],"its":[215],"use":[216],"graphs,":[219],"sparse":[221],"structure":[222],"typical":[223],"of":[224],"road":[226],"networks":[227],"enables":[228],"competitive":[229],"moderately":[232],"large":[233],"instances.":[234],"These":[235],"findings":[236],"decisively":[237],"highlight":[238],"trade-off":[240],"solution":[242],"efficiency,":[246],"pinpointing":[247],"specific":[248],"regimes":[250],"optimization":[253],"methods":[254],"are":[255],"not":[256],"only":[257],"viable":[258],"but":[259],"advantageous":[260],"for":[261],"path-optimization":[262],"tasks.":[263]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2026-05-05T00:00:00"}