{"id":"https://openalex.org/W2972065243","doi":"https://doi.org/10.1109/codit.2019.8820444","title":"A Hybrid Ant Colony Optimization Approach for the Cyclic Antibandwidth Problem","display_name":"A Hybrid Ant Colony Optimization Approach for the Cyclic Antibandwidth Problem","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2972065243","doi":"https://doi.org/10.1109/codit.2019.8820444","mag":"2972065243"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2019.8820444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2019.8820444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5042284939","display_name":"Shyam Sundar","orcid":"https://orcid.org/0000-0001-9679-0892"},"institutions":[{"id":"https://openalex.org/I38335241","display_name":"National Institute of Technology Raipur","ror":"https://ror.org/02y553197","country_code":"IN","type":"education","lineage":["https://openalex.org/I38335241"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Shyam Sundar","raw_affiliation_strings":["Department of Computer Applications, National Institute of Technology Raipur, Raipur, Chhattisgarh, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Applications, National Institute of Technology Raipur, Raipur, Chhattisgarh, India","institution_ids":["https://openalex.org/I38335241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042284939"],"corresponding_institution_ids":["https://openalex.org/I38335241"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1289","last_page":"1294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9945999979972839,"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.9945999979972839,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9940000176429749,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9930999875068665,"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.8342877626419067},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6158910989761353},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5924814939498901},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5874312520027161},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5429477691650391},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5215839743614197},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4888562560081482},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4608027935028076},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.45063725113868713},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4149352014064789},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35112592577934265},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18937742710113525}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8342877626419067},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6158910989761353},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5924814939498901},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5874312520027161},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5429477691650391},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5215839743614197},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4888562560081482},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4608027935028076},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.45063725113868713},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4149352014064789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35112592577934265},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18937742710113525},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit.2019.8820444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2019.8820444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","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":19,"referenced_works":["https://openalex.org/W1492640216","https://openalex.org/W1496946117","https://openalex.org/W1801849579","https://openalex.org/W1996953491","https://openalex.org/W2020371026","https://openalex.org/W2030346487","https://openalex.org/W2037252568","https://openalex.org/W2060095317","https://openalex.org/W2079966248","https://openalex.org/W2086177563","https://openalex.org/W2092518753","https://openalex.org/W2107941094","https://openalex.org/W2113902087","https://openalex.org/W2154213027","https://openalex.org/W2154929945","https://openalex.org/W2162434307","https://openalex.org/W2167920923","https://openalex.org/W2270260829","https://openalex.org/W6693510732"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W1975009952","https://openalex.org/W1588949866","https://openalex.org/W46882622","https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2462483068"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,15,49,89,135,142],"hybrid":[4],"approach":[5,13,75],"(HACO-CAB)":[6],"consisting":[7],"of":[8,31,41,60,71,88,110,113,132,144,150],"an":[9,39],"ant":[10,72],"colony":[11,73],"optimization":[12,74],"and":[14],"local":[16,136],"search":[17,78,81,137],"operator":[18,138],"for":[19],"the":[20,44,52,57,69,114,124,129],"cyclic":[21,58],"antibandwidth":[22],"(CAB)":[23],"problem.":[24,116],"The":[25],"CAB":[26,115],"problem":[27],"which":[28],"is":[29,63,76,139],"one":[30],"various":[32],"graph":[33,42,93],"layout":[34],"problems":[35],"deals":[36],"with":[37],"placing":[38],"n-vertex":[40],"into":[43],"cycle":[45],"Cn":[46],"in":[47,56,148,156],"such":[48,100],"way":[50],"that":[51,95],"minimum":[53],"distance":[54],"(calculated":[55],"distance)":[59],"adjacent":[61],"vertices":[62],"maximized.":[64],"In":[65],"this":[66],"proposed":[67],"approach,":[68],"role":[70],"to":[77,104,122,158],"potential":[79],"breadth-first":[80],"spanning":[82],"trees":[83,101],"(solutions)":[84],"or":[85],"level":[86],"structures":[87],"high":[90,105],"edge":[91],"density":[92],"so":[94],"upon":[96],"applying":[97],"labeling":[98,118],"on":[99],"can":[102],"lead":[103],"quality":[106],"solutions":[107],"(in":[108],"terms":[109,149],"fitness":[111,130],"value)":[112],"Two":[117],"schemes":[119],"are":[120],"applied":[121],"label":[123],"solution.":[125],"To":[126],"further":[127],"improve":[128],"value":[131],"current":[133],"solution,":[134],"applied.":[140],"On":[141],"set":[143],"benchmark":[145],"instances,":[146],"HACO-CAB,":[147],"computational":[151],"results,":[152],"shows":[153],"its":[154],"effectiveness":[155],"comparison":[157],"state-of-the-art":[159],"approaches.":[160]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}