{"id":"https://openalex.org/W4417292894","doi":"https://doi.org/10.1016/j.cor.2026.107589","title":"Steiner Traveling Salesman Problem with Time Windows and Pickup\u2013Delivery: Integrating classical and quantum optimization","display_name":"Steiner Traveling Salesman Problem with Time Windows and Pickup\u2013Delivery: Integrating classical and quantum optimization","publication_year":2026,"publication_date":"2026-06-27","ids":{"openalex":"https://openalex.org/W4417292894","doi":"https://doi.org/10.1016/j.cor.2026.107589"},"language":"en","primary_location":{"id":"doi:10.1016/j.cor.2026.107589","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107589","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.cor.2026.107589","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5116416683","display_name":"Alessia Ciacco","orcid":"https://orcid.org/0009-0002-4840-3135"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alessia Ciacco","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0002-4840-3135","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081616385","display_name":"Francesca Guerriero","orcid":"https://orcid.org/0000-0002-3887-1317"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Francesca Guerriero","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039681328","display_name":"Eneko Osaba","orcid":"https://orcid.org/0000-0001-7863-9910"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eneko Osaba","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7863-9910","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3570,"currency":"USD","value_usd":3570},"apc_paid":{"value":3570,"currency":"USD","value_usd":3570},"fwci":5.6608,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.90864303,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"194","issue":null,"first_page":"107589","last_page":"107589"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.8385000228881836,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.8385000228881836,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.016899999231100082,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.008700000122189522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8532999753952026},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5918999910354614},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5289000272750854},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5227000117301941},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5110999941825867},{"id":"https://openalex.org/keywords/pickup","display_name":"Pickup","score":0.48820000886917114},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45820000767707825},{"id":"https://openalex.org/keywords/quantum-annealing","display_name":"Quantum annealing","score":0.44670000672340393},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4307999908924103}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8532999753952026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6373999714851379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6000999808311462},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5918999910354614},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5289000272750854},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5227000117301941},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5110999941825867},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.48820000886917114},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45820000767707825},{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.44670000672340393},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4307999908924103},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.40630000829696655},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4047999978065491},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.3443000018596649},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.34130001068115234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3248000144958496},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.30399999022483826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3003999888896942},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.2897000014781952},{"id":"https://openalex.org/C31829261","wikidata":"https://www.wikidata.org/wiki/Q1929885","display_name":"Transportation theory","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2614000141620636},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.2547999918460846},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.2500999867916107}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/j.cor.2026.107589","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107589","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2508.17896","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2508.17896","pdf_url":"https://arxiv.org/pdf/2508.17896","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2508.17896","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2508.17896","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.1016/j.cor.2026.107589","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107589","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5224457966","display_name":null,"funder_award_id":"KK-2025/00074","funder_id":"https://openalex.org/F4320321705","funder_display_name":"Eusko Jaurlaritza"}],"funders":[{"id":"https://openalex.org/F4320321705","display_name":"Eusko Jaurlaritza","ror":"https://ror.org/00pz2fp31"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,97,114],"propose":[1,75],"the":[2,26,29,49,66,95,135,158,166,198,202,210,214,221],"Steiner":[3,30],"Traveling":[4,31],"Salesman":[5,32],"Problem":[6,33],"with":[7,34,163,184],"Time":[8],"Windows":[9],"and":[10,12,16,38,41,60,83,112,125,137,142,152,201,220,228],"Pickup":[11],"Delivery,":[13],"an":[14,80],"advanced":[15],"practical":[17],"extension":[18],"of":[19,28,51,70,94,139,213,223],"classical":[20,141,151,159,185],"routing":[21],"models.":[22],"This":[23],"variant":[24],"integrates":[25,181],"characteristics":[27],"time-window":[35],"constraints,":[36],"pickup":[37],"delivery":[39],"operations":[40],"vehicle":[42],"capacity":[43],"limitations.":[44],"These":[45],"features":[46],"closely":[47],"mirror":[48],"complexities":[50],"contemporary":[52],"logistics":[53,59],"challenges,":[54],"including":[55],"last-mile":[56],"distribution,":[57],"reverse":[58],"on-demand":[61],"service":[62],"scenarios.":[63],"To":[64],"tackle":[65],"inherent":[67],"computational":[68,110,218],"difficulties":[69],"this":[71],"NP-hard":[72],"problem,":[73],"we":[74],"two":[76,215],"specialized":[77],"mathematical":[78],"formulations:":[79],"arc-based":[81],"model":[82],"a":[84,100,117,130,176],"node-oriented":[85],"model,":[86],"each":[87],"designed":[88,121],"to":[89,122,196],"capture":[90],"distinct":[91],"structural":[92,211],"aspects":[93],"problem.":[96],"further":[98],"introduce":[99,116],"preprocessing":[101,203,224],"reduction":[102,204],"method":[103],"that":[104,180],"eliminates":[105],"redundant":[106],"arcs,":[107],"significantly":[108],"enhancing":[109],"performance":[111,136],"scalability.":[113],"also":[115],"benchmark":[118],"instance":[119],"generator":[120],"create":[123],"diverse":[124],"scalable":[126],"test":[127],"scenarios,":[128],"providing":[129],"flexible":[131],"framework":[132],"for":[133,188],"assessing":[134],"robustness":[138],"both":[140],"quantum":[143,153,167,182],"optimization":[144,154,186],"methods.":[145],"Both":[146],"formulations":[147,200],"are":[148,161,194],"implemented":[149],"using":[150],"approaches.":[155],"In":[156],"particular,":[157],"models":[160],"solved":[162],"Gurobi,":[164],"whereas":[165],"implementation":[168],"is":[169],"carried":[170],"out":[171],"on":[172,225],"D-Wave's":[173],"LeapCQMHybrid":[174],"platform,":[175],"hybrid":[177],"quantum-classical":[178],"environment":[179],"annealing":[183],"techniques":[187],"constrained":[189],"problem":[190,226],"solving.":[191],"Numerical":[192],"experiments":[193],"conducted":[195],"validate":[197],"proposed":[199],"method.":[205],"The":[206],"analyses":[207],"performed":[208],"assess":[209],"properties":[212],"models,":[216],"their":[217],"behavior,":[219],"impact":[222],"size":[227],"solution":[229],"efficiency.":[230]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}