{"id":"https://openalex.org/W2009518000","doi":"https://doi.org/10.1145/1569901.1569913","title":"An ant colony optimization approach to the traveling tournament problem","display_name":"An ant colony optimization approach to the traveling tournament problem","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2009518000","doi":"https://doi.org/10.1145/1569901.1569913","mag":"2009518000"},"language":"en","primary_location":{"id":"doi:10.1145/1569901.1569913","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569913","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"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/A5026906002","display_name":"David Uthus","orcid":null},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"David C. Uthus","raw_affiliation_strings":["University of Auckland, Auckland, New Zealand","UNIVERSITY OF AUCKLAND, Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"UNIVERSITY OF AUCKLAND, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028387093","display_name":"Patricia Riddle","orcid":"https://orcid.org/0000-0001-8616-0053"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Patricia J. Riddle","raw_affiliation_strings":["University of Auckland, Auckland, New Zealand","UNIVERSITY OF AUCKLAND, Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"UNIVERSITY OF AUCKLAND, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058596166","display_name":"Hans W. Guesgen","orcid":"https://orcid.org/0000-0002-8160-5946"},"institutions":[{"id":"https://openalex.org/I51158804","display_name":"Massey University","ror":"https://ror.org/052czxv31","country_code":"NZ","type":"education","lineage":["https://openalex.org/I51158804"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Hans W. Guesgen","raw_affiliation_strings":["Massey University, Palmerston North, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massey University, Palmerston North, New Zealand","institution_ids":["https://openalex.org/I51158804"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"81","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994000196456909,"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.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8460187911987305},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.8442049026489258},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6608831882476807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5823154449462891},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5128612518310547},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5029394030570984},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4832109212875366},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.47180262207984924},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45728346705436707},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.4281320571899414},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.41092294454574585},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3531586527824402},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.2968365550041199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2009521722793579},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.10225683450698853}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8460187911987305},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8442049026489258},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6608831882476807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5823154449462891},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5128612518310547},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5029394030570984},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4832109212875366},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.47180262207984924},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45728346705436707},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.4281320571899414},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.41092294454574585},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3531586527824402},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.2968365550041199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2009521722793579},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.10225683450698853},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1569901.1569913","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569913","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.5600000023841858,"display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W141763707","https://openalex.org/W1534262712","https://openalex.org/W1573676079","https://openalex.org/W1594786627","https://openalex.org/W1601564682","https://openalex.org/W2043829066","https://openalex.org/W2075183781","https://openalex.org/W2107941094","https://openalex.org/W2118240569","https://openalex.org/W2125990606","https://openalex.org/W2154929945","https://openalex.org/W2157841753","https://openalex.org/W2167705044","https://openalex.org/W2337098149","https://openalex.org/W2339500526","https://openalex.org/W2426452510","https://openalex.org/W2507603607","https://openalex.org/W4285719527","https://openalex.org/W6703462244"],"related_works":["https://openalex.org/W1997193297","https://openalex.org/W2070079705","https://openalex.org/W2900531744","https://openalex.org/W2162125251","https://openalex.org/W2394153495","https://openalex.org/W2388217074","https://openalex.org/W4252214543","https://openalex.org/W4299796063","https://openalex.org/W2358084676","https://openalex.org/W2372214059"],"abstract_inverted_index":{"The":[0,64],"traveling":[1],"tournament":[2],"problem":[3,10,29],"has":[4],"proven":[5],"to":[6,26,42,87],"be":[7],"a":[8,36,48],"difficult":[9],"for":[11],"the":[12,27,68],"ant":[13,38,72],"colony":[14,39,73],"optimization":[15,40,74],"metaheuristic,":[16],"with":[17,47],"past":[18,71],"approaches":[19],"showing":[20],"poor":[21],"results.":[22],"This":[23],"is":[24],"due":[25],"unusual":[28],"structure":[30],"and":[31,51,59,83],"feasibility":[32],"constraints.":[33],"We":[34],"present":[35],"new":[37],"approach":[41,65],"this":[43],"problem,":[44],"hybridizing":[45],"it":[46],"forward":[49],"checking":[50],"conflict-directed":[52],"backjumping":[53],"algorithm":[54],"while":[55],"using":[56],"pattern":[57],"matching":[58],"other":[60,88],"constraint":[61],"satisfaction":[62],"strategies.":[63],"improves":[66],"on":[67],"performance":[69],"of":[70],"approaches,":[75],"finding":[76],"better":[77],"quality":[78],"solutions":[79],"in":[80],"shorter":[81],"time,":[82],"exhibits":[84],"results":[85],"comparable":[86],"state-of-the-art":[89],"approaches.":[90]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}