{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:51:38Z","timestamp":1760647898520,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Education and Training in Vietnam","award":["2023-BKA-05"],"award-info":[{"award-number":["2023-BKA-05"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,12,7]]},"DOI":"10.1145\/3628797.3628972","type":"proceedings-article","created":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T15:25:34Z","timestamp":1701876334000},"page":"671-678","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Monte Carlo Tree Search with Ant Colony Optimization for Inter-domain Path Computation Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2576-0340","authenticated-orcid":false,"given":"Do Tuan","family":"Anh","sequence":"first","affiliation":[{"name":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6860-7346","authenticated-orcid":false,"given":"Phung Bao","family":"Ha","sequence":"additional","affiliation":[{"name":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7557-1135","authenticated-orcid":false,"given":"Nguyen Thai","family":"Ha","sequence":"additional","affiliation":[{"name":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4851-1268","authenticated-orcid":false,"given":"Do Tien","family":"Dzung","sequence":"additional","affiliation":[{"name":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2241-5146","authenticated-orcid":false,"given":"Ban Ha","family":"Bang","sequence":"additional","affiliation":[{"name":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5642-1284","authenticated-orcid":false,"given":"Pham Dang","family":"Hai","sequence":"additional","affiliation":[{"name":"Hanoi University of Science and Technology, School of Information and Communication Technology, Viet Nam"}]}],"member":"320","published-online":{"date-parts":[[2023,12,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504728"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110063"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IFIPNetworking.2014.6857116"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185701"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2004.04.010"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 18th BeNeLux Conference on Artificial Intelligence","author":"Chaslot Guillaume","year":"2006","unstructured":"Guillaume Chaslot, Jahn-Takeshi Saito, Bruno Bouzy, JWHM Uiterwijk, and H\u00a0Jaap Van Den\u00a0Herik. 2006. Monte-carlo strategies for computer go. In Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, Namur, Belgium. 83\u201391."},{"key":"e_1_3_2_1_8_1","volume-title":"Monte Carlo Search Algorithms for Network Traffic Engineering. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 486\u2013501","author":"Dang Chen","year":"2021","unstructured":"Chen Dang, Cristina Bazgan, Tristan Cazenave, Morgan Chopin, and Pierre-Henri Wuillemin. 2021. Monte Carlo Search Algorithms for Network Traffic Engineering. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 486\u2013501."},{"key":"e_1_3_2_1_9_1","volume-title":"Huynh Thi\u00a0Thanh Binh, and Simon Su","author":"Do\u00a0Tuan Anh","year":"2021","unstructured":"Anh Do\u00a0Tuan, Long\u00a0Nguyen Hoang, Thang\u00a0Ta Bao, Huynh Thi\u00a0Thanh Binh, and Simon Su. 2021. A two-level strategy based on evolutionary algorithm to solve the inter-domain path computation under node-defined domain uniqueness constraint. In Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications III, Vol.\u00a011746. International Society for Optics and Photonics, 117462O."},{"volume-title":"Commercial Transport","author":"Edelkamp Stefan","key":"e_1_3_2_1_10_1","unstructured":"Stefan Edelkamp, Max Gath, Christoph Greulich, Malte Humann, Otthein Herzog, and Michael Lawo. 2016. Monte-Carlo tree search for logistics. In Commercial Transport. Springer, 427\u2013440."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11206-0_28"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21800"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eastsj.2020.100028"},{"key":"e_1_3_2_1_14_1","volume-title":"Divide-and-conquer monte carlo tree search for goal-directed planning. arXiv preprint arXiv:2004.11410","author":"Parascandolo Giambattista","year":"2020","unstructured":"Giambattista Parascandolo, Lars Buesing, Josh Merel, Leonard Hasenclever, John Aslanides, Jessica\u00a0B Hamrick, Nicolas Heess, Alexander Neitz, and Theophane Weber. 2020. Divide-and-conquer monte carlo tree search for goal-directed planning. arXiv preprint arXiv:2004.11410 (2020)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29178-4_26"},{"key":"e_1_3_2_1_16_1","volume-title":"The 20th Workshop on Synthesis And System Integration of Mixed Information technologies (SASIMI). 352\u2013356","author":"Shimomura Masato","year":"2016","unstructured":"Masato Shimomura and Yasuhiro Takashima. 2016. Application of monte-carlo tree search to traveling-salesman problem. In The 20th Workshop on Synthesis And System Integration of Mixed Information technologies (SASIMI). 352\u2013356."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC55065.2022.9870339"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2023.101603"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2018.8487462"}],"event":{"name":"SOICT 2023: The 12th International Symposium on Information and Communication Technology","acronym":"SOICT 2023","location":"Ho Chi Minh Vietnam"},"container-title":["Proceedings of the 12th International Symposium on Information and Communication Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3628797.3628972","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3628797.3628972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T12:23:43Z","timestamp":1755779023000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3628797.3628972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,7]]},"references-count":19,"alternative-id":["10.1145\/3628797.3628972","10.1145\/3628797"],"URL":"https:\/\/doi.org\/10.1145\/3628797.3628972","relation":{},"subject":[],"published":{"date-parts":[[2023,12,7]]},"assertion":[{"value":"2023-12-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}