{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:13:05Z","timestamp":1760710385177,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T00:00:00Z","timestamp":1602633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T00:00:00Z","timestamp":1602633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014819","name":"U.S. Army Combat Capabilities Development Command","doi-asserted-by":"publisher","award":["W90GQZ-93290007"],"award-info":[{"award-number":["W90GQZ-93290007"]}],"id":[{"id":"10.13039\/100014819","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s12065-020-00501-w","type":"journal-article","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T07:02:32Z","timestamp":1602658952000},"page":"185-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Binh","family":"Huynh Thi Thanh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2550-9546","authenticated-orcid":false,"given":"Thanh","family":"Pham Dinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"501_CR1","doi-asserted-by":"crossref","unstructured":"Bali KK, Gupta A, Feng L, Ong YS, Siew TP (2017) Linearized domain adaptation in evolutionary multitasking. In: 2017 IEEE congress on evolutionary computation (CEC), IEEE, pp 1295\u20131302","DOI":"10.1109\/CEC.2017.7969454"},{"issue":"1","key":"501_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/TEVC.2019.2906927","volume":"24","author":"KK Bali","year":"2019","unstructured":"Bali KK, Ong YS, Gupta A, Tan PS (2019) Multifactorial evolutionary algorithm with online transfer parameter estimation: Mfea-ii. IEEE Trans Evol Comput 24(1):69\u201383","journal-title":"IEEE Trans Evol Comput"},{"key":"501_CR3","doi-asserted-by":"publisher","unstructured":"Bao X, Liu Z (2012) An improved approximation algorithm for the clustered traveling salesman problem. Inf Process Lett 112(23):908\u2013910. https:\/\/doi.org\/10.1016\/j.ipl.2012.08.020.http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019012002475","DOI":"10.1016\/j.ipl.2012.08.020"},{"key":"501_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.knosys.2019.05.015","volume":"180","author":"HTT Binh","year":"2019","unstructured":"Binh HTT, Thanh PD, Thang TB (2019) New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm. Knowl Based Syst 180:12\u201325","journal-title":"Knowl Based Syst"},{"key":"501_CR5","doi-asserted-by":"crossref","unstructured":"Chandra R, Gupta A, Ong YS, Goh CK (2016) Evolutionary multi-task learning for modular training of feedforward neural networks. In: International conference on neural information processing, Springer, pp 37\u201346","DOI":"10.1007\/978-3-319-46672-9_5"},{"issue":"2","key":"501_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","volume":"2","author":"JA Chisman","year":"1975","unstructured":"Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2(2):115\u2013119","journal-title":"Comput Oper Res"},{"key":"501_CR7","unstructured":"D\u2019Emidio M, Forlizzi L, Frigioni D, Leucci S, Proietti G (2016) On the clustered shortest-path tree problem. In: ICTCS, pp 263\u2013268"},{"key":"501_CR8","doi-asserted-by":"publisher","unstructured":"Dror M, Haouari M, Chaouachi J (2000) Generalized spanning trees. Eur J Oper Res 120(3):583\u2013592. https:\/\/doi.org\/10.1016\/S0377-2217(99)00006-5. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221799000065","DOI":"10.1016\/S0377-2217(99)00006-5"},{"key":"501_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-018-00374-x","volume":"38","author":"M D\u2019Emidio","year":"2019","unstructured":"D\u2019Emidio M, Forlizzi L, Frigioni D, Leucci S, Proietti G (2019) Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J Combin Optim 38:1\u201320","journal-title":"J Combin Optim"},{"key":"501_CR10","doi-asserted-by":"crossref","unstructured":"Feng L, Zhou W, Zhou L, Jiang S, Zhong J, Da B, Zhu Z, Wang Y (2017) An empirical study of multifactorial pso and multifactorial de. In: IEEE congress on evolutionary computation (CEC), IEEE, pp 921\u2013928","DOI":"10.1109\/CEC.2017.7969407"},{"issue":"6","key":"501_CR11","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1109\/49.1956","volume":"6","author":"M Gerla","year":"1988","unstructured":"Gerla M, Fratta L (1988) Tree structured fiber optics MANs. IEEE J Sel Areas Commun 6(6):934\u2013943","journal-title":"IEEE J Sel Areas Commun"},{"issue":"5","key":"501_CR12","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1109\/TEVC.2019.2893614","volume":"23","author":"M Gong","year":"2019","unstructured":"Gong M, Tang Z, Li H, Zhang J (2019) Evolutionary multitasking with dynamic resource allocating strategy. IEEE Trans Evol Comput 23(5):858\u2013869","journal-title":"IEEE Trans Evol Comput"},{"issue":"1\u20134","key":"501_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s40747-016-0011-y","volume":"1","author":"A Gupta","year":"2015","unstructured":"Gupta A, Mandziuk J, Ong YS (2015) Evolutionary multitasking in bi-level optimization. Complex Intell Syst 1(1\u20134):83\u201395","journal-title":"Complex Intell Syst"},{"issue":"3","key":"501_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TEVC.2015.2458037","volume":"20","author":"A Gupta","year":"2016","unstructured":"Gupta A, Ong YS, Feng L (2016a) Multifactorial evolution: toward evolutionary multitasking. IEEE Trans Evol Comput 20(3):343\u2013357","journal-title":"IEEE Trans Evol Comput"},{"issue":"7","key":"501_CR15","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TCYB.2016.2554622","volume":"47","author":"A Gupta","year":"2016","unstructured":"Gupta A, Ong YS, Feng L, Tan KC (2016b) Multiobjective multifactorial optimization in evolutionary multitasking. IEEE Trans Cybern 47(7):1652\u20131665","journal-title":"IEEE Trans Cybern"},{"key":"501_CR16","first-page":"1","volume":"142","author":"K Helsgaun","year":"2011","unstructured":"Helsgaun K (2011) Solving the clustered traveling salesman problem using the Lin\u2013Kernighan\u2013Helsgaun algorithm. Comput Sci Res Rep 142:1\u201316","journal-title":"Comput Sci Res Rep"},{"key":"501_CR17","doi-asserted-by":"crossref","unstructured":"Julstrom BA (2005) The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem. In: Proceedings of the 7th annual conference on genetic and evolutionary computation, ACM, pp 585\u2013590","DOI":"10.1145\/1068009.1068108"},{"key":"501_CR18","first-page":"1","volume":"78","author":"CW Lin","year":"2016","unstructured":"Lin CW, Wu BY (2016) On the minimum routing cost clustered tree problem. J Combin Optim 78:1\u201316","journal-title":"J Combin Optim"},{"issue":"12","key":"501_CR19","doi-asserted-by":"publisher","first-page":"3218","DOI":"10.1016\/j.cor.2012.10.001","volume":"40","author":"M Mestria","year":"2013","unstructured":"Mestria M, Ochi LS, de Lima MS (2013) GRASP with path relinking for the symmetric euclidean clustered traveling salesman problem. Comput Oper Res 40(12):3218\u20133229","journal-title":"Comput Oper Res"},{"issue":"4","key":"501_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"YS Myung","year":"1995","unstructured":"Myung YS, Lee CH, Tcha DW (1995) On the generalized minimum spanning tree problem. Networks 26(4):231\u2013241","journal-title":"Networks"},{"key":"501_CR21","doi-asserted-by":"publisher","unstructured":"Palmer C, Kershenbaum A (1994) Representing trees in genetic algorithms. IEEE, Orlando, FL, USA, pp 379\u2013384. https:\/\/doi.org\/10.1109\/ICEC.1994.349921. http:\/\/ieeexplore.ieee.org\/document\/349921\/","DOI":"10.1109\/ICEC.1994.349921"},{"key":"501_CR22","doi-asserted-by":"crossref","unstructured":"Perfecto C, Bilbao MN, Del\u00a0Ser J, Ferro A, Salcedo-Sanz S (2016) Dandelion-encoded harmony search heuristics for opportunistic traffic offloading in synthetically modeled mobile networks. In: Harmony search algorithm, Springer, pp 133\u2013145","DOI":"10.1007\/978-3-662-47926-1_14"},{"issue":"6","key":"501_CR23","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks and some generalizations. Bell Labs Tech J 36(6):1389\u20131401","journal-title":"Bell Labs Tech J"},{"issue":"5","key":"501_CR24","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/JSAC.1986.1146376","volume":"4","author":"J Prisco","year":"1986","unstructured":"Prisco J (1986) Fiber optic regional area networks in New York and Dallas. IEEE J Sel Areas Commun 4(5):750\u2013757","journal-title":"IEEE J Sel Areas Commun"},{"issue":"3","key":"501_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"GR Raidl","year":"2003","unstructured":"Raidl GR, Julstrom BA (2003) Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7(3):225\u2013239","journal-title":"IEEE Trans Evol Comput"},{"key":"501_CR26","doi-asserted-by":"crossref","unstructured":"Rothlauf F (2008) Representations for evolutionary algorithms. In: Proceedings of the 10th annual conference companion on Genetic and evolutionary computation, ACM, pp 2613\u20132638","DOI":"10.1145\/1388969.1389070"},{"key":"501_CR27","doi-asserted-by":"crossref","unstructured":"Sagarna R, Ong YS (2016) Concurrently searching branches in software tests generation through multitask evolution, IEEE, pp 1\u20138","DOI":"10.1109\/SSCI.2016.7850040"},{"key":"501_CR28","doi-asserted-by":"crossref","unstructured":"Tang J, Chen Y, Deng Z, Xiang Y, Joy CP (2018) A group-based approach to improve multifactorial evolutionary algorithm. In: IJCAI, pp 3870\u20133876","DOI":"10.24963\/ijcai.2018\/538"},{"key":"501_CR29","doi-asserted-by":"publisher","unstructured":"Thanh PD (2018) CluSPT instances. Mendeley Data v2. https:\/\/doi.org\/10.17632\/b4gcgybvt6.2","DOI":"10.17632\/b4gcgybvt6.2"},{"key":"501_CR30","doi-asserted-by":"publisher","unstructured":"Thanh PD (2018) Results obtained by AAL, C-MFEA and E-MFEA. Mendeley Data v3, pp 40\u201350. https:\/\/doi.org\/10.17632\/8ktdhvyj82.3","DOI":"10.17632\/8ktdhvyj82.3"},{"key":"501_CR31","doi-asserted-by":"publisher","unstructured":"Thanh PD, Dung DA, Tien TN, Binh HTT (2018) An effective representation scheme in multifactorial evolutionary algorithm for solving cluster shortest-path tree problem. In: 2018 IEEE congress on evolutionary computation (CEC), pp 1\u20138. https:\/\/doi.org\/10.1109\/CEC.2018.8477684","DOI":"10.1109\/CEC.2018.8477684"},{"key":"501_CR32","doi-asserted-by":"publisher","unstructured":"Thi Thanh Binh H, Dinh Thanh P, Ba Trung T, Phuong Thao L (2018) Effective multifactorial evolutionary algorithm for solving the cluster shortest path tree problem. In: 2018 IEEE congress on evolutionary computation (CEC), pp 1\u20138. https:\/\/doi.org\/10.1109\/CEC.2018.8477912","DOI":"10.1109\/CEC.2018.8477912"},{"issue":"1","key":"501_CR33","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TEVC.2006.880730","volume":"11","author":"E Thompson","year":"2007","unstructured":"Thompson E, Paulden T, Smith DK (2007) The dandelion code: a new coding of spanning trees for genetic algorithms. IEEE Trans Evol Comput 11(1):91\u2013100","journal-title":"IEEE Trans Evol Comput"},{"key":"501_CR34","doi-asserted-by":"crossref","unstructured":"Wen YW, Ting CK (2016) Learning ensemble of decision trees through multifactorial genetic programming. In: IEEE congress on evolutionary computation (CEC), IEEE, pp 5293\u20135300","DOI":"10.1109\/CEC.2016.7748363"},{"key":"501_CR35","doi-asserted-by":"crossref","unstructured":"Wen YW, Ting CK (2017) Parting ways and reallocating resources in evolutionary multitasking. In: IEEE congress on evolutionary computation (CEC), IEEE, pp 2404\u20132411","DOI":"10.1109\/CEC.2017.7969596"},{"issue":"2","key":"501_CR36","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/s10878-014-9772-7","volume":"30","author":"BY Wu","year":"2015","unstructured":"Wu BY, Lin CW (2015) On the clustered Steiner tree problem. J Combin Optim 30(2):370\u2013386","journal-title":"J Combin Optim"},{"key":"501_CR37","doi-asserted-by":"crossref","unstructured":"Xie T, Gong M, Tang Z, Lei Y, Liu J, Wang Z (2016) Enhancing evolutionary multifactorial optimization based on particle swarm optimization. In: IEEE congress on evolutionary computation (CEC), IEEE, pp 1658\u20131665","DOI":"10.1109\/CEC.2016.7743987"},{"key":"501_CR38","doi-asserted-by":"crossref","unstructured":"Yuan Y, Ong YS, Gupta A, Tan PS, Xu H (2016) Evolutionary multitasking in permutation-based combinatorial optimization problems: realization with tsp, qap, lop, and jsp. In: Region 10 conference (TENCON), IEEE, pp 3157\u20133164","DOI":"10.1109\/TENCON.2016.7848632"},{"key":"501_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSMC.2018.2833139","volume":"99","author":"J Zhong","year":"2018","unstructured":"Zhong J, Feng L, Cai W, Ong YS (2018) Multifactorial genetic programming for symbolic regression problems. IEEE Trans Syst Man Cybern Syst 99:1\u201314","journal-title":"IEEE Trans Syst Man Cybern Syst"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00501-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-020-00501-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00501-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T03:26:12Z","timestamp":1646364372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-020-00501-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,14]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["501"],"URL":"https:\/\/doi.org\/10.1007\/s12065-020-00501-w","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"type":"print","value":"1864-5909"},{"type":"electronic","value":"1864-5917"}],"subject":[],"published":{"date-parts":[[2020,10,14]]},"assertion":[{"value":"27 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}