{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:00:56Z","timestamp":1778601656336,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T00:00:00Z","timestamp":1596585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T00:00:00Z","timestamp":1596585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"U.S. Army Combat Capabilities Development Command (CCDC) Pacific and CCDC Army Research Laboratory","award":["W90GQZ-93290007"],"award-info":[{"award-number":["W90GQZ-93290007"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12293-020-00309-2","type":"journal-article","created":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T04:08:37Z","timestamp":1596600517000},"page":"185-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Multifactorial evolutionary algorithm for solving clustered tree problems: competition among Cayley codes"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2550-9546","authenticated-orcid":false,"given":"Thanh Pham","family":"Dinh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1976-6113","authenticated-orcid":false,"given":"Binh Huynh Thi","family":"Thanh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trung Tran","family":"Ba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long Nguyen","family":"Binh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,5]]},"reference":[{"key":"309_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms","author":"T Back","year":"1996","unstructured":"Back T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford"},{"key":"309_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:69\u201383","journal-title":"IEEE Trans Evol Comput"},{"key":"309_CR3","doi-asserted-by":"crossref","unstructured":"Binh HTT, Thanh PD, Trung TB, Thao LP (2018) Effective multifactorial evolutionary algorithm for solving the cluster shortest path tree problem. In: 2018 IEEE congress on evolutionary computation (CEC). IEEE, pp 819\u2013826","DOI":"10.1109\/CEC.2018.8477684"},{"key":"309_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":"309_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"},{"key":"309_CR6","doi-asserted-by":"crossref","unstructured":"Da B, Gupta A, Ong YS, Feng L (2016) Evolutionary multitasking across single and multi-objective formulations for improved problem solving. In: 2016 IEEE congress on evolutionary computation (CEC), IEEE, pp 1695\u20131701","DOI":"10.1109\/CEC.2016.7743992"},{"key":"309_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2014.06.009","volume":"289","author":"J Derrac","year":"2014","unstructured":"Derrac J, Garc\u00eda S, Hui S, Suganthan PN, Herrera F (2014) Analyzing convergence performance of evolutionary algorithms: a statistical approach. Inf Sci 289:41\u201358","journal-title":"Inf Sci"},{"key":"309_CR8","doi-asserted-by":"publisher","first-page":"165","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 Comb Optim 38:165\u2013184","journal-title":"J Comb Optim"},{"key":"309_CR9","volume-title":"Representations for genetic and evolutionary algorithms","author":"R Franz","year":"2006","unstructured":"Franz R (2006) Representations for genetic and evolutionary algorithms. Springer, Berlin"},{"issue":"1\u20134","key":"309_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s40747-016-0011-y","volume":"1","author":"A Gupta","year":"2015","unstructured":"Gupta A, Ma\u0144dziuk 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":"309_CR11","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"},{"key":"309_CR12","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:1652\u20131665","journal-title":"IEEE Trans Cybern"},{"key":"309_CR13","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"},{"issue":"3","key":"309_CR14","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1007\/s10878-016-0026-8","volume":"33","author":"CW Lin","year":"2017","unstructured":"Lin CW, Wu BY (2017) On the minimum routing cost clustered tree problem. J Comb Optim 33(3):1106\u20131121","journal-title":"J Comb Optim"},{"issue":"12","key":"309_CR15","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 Martins S (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":"309_CR16","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"},{"issue":"2","key":"309_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s12559-016-9395-7","volume":"8","author":"YS Ong","year":"2016","unstructured":"Ong YS, Gupta A (2016) Evolutionary multitasking: a computer science view of cognitive multitasking. Cogn Comput 8(2):125\u2013142","journal-title":"Cogn Comput"},{"key":"309_CR18","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":"309_CR19","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":"3","key":"309_CR20","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"},{"issue":"4","key":"309_CR21","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014A traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"309_CR22","doi-asserted-by":"publisher","unstructured":"Thanh PD (2019) CluSPT instances. Mendeley Data v3. https:\/\/doi.org\/10.17632\/b4gcgybvt6.3","DOI":"10.17632\/b4gcgybvt6.3"},{"key":"309_CR23","doi-asserted-by":"crossref","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), IEEE, pp 811\u2013818","DOI":"10.1109\/CEC.2018.8477684"},{"issue":"1","key":"309_CR24","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":"309_CR25","doi-asserted-by":"crossref","unstructured":"Wu BY, Lin CW (2014) Clustered trees with minimum inter-cluster distance. In: 2014 IEEE 17th International conference on computational science and engineering (CSE), IEEE, pp 1138\u20131141","DOI":"10.1109\/CSE.2014.223"},{"issue":"2","key":"309_CR26","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 Comb Optim 30(2):370\u2013386","journal-title":"J Comb Optim"},{"key":"309_CR27","doi-asserted-by":"crossref","unstructured":"Yuan Y, Ong YS, Gupta A, Tan PS, Xu H (2016) (2016) Evolutionary multitasking in permutation-based combinatorial optimization problems: Realization with tsp, qap, lop, and jsp. In: Region 10 conference (TENCON). IEEE, IEEE, pp 3157\u20133164","DOI":"10.1109\/TENCON.2016.7848632"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-020-00309-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-020-00309-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-020-00309-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T00:21:04Z","timestamp":1628122864000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-020-00309-2"}},"subtitle":["Case studies on the clustered shortest-path tree problem and the minimum inter-cluster routing cost clustered tree problem"],"short-title":[],"issued":{"date-parts":[[2020,8,5]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["309"],"URL":"https:\/\/doi.org\/10.1007\/s12293-020-00309-2","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,5]]},"assertion":[{"value":"12 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2020","order":3,"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"}}]}}