{"id":"https://openalex.org/W2186474153","doi":"https://doi.org/10.1109/ic3.2015.7346685","title":"Enhanced heuristic approach for Traveling Tournament Problem based on Grey Wolf Optimizer","display_name":"Enhanced heuristic approach for Traveling Tournament Problem based on Grey Wolf Optimizer","publication_year":2015,"publication_date":"2015-08-01","ids":{"openalex":"https://openalex.org/W2186474153","doi":"https://doi.org/10.1109/ic3.2015.7346685","mag":"2186474153"},"language":"en","primary_location":{"id":"doi:10.1109/ic3.2015.7346685","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2015.7346685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Eighth International Conference on Contemporary Computing (IC3)","raw_type":"proceedings-article"},"type":"article","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/A5042208159","display_name":"Daya Gupta","orcid":"https://orcid.org/0000-0001-5401-7287"},"institutions":[{"id":"https://openalex.org/I863896202","display_name":"Delhi Technological University","ror":"https://ror.org/01ztcvt22","country_code":"IN","type":"education","lineage":["https://openalex.org/I863896202"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Daya Gupta","raw_affiliation_strings":["Computer Science & Engineering Department, Delhi Technological University, Delhi, India"],"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering Department, Delhi Technological University, Delhi, India","institution_ids":["https://openalex.org/I863896202"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018337140","display_name":"Chand Anand","orcid":null},"institutions":[{"id":"https://openalex.org/I863896202","display_name":"Delhi Technological University","ror":"https://ror.org/01ztcvt22","country_code":"IN","type":"education","lineage":["https://openalex.org/I863896202"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Chand Anand","raw_affiliation_strings":["Computer Science & Engineering Department, Delhi Technological University, Delhi, India"],"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering Department, Delhi Technological University, Delhi, India","institution_ids":["https://openalex.org/I863896202"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051883091","display_name":"Tejas Dewan","orcid":null},"institutions":[{"id":"https://openalex.org/I863896202","display_name":"Delhi Technological University","ror":"https://ror.org/01ztcvt22","country_code":"IN","type":"education","lineage":["https://openalex.org/I863896202"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tejas Dewan","raw_affiliation_strings":["Computer Science & Engineering Department, Delhi Technological University, Delhi, India"],"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering Department, Delhi Technological University, Delhi, India","institution_ids":["https://openalex.org/I863896202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042208159"],"corresponding_institution_ids":["https://openalex.org/I863896202"],"apc_list":null,"apc_paid":null,"fwci":0.4118,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7149865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9997000098228455,"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.9997000098228455,"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.9988999962806702,"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.9983999729156494,"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/simulated-annealing","display_name":"Simulated annealing","score":0.7806789875030518},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7392579317092896},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.7079492211341858},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.599449634552002},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5547032356262207},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4757775366306305},{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.46584877371788025},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.46541666984558105},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.46373334527015686},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4304271936416626},{"id":"https://openalex.org/keywords/harmony-search","display_name":"Harmony search","score":0.4126136004924774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38827142119407654},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2674993872642517},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25751954317092896},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.16183039546012878}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7806789875030518},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7392579317092896},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.7079492211341858},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.599449634552002},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5547032356262207},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4757775366306305},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.46584877371788025},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.46541666984558105},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.46373334527015686},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4304271936416626},{"id":"https://openalex.org/C33099171","wikidata":"https://www.wikidata.org/wiki/Q26208718","display_name":"Harmony search","level":2,"score":0.4126136004924774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38827142119407654},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2674993872642517},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25751954317092896},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.16183039546012878},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ic3.2015.7346685","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2015.7346685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Eighth International Conference on Contemporary Computing (IC3)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W96818046","https://openalex.org/W313125594","https://openalex.org/W1601564682","https://openalex.org/W1825353860","https://openalex.org/W1886949561","https://openalex.org/W1971110338","https://openalex.org/W2002885158","https://openalex.org/W2059343335","https://openalex.org/W2061438946","https://openalex.org/W2157841753","https://openalex.org/W2482370462","https://openalex.org/W4285719527","https://openalex.org/W6610872472","https://openalex.org/W6638647977"],"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/W1496413023","https://openalex.org/W2136437817","https://openalex.org/W4307526247","https://openalex.org/W2082888211"],"abstract_inverted_index":{"This":[0],"paper":[1],"shows":[2],"an":[3,47,102],"enhanced":[4,48],"heuristic":[5,39,49],"approach":[6,50],"of":[7,32,51,59,75,112,118],"grey":[8],"wolf":[9],"optimizer":[10],"and":[11,81,89,114,129],"simulated":[12,52],"annealing":[13,53],"in":[14,93],"order":[15],"to":[16,41,63,86,101],"find":[17],"optimum":[18,103],"solution":[19,104],"for":[20,105],"Travelling":[21],"Tournament":[22],"Problem.":[23],"In":[24],"this":[25],"paper,":[26],"we":[27,45],"tackle":[28],"the":[29,71,109,116],"mirrored":[30],"version":[31],"TTP.":[33,106],"We":[34,69,107],"use":[35],"a":[36],"fast":[37],"constructive":[38],"algorithm":[40,99],"generate":[42],"schedules.":[43],"Later":[44],"integrate":[46],"based":[54],"on":[55],"prey":[56],"proximity":[57],"model":[58],"Grey":[60],"Wolf":[61],"Optimizer":[62],"obtain":[64],"least":[65],"cost":[66,111],"tournament":[67],"schedule.":[68],"upgrade":[70],"position":[72],"updating":[73],"step":[74],"GWO":[76],"by":[77],"using":[78],"probabilistic":[79],"methods":[80],"hybridize":[82],"it":[83],"with":[84,121],"SA":[85],"solve":[87],"TTP":[88,113],"avoid":[90],"getting":[91],"stuck":[92],"local":[94],"minima.":[95],"Our":[96],"proposed":[97],"hybrid":[98],"converges":[100],"calculate":[108],"overall":[110],"compare":[115],"performance":[117],"our":[119],"alorithm":[120],"other":[122],"metaheuristic":[123],"algorithms":[124],"like":[125],"MBBO/ESA,":[126],"BBO/SA,":[127],"ACO":[128],"PSO.":[130]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}