{"id":"https://openalex.org/W4389374121","doi":"https://doi.org/10.1145/3628797.3628972","title":"A Monte Carlo Tree Search with Ant Colony Optimization for Inter-domain Path Computation Problem","display_name":"A Monte Carlo Tree Search with Ant Colony Optimization for Inter-domain Path Computation Problem","publication_year":2023,"publication_date":"2023-12-06","ids":{"openalex":"https://openalex.org/W4389374121","doi":"https://doi.org/10.1145/3628797.3628972"},"language":"en","primary_location":{"id":"doi:10.1145/3628797.3628972","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3628797.3628972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Symposium on Information and Communication Technology","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/A5014269276","display_name":"Do Tuan Anh","orcid":"https://orcid.org/0000-0003-2576-0340"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Do Tuan Anh","raw_affiliation_strings":["Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093428978","display_name":"Phung Bao Ha","orcid":"https://orcid.org/0009-0002-6860-7346"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Phung Bao Ha","raw_affiliation_strings":["Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087748965","display_name":"Nguyen Thai Ha","orcid":"https://orcid.org/0009-0009-7557-1135"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nguyen Thai Ha","raw_affiliation_strings":["Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103028216","display_name":"D. Dzung","orcid":"https://orcid.org/0009-0009-4851-1268"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Do Tien Dzung","raw_affiliation_strings":["Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037843488","display_name":"Ha-Bang Ban","orcid":"https://orcid.org/0000-0003-2241-5146"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Ban Ha Bang","raw_affiliation_strings":["Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091444276","display_name":"Pham Dang Hai","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Pham Dang Hai","raw_affiliation_strings":["Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5014269276"],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.246,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.54722108,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"671","last_page":"678"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11439","display_name":"Video Analysis and Summarization","score":0.9811999797821045,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9747999906539917,"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/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.7749478220939636},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6952158212661743},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6841745972633362},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.601443350315094},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5974957346916199},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5817106366157532},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5706799626350403},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5175987482070923},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.500098705291748},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.49610504508018494},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4727041721343994},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.45777034759521484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3951932191848755},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.3536721169948578},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20182645320892334}],"concepts":[{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.7749478220939636},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6952158212661743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6841745972633362},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.601443350315094},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5974957346916199},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5817106366157532},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5706799626350403},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5175987482070923},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.500098705291748},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.49610504508018494},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4727041721343994},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.45777034759521484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3951932191848755},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3536721169948578},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20182645320892334},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3628797.3628972","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3628797.3628972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Symposium on Information and Communication Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W88391076","https://openalex.org/W1807280442","https://openalex.org/W2086494708","https://openalex.org/W2123932647","https://openalex.org/W2126316555","https://openalex.org/W2772066451","https://openalex.org/W2898067464","https://openalex.org/W3083272460","https://openalex.org/W3107336733","https://openalex.org/W3192273927","https://openalex.org/W4294811559","https://openalex.org/W4318956406","https://openalex.org/W4379471017"],"related_works":["https://openalex.org/W2282636749","https://openalex.org/W2004425492","https://openalex.org/W2917772249","https://openalex.org/W2610278629","https://openalex.org/W1583052623","https://openalex.org/W94249243","https://openalex.org/W1598581090","https://openalex.org/W2106144871","https://openalex.org/W2394027715","https://openalex.org/W4322703856"],"abstract_inverted_index":{"Over":[0],"the":[1,5,37,47,53,62,68,82,87,107,111,122,127,146,151,156,187,203],"past":[2],"few":[3],"years,":[4],"Hierarchical":[6],"Path":[7,49],"Computation":[8,50],"Element":[9],"(h-PCE)":[10],"architecture":[11,24],"has":[12],"been":[13,103],"advocated":[14],"for":[15],"handling":[16],"packet":[17],"routing":[18],"in":[19,155,210],"multi-domain":[20],"networks.":[21],"However,":[22],"this":[23,45],"may":[25],"not":[26],"be":[27],"able":[28],"to":[29,60,105,169,185],"effectively":[30],"deal":[31],"with":[32],"large-scale":[33],"networks,":[34],"especially":[35],"as":[36],"number":[38],"of":[39,158],"network":[40],"components":[41],"increases.":[42],"To":[43,125],"address":[44],"challenge,":[46],"Inter-Domain":[48],"problem":[51],"under":[52],"Domain":[54],"Uniqueness":[55],"constraint":[56,83],"(IDPC-DU)":[57],"was":[58],"proposed":[59,104,147,204],"enhance":[61],"h-PCE":[63],"architecture.":[64],"The":[65,190,198],"IDPC-DU":[66,92],"limits":[67],"search":[69,88,118,153,160],"space":[70,154],"by":[71],"finding":[72],"paths":[73],"that":[74,175,202],"pass":[75],"through":[76],"each":[77],"domain":[78],"only":[79],"once.":[80],"Although":[81],"can":[84],"help":[85],"increase":[86],"process\u2019s":[89],"efficiency":[90],"significantly,":[91],"is":[93,114,167,181,192],"still":[94],"an":[95],"NP-hard":[96],"problem.":[97],"So":[98],"far,":[99],"some":[100],"algorithms":[101,209],"have":[102],"solve":[106],"problem,":[108],"but":[109],"either":[110],"encoding":[112],"method":[113],"complex,":[115],"or":[116],"their":[117],"easily":[119],"falls":[120],"into":[121,183],"local":[123],"optima.":[124],"overcome":[126],"drawbacks,":[128],"we":[129,149],"propose":[130],"a":[131,159,171,178],"two-level":[132],"approach":[133],"combining":[134],"Monte":[135],"Carlo":[136],"Tree":[137],"Search":[138],"(MCTS)":[139],"and":[140],"Ant":[141],"Colony":[142],"Optimization":[143],"(ACO).":[144],"In":[145],"algorithm,":[148],"represent":[150],"problem\u2019s":[152],"form":[157],"tree,":[161],"using":[162],"MCTS,":[163],"then":[164],"ACO":[165,184],"algorithm":[166,191,205],"used":[168],"find":[170],"good":[172],"solution":[173,188],"on":[174,194],"tree.":[176],"Moreover,":[177],"pruning":[179],"technique":[180],"integrated":[182],"reduce":[186],"space.":[189],"tested":[193],"many":[195],"benchmark":[196],"datasets.":[197],"experimental":[199],"results":[200],"show":[201],"outperforms":[206],"all":[207],"other":[208],"most":[211],"cases.":[212]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}