{"id":"https://openalex.org/W2911889380","doi":"https://doi.org/10.4149/cai_2018_6_1386","title":"A Cooperative Local Search Method for Solving the Traveling Tournament Problem","display_name":"A Cooperative Local Search Method for Solving the Traveling Tournament Problem","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2911889380","doi":"https://doi.org/10.4149/cai_2018_6_1386","mag":"2911889380"},"language":"en","primary_location":{"id":"doi:10.4149/cai_2018_6_1386","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_6_1386","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.4149/cai_2018_6_1386","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071900437","display_name":"Meriem Khelifa","orcid":null},"institutions":[{"id":"https://openalex.org/I157169809","display_name":"University of Sciences and Technology Houari Boumediene","ror":"https://ror.org/02kb89c09","country_code":"DZ","type":"education","lineage":["https://openalex.org/I157169809"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Meriem Khelifa","raw_affiliation_strings":["LRIA-FEI-USTHB - Computer Science Department, BP 32 El-Alia Beb-Ezzouar, Algiers 16111"],"affiliations":[{"raw_affiliation_string":"LRIA-FEI-USTHB - Computer Science Department, BP 32 El-Alia Beb-Ezzouar, Algiers 16111","institution_ids":["https://openalex.org/I157169809"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046314899","display_name":"Dalila Boughaci","orcid":"https://orcid.org/0000-0001-5210-8951"},"institutions":[{"id":"https://openalex.org/I157169809","display_name":"University of Sciences and Technology Houari Boumediene","ror":"https://ror.org/02kb89c09","country_code":"DZ","type":"education","lineage":["https://openalex.org/I157169809"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Dalila Boughaci","raw_affiliation_strings":["LRIA-FEI-USTHB - Computer Science Department, BP 32 El-Alia Beb-Ezzouar, Algiers 16111"],"affiliations":[{"raw_affiliation_string":"LRIA-FEI-USTHB - Computer Science Department, BP 32 El-Alia Beb-Ezzouar, Algiers 16111","institution_ids":["https://openalex.org/I157169809"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071900437"],"corresponding_institution_ids":["https://openalex.org/I157169809"],"apc_list":null,"apc_paid":null,"fwci":0.4235,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70349284,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"37","issue":"6","first_page":"1386","last_page":"1410"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9939000010490417,"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.9939000010490417,"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.989799976348877,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.982200026512146,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7985365390777588},{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.6282639503479004},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.573178231716156},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5719361305236816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.55186927318573},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.536443829536438},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49958157539367676},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.45993709564208984},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.43803030252456665},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4358982443809509},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42421630024909973},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.41261476278305054},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4112279415130615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3161032795906067},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.21264177560806274},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.09870025515556335}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7985365390777588},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.6282639503479004},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.573178231716156},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5719361305236816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.55186927318573},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.536443829536438},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49958157539367676},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.45993709564208984},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.43803030252456665},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4358982443809509},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42421630024909973},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.41261476278305054},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4112279415130615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3161032795906067},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.21264177560806274},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.09870025515556335},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4149/cai_2018_6_1386","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_6_1386","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4149/cai_2018_6_1386","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_6_1386","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"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/W2554253816","https://openalex.org/W1799308535"],"abstract_inverted_index":{"Constrained":[0],"optimization":[1,135,177],"is":[2,19,93,193],"the":[3,24,31,49,75,86,89,94,111,116,129,134,139,146,159,164,176,187,212,215],"process":[4],"of":[5,15,88,96,106,124,161,214],"optimizing":[6],"a":[7,13,40,63,81,98,104,169,181],"certain":[8],"objective":[9],"function":[10],"subject":[11],"to":[12,22,29,38,55,84,142,157,174],"set":[14,105],"constraints.":[16,148,189],"The":[17,44,118,190,205],"goal":[18],"not":[20],"necessarily":[21],"find":[23,39,180],"global":[25],"optimum.":[26],"We":[27,73,137],"try":[28],"explore":[30],"search":[32,65,140,172],"space":[33],"more":[34],"efficiently":[35],"in":[36],"order":[37],"good":[41,182],"approximate":[42,183],"solution.":[43],"obtained":[45],"solution":[46,184],"should":[47],"verify":[48],"hard":[50,188],"constraints":[51,108,154],"that":[52,67,102,185],"are":[53,208],"required":[54],"be":[56],"satisfied.":[57],"In":[58,128,163],"this":[59,150],"paper,":[60],"we":[61,132,152,167],"propose":[62,168],"cooperative":[64],"method":[66,120,173,192],"handles":[68],"optimality":[69],"and":[70,109,179,197,210],"feasibility":[71,160],"separately.":[72],"take":[74],"traveling":[76],"tournament":[77,101],"problem":[78,95],"(TTP)":[79],"as":[80],"case":[82],"study":[83],"show":[85,211],"applicability":[87],"proposed":[90,119,216],"idea.":[91],"TTP":[92,122],"scheduling":[97],"double":[99],"round-robin":[100],"satisfies":[103],"related":[107],"minimizes":[110],"total":[112],"distance":[113],"traveled":[114],"by":[115],"teams.":[117],"for":[121,203,218],"consists":[123],"two":[125],"main":[126],"steps.":[127],"first":[130],"step,":[131,166],"ignore":[133],"criterion.":[136],"reduce":[138],"only":[141],"feasible":[143],"solutions":[144],"satisfying":[145],"problem's":[147],"For":[149],"purpose,":[151],"use":[153],"programming":[155],"model":[156],"ensure":[158],"solutions.":[162],"second":[165],"stochastic":[170],"local":[171],"handle":[175],"criterion":[178],"verifies":[186],"overall":[191],"evaluated":[194],"on":[195],"benchmarks":[196],"compared":[198],"with":[199],"other":[200],"well-known":[201],"techniques":[202],"TTP.":[204,219],"computational":[206],"results":[207],"promising":[209],"effectiveness":[213],"idea":[217]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}