{"id":"https://openalex.org/W4380422914","doi":"https://doi.org/10.1162/evco_a_00319","title":"Approaching the Traveling Tournament Problem with Randomized Beam Search","display_name":"Approaching the Traveling Tournament Problem with Randomized Beam Search","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4380422914","doi":"https://doi.org/10.1162/evco_a_00319","pmid":"https://pubmed.ncbi.nlm.nih.gov/37310276"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00319","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00319","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015931756","display_name":"Nikolaus Frohner","orcid":"https://orcid.org/0000-0002-0629-9379"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Nikolaus Frohner","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Vienna, Austria nfrohner@ac.tuwien.ac.at"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Vienna, Austria nfrohner@ac.tuwien.ac.at","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110869846","display_name":"Bernhard Neumann","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Bernhard Neumann","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Vienna, Austria bernhard.neumann96@gmail.com"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Vienna, Austria bernhard.neumann96@gmail.com","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016266468","display_name":"Giulio Pace","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Giulio Pace","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Vienna, Austria giulio.pace93@gmail.com"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Vienna, Austria giulio.pace93@gmail.com","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030647388","display_name":"G\u00fcnther R. Raidl","orcid":"https://orcid.org/0000-0002-3293-177X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"G\u00fcnther R. Raidl","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien, Vienna, Austria raidl@ac.tuwien.ac.at"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien, Vienna, Austria raidl@ac.tuwien.ac.at","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5015931756","https://openalex.org/A5016266468","https://openalex.org/A5030647388","https://openalex.org/A5110869846"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":1.199,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.80488425,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"31","issue":"3","first_page":"233","last_page":"257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9629999995231628,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6540393829345703},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.596458375453949},{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.5868628025054932},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5467341542243958},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.480023056268692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47437888383865356},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.462529718875885},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4478776752948761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4472254514694214},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.4387795627117157},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.42998746037483215},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2856495976448059},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.24671196937561035},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.23142659664154053},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.09012734889984131}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6540393829345703},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.596458375453949},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.5868628025054932},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5467341542243958},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.480023056268692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47437888383865356},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.462529718875885},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4478776752948761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4472254514694214},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.4387795627117157},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.42998746037483215},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2856495976448059},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.24671196937561035},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.23142659664154053},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.09012734889984131},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000066506","descriptor_name":"Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000066506","descriptor_name":"Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000066506","descriptor_name":"Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D013177","descriptor_name":"Sports","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D013177","descriptor_name":"Sports","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D013177","descriptor_name":"Sports","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D014195","descriptor_name":"Travel","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D014195","descriptor_name":"Travel","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D014195","descriptor_name":"Travel","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":2,"locations":[{"id":"doi:10.1162/evco_a_00319","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00319","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:37310276","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/37310276","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W16305195","https://openalex.org/W96818046","https://openalex.org/W141763707","https://openalex.org/W292355835","https://openalex.org/W1500186844","https://openalex.org/W1569558302","https://openalex.org/W1601564682","https://openalex.org/W1700954517","https://openalex.org/W1886949561","https://openalex.org/W1968808691","https://openalex.org/W1971110338","https://openalex.org/W1972849741","https://openalex.org/W1988912767","https://openalex.org/W1991363803","https://openalex.org/W2009518000","https://openalex.org/W2021791623","https://openalex.org/W2044566891","https://openalex.org/W2075183781","https://openalex.org/W2097754413","https://openalex.org/W2100233978","https://openalex.org/W2151339633","https://openalex.org/W2157841753","https://openalex.org/W2169521001","https://openalex.org/W2904922578","https://openalex.org/W2958369069","https://openalex.org/W3016075270","https://openalex.org/W3043686651","https://openalex.org/W6603962456","https://openalex.org/W6610476718","https://openalex.org/W6629842867","https://openalex.org/W6635981266","https://openalex.org/W6776292870"],"related_works":["https://openalex.org/W2909372716","https://openalex.org/W3029891807","https://openalex.org/W1572785861","https://openalex.org/W4352981148","https://openalex.org/W1571917368","https://openalex.org/W140783093","https://openalex.org/W2136437817","https://openalex.org/W2080638133","https://openalex.org/W1799308535","https://openalex.org/W2554253816"],"abstract_inverted_index":{"The":[0],"traveling":[1],"tournament":[2,31],"problem":[3,10],"is":[4,155],"a":[5,28,54,63,69,111,143,175],"well-known":[6],"sports":[7],"league":[8],"scheduling":[9],"famous":[11],"for":[12,59,91,103,133,142,171],"its":[13],"practical":[14],"hardness.":[15],"Given":[16],"an":[17],"even":[18],"number":[19],"of":[20,57,114,126,148,185],"teams":[21,99],"with":[22,166],"symmetric":[23],"distances":[24,40],"between":[25],"their":[26],"venues,":[27],"double":[29],"round-robin":[30],"has":[32],"to":[33,93,97,107,129,168,179],"be":[34],"scheduled":[35],"minimizing":[36],"the":[37,46,83,115,130,149,158,180],"total":[38],"travel":[39],"over":[41],"all":[42],"teams.":[43,109],"We":[44,81],"consider":[45],"most":[47],"common":[48],"constrained":[49],"variant":[50,113],"without":[51],"repeaters":[52],"and":[53,122,162,187],"streak":[55],"limit":[56],"three,":[58],"which":[60,172],"we":[61,117,173],"study":[62],"beam":[64,150],"search":[65],"approach":[66],"based":[67],"on":[68,157],"state-space":[70],"formulation":[71],"guided":[72],"by":[73],"heuristics":[74],"derived":[75],"from":[76],"different":[77],"lower":[78],"bound":[79],"variants.":[80],"solve":[82],"arising":[84],"capacitated":[85],"vehicle":[86],"routing":[87],"subproblems":[88],"either":[89],"exactly":[90],"small-":[92],"medium-sized":[94],"instances":[95,105,165],"up":[96,106],"18":[98],"or":[100],"heuristically":[101],"also":[102],"larger":[104],"24":[108,169],"In":[110],"randomized":[112],"search,":[116],"employ":[118],"random":[119],"team":[120],"ordering":[121],"add":[123],"small":[124],"amounts":[125],"Gaussian":[127],"noise":[128],"nodes'":[131],"guidance":[132],"diversification":[134],"when":[135],"multiple":[136],"runs":[137],"are":[138],"performed.":[139],"This":[140],"allows":[141],"simple":[144],"yet":[145],"effective":[146],"parallelization":[147],"search.":[151],"A":[152],"final":[153],"comparison":[154],"done":[156],"NL,":[159],"CIRC,":[160],"NFL,":[161],"GALAXY":[163],"benchmark":[164],"12":[167],"teams,":[170],"report":[174],"mean":[176],"gap":[177],"difference":[178],"best":[181,190],"known":[182],"feasible":[183,191],"solutions":[184],"1.2%":[186],"five":[188],"new":[189],"solutions.":[192]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}