{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T03:44:27Z","timestamp":1762659867742,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":24,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1145\/3368926.3369712","type":"proceedings-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T13:30:11Z","timestamp":1576848611000},"page":"170-177","source":"Crossref","is-referenced-by-count":6,"title":["Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem"],"prefix":"10.1145","author":[{"given":"Tran Ba","family":"Trung","sequence":"first","affiliation":[{"name":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"}]},{"given":"Le Tien","family":"Thanh","sequence":"additional","affiliation":[{"name":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"}]},{"given":"Ly Trung","family":"Hieu","sequence":"additional","affiliation":[{"name":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"}]},{"given":"Pham Dinh","family":"Thanh","sequence":"additional","affiliation":[{"name":"Tay Bac University, Sonla, Vietnam"}]},{"given":"Huynh Thi Thanh","family":"Binh","sequence":"additional","affiliation":[{"name":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"}]}],"member":"320","reference":[{"key":"key-10.1145\/3368926.3369712-1","unstructured":"K. K. Bali, A. Gupta, L. Feng, Y. S. Ong, and Tan Puay Siew. 2017. Linearized domain adaptation in evolutionary multi-tasking. In 2017 IEEE Congress on Evolutionary Computation (CEC). Institute of Electrical and Electronics Engineers (IEEE), Donostia\/San Sebastian, Spain., 1295--1302."},{"key":"key-10.1145\/3368926.3369712-2","unstructured":"K. K. Bali, Y. Ong, A. Gupta, and P. S. Tan. 2019. Multifactorial Evolutionary Algorithm with Online Transfer Parameter Estimation: MFEA-II. IEEE Transactions on Evolutionary Computation (Early Access), - (march 2019), 1--1."},{"key":"key-10.1145\/3368926.3369712-3","unstructured":"Kavitesh Kumar Bali, Yew-Soon Ong, Abhishek Gupta, and Puay Siew Tan. 2019. Multifactorial Evolutionary Algorithm with Online Transfer Parameter Estimation: MFEA-II. IEEE Transactions on Evolutionary Computation (2019)."},{"key":"key-10.1145\/3368926.3369712-4","unstructured":"Huynh Thi Thanh Binh, Pham Dinh Thanh, and Ta Bao Thang. 2019. New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm. Knowledge-Based Systems 180 (2019), 12 -- 25."},{"key":"key-10.1145\/3368926.3369712-5","unstructured":"Y. Chen, J. Zhong, L. Feng, and J. Zhang. 2019. An Adaptive Archive-Based Evolutionary Framework for Many-Task Optimization. IEEE Transactions on Emerging Topics in Computational Intelligence (Early Access), - (june 2019), 1--16."},{"key":"key-10.1145\/3368926.3369712-6","unstructured":"Yen Hung Chen. 2017. The Clustered and Bottleneck Clustered Selected-Internal Steiner Tree Problems. In The Second Malta Conference in Graph Theory and Combinatorics 2017. The Second Malta Conference in Graph Theory and Combinatorics, Qawra, St Paul's Bay, 44."},{"key":"key-10.1145\/3368926.3369712-7","unstructured":"Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, and Guido Proietti. 2019. Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. Journal of Combinatorial Optimization 38, 1 (01 Jul 2019), 165--184."},{"key":"key-10.1145\/3368926.3369712-8","unstructured":"A. Gupta and Y. Ong. 2016. Genetic transfer or population diversification? Deciphering the secret ingredients of evolutionary multi-task optimization. In 2016 IEEE Symposium Series on Computational Intelligence (SSCI). Institute of Electrical and Electronics Engineers (IEEE), Athens, Greece, 1--7."},{"key":"key-10.1145\/3368926.3369712-9","unstructured":"A. Gupta, Y. Ong, and L. Feng. 2016. Multifactorial Evolution: Toward Evolutionary Multi-tasking. IEEE Transactions on Evolutionary Computation 20, 3 (June 2016), 343--357."},{"key":"key-10.1145\/3368926.3369712-10","unstructured":"A. Gupta, Y. S. Ong, B. Da, L. Feng, and S. D. Handoko. 2016. Landscape synergy in evolutionary multi-tasking. In 2016 IEEE Congress on Evolutionary Computation (CEC). Institute of Electrical and Electronics Engineers (IEEE), Vancouver, BC, Canada, 3076--3083."},{"key":"key-10.1145\/3368926.3369712-11","unstructured":"Lei Zhou, L. Feng, Jinghui Zhong, Y. Ong, Z. Zhu, and E. Sha. 2016. Evolutionary multi-tasking in combinatorial search spaces: A case study in capacitated vehicle routing problem. In 2016 IEEE Symposium Series on Computational Intelligence (SSCI). Institute of Electrical and Electronics Engineers (IEEE), Athens, Greece, 1--8."},{"key":"key-10.1145\/3368926.3369712-12","unstructured":"Chen-Wan Lin and Bang Ye Wu. 2017. On the minimum routing cost clustered tree problem. Journal of Combinatorial Optimization 33, 3 (01 Apr 2017), 1106--1121."},{"key":"key-10.1145\/3368926.3369712-13","unstructured":"Adriano Masone, Maria Elena Nenni, Antonio Sforza, and Claudio Sterle. 2019. The Minimum Routing Cost Tree Problem. Soft Computing 23, 9 (01 May 2019), 2947--2957."},{"key":"key-10.1145\/3368926.3369712-14","unstructured":"Mario Mestria, Luiz Satoru Ochi, and Simone de Lima Martins. 2013. GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem. Computers and Operations Research 40, 12 (2013), 3218 -- 3229."},{"key":"key-10.1145\/3368926.3369712-15","doi-asserted-by":"crossref","unstructured":"Nguyen Duc Nghia and Huynh Thi Thanh Binh. 2008. Heuristic algorithms for solving bounded diameter minimum spanning tree problem and its application to genetic algorithm development. In Greedy Algorithms. IntechOpen.","DOI":"10.1109\/CEC.2008.4631221"},{"key":"key-10.1145\/3368926.3369712-16","unstructured":"Dinh Thanh Pham and Thi Thanh Binh Huynh. 2015. An effective combination of genetic algorithms and the variable neighborhood search for solving travelling salesman problem. In 2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI). IEEE, 142--149."},{"key":"key-10.1145\/3368926.3369712-17","unstructured":"Pham Dinh Thanh. 2019. CluSPT Instances. https:\/\/doi.org\/10.17632\/b4gcgybvt6.3"},{"key":"key-10.1145\/3368926.3369712-18","unstructured":"Pham Dinh Thanh, Huynh Thi Thanh Binh, and Bui Thu Lam. 2013. A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem. In 2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR). IEEE, 66--71."},{"key":"key-10.1145\/3368926.3369712-19","unstructured":"Pham Dinh Thanh, Huynh Thi Thanh Binh, and Bui Thu Lam. 2015. New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem. In Knowledge and Systems Engineering. Springer, 367--379."},{"key":"key-10.1145\/3368926.3369712-20","unstructured":"P. D. Thanh, D. A. Dung, T. N. Tien, and H. T. T. Binh. 2018. An Effective Representation Scheme in Multifactorial Evolutionary Algorithm for Solving Cluster Shortest-Path Tree Problem. In 2018 IEEE Congress on Evolutionary Computation (CEC). Institute of Electrical and Electronics Engineers (IEEE), Rio de Janeiro, Brazil, 1--8."},{"key":"key-10.1145\/3368926.3369712-21","unstructured":"P. D. Thanh, H. Thi Thanh Binh, D. D. Dac, N. Binh Long, and L. M. Hai Phong. 2019. A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem. In 2019 IEEE Congress on Evolutionary Computation (CEC). Institute of Electrical and Electronics Engineers (IEEE), Wellington, New Zealand, 2915--2922."},{"key":"key-10.1145\/3368926.3369712-22","unstructured":"H. ThiThanh Binh, P. Dinh Thanh, T. Ba Trung, and L. Phuong Thao. 2018. Effective Multifactorial Evolutionary Algorithm for Solving the Cluster Shortest Path Tree Problem. In 2018 IEEE Congress on Evolutionary Computation (CEC). Institute of Electrical and Electronics Engineers (IEEE), Rio de Janeiro, Brazil, 1--8."},{"key":"key-10.1145\/3368926.3369712-23","unstructured":"Bang Ye Wu and Chen-Wan Lin. 2015. On the clustered Steiner tree problem. Journal of Combinatorial Optimization 30, 2 (01 Aug 2015), 370--386."},{"key":"key-10.1145\/3368926.3369712-24","unstructured":"Y. Yuan, Y. Ong, A. Gupta, P. S. Tan, and H. Xu. 2016. Evolutionary multi-tasking in permutation-based combinatorial optimization problems: Realization with TSP, QAP, LOP, and JSP. In 2016 IEEE Region 10 Conference (TENCON). Institute of Electrical and Electronics Engineers (IEEE), Marina Bay Sands, Singapore, 3157--3164."}],"event":{"number":"10","sponsor":["SOICT, School of Information and Communication Technology - HUST","NAFOSTED, The National Foundation for Science and Technology Development"],"acronym":"SoICT 2019","name":"the Tenth International Symposium","start":{"date-parts":[[2019,12,4]]},"location":"Hanoi, Ha Long Bay, Viet Nam","end":{"date-parts":[[2019,12,6]]}},"container-title":["Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368926.3369712","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3369712&ftid=2101275&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:05Z","timestamp":1750204385000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3368926.3369712"}},"subtitle":[],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2019]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1145\/3368926.3369712","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}