{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:16:05Z","timestamp":1769919365235,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:00:00Z","timestamp":1578528000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:00:00Z","timestamp":1578528000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10489-019-01599-x","type":"journal-article","created":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T19:05:42Z","timestamp":1578596742000},"page":"1233-1258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["An efficient strategy for using multifactorial optimization to solve the clustered shortest path tree problem"],"prefix":"10.1007","volume":"50","author":[{"given":"Pham Dinh","family":"Thanh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huynh Thi Thanh","family":"Binh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tran Ba","family":"Trung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,9]]},"reference":[{"issue":"11","key":"1599_CR1","doi-asserted-by":"publisher","first-page":"4773","DOI":"10.1007\/s11227-017-2046-2","volume":"73","author":"LM Abualigah","year":"2017","unstructured":"Abualigah L M, Khader A T (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J Supercomput 73(11):4773\u20134795","journal-title":"J Supercomput"},{"key":"1599_CR2","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-10674-4","volume-title":"Feature Selection and Enhanced Krill Herd Algorithm for Text Document Clustering","author":"Laith Mohammad Qasim Abualigah","year":"2019","unstructured":"Abualigah LMQ (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Springer, Berlin"},{"key":"1599_CR3","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"},{"key":"1599_CR4","doi-asserted-by":"crossref","unstructured":"Bali KK, Ong YS, Gupta A, Tan PS (2019) Multifactorial Evolutionary Algorithm with Online Transfer Parameter Estimation: MFEA-II. IEEE Transactions on Evolutionary Computation","DOI":"10.1109\/TEVC.2019.2906927"},{"issue":"23","key":"1599_CR5","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.ipl.2012.08.020","volume":"112","author":"Bao X","year":"2012","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","journal-title":"Inf Process Lett"},{"key":"1599_CR6","unstructured":"Binh H T, Thanh P D, Trung T B, et al. (2018) Effective multifactorial evolutionary algorithm for solving the cluster shortest path tree problem. In: In: 2018 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 1\u20138"},{"key":"1599_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.knosys.2019.05.015","volume":"180","author":"HTT Binh","year":"2019","unstructured":"Binh H T T, Thanh P D, Thang T B (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"},{"issue":"3","key":"1599_CR8","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1007\/s11063-017-9718-z","volume":"47","author":"R Chandra","year":"2018","unstructured":"Chandra R, Gupta A, Ong Y S, Goh C K (2018) Evolutionary multi-task learning for modular knowledge representation in neural networks. Neural Process Lett 47(3):993\u20131009","journal-title":"Neural Process Lett"},{"key":"1599_CR9","unstructured":"D\u2019Emidio M, Forlizzi L, Frigioni D, Leucci S, Proietti G (2016) On the Clustered Shortest-Path Tree Problem. In: Italian Conference on Theoretical Computer Science (ICTCS), pp 263\u2013268"},{"key":"1599_CR10","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":"1599_CR11","first-page":"13","volume-title":"Natural Computing Series","author":"A. E. Eiben","year":"2015","unstructured":"Eiben A, Smith J (2015) Evolutionary computing: the origins. Springer, Berlin"},{"issue":"6","key":"1599_CR12","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":"1-4","key":"1599_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, Ma\u0144dziuk J, Ong Y S (2015) Evolutionary multitasking in bi-level optimization. Compl Intell Syst 1(1-4):83\u201395","journal-title":"Compl Intell Syst"},{"issue":"3","key":"1599_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 Y S, Feng L (2016) Multifactorial evolution: toward evolutionary multitasking. IEEE Trans Evol Comput 20(3):343\u2013357","journal-title":"IEEE Trans Evol Comput"},{"key":"1599_CR15","unstructured":"Liaw RT, Ting CK (2017) Evolutionary many-tasking based on biocoenosis through symbiosis: A framework and benchmark problems. In: 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 2266\u20132273"},{"issue":"3","key":"1599_CR16","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1007\/s10878-016-0026-8","volume":"33","author":"CW Lin","year":"2016","unstructured":"Lin C W, Wu B Y (2016) On the minimum routing cost clustered tree problem. J Comb Optim 33 (3):1106\u20131121","journal-title":"J Comb Optim"},{"key":"1599_CR17","doi-asserted-by":"crossref","unstructured":"Mart\u00ed R, Pardalos PM, Resende MG (2018) Handbook of Heuristics. Springer, Berlin","DOI":"10.1007\/978-3-319-07124-4"},{"key":"1599_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2017.12.018","volume":"116","author":"M Mestria","year":"2018","unstructured":"Mestria M (2018) New hybrid heuristic algorithm for the clustered traveling salesman problem. Comput Ind Eng 116:1\u201312","journal-title":"Comput Ind Eng"},{"issue":"12","key":"1599_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 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"},{"key":"1599_CR20","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.swevo.2016.06.005","volume":"32","author":"R Moharam","year":"2017","unstructured":"Moharam R, Morsy E (2017) Genetic algorithms to balanced tree structures in graphs. Swarm Evol Comput 32:132\u2013139","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"1599_CR21","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"YS Myung","year":"1995","unstructured":"Myung Y S, Lee C H, Tcha D W (1995) On the generalized minimum spanning tree problem. Networks 26(4):231\u2013241","journal-title":"Networks"},{"issue":"2","key":"1599_CR22","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s12559-016-9395-7","volume":"8","author":"YS Ong","year":"2016","unstructured":"Ong Y S, Gupta A (2016) Evolutionary multitasking: a computer science view of cognitive multitasking. Cogn Comput 8(2):125\u2013142","journal-title":"Cogn Comput"},{"key":"1599_CR23","unstructured":"Pham D T, Huynh TTB (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, pp 142\u2013149"},{"key":"1599_CR24","unstructured":"Pham DT, Huynh TTB (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, pp 142\u2013149"},{"issue":"1","key":"1599_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2019.05.017","volume":"283","author":"Petric\u0103 C. Pop","year":"2020","unstructured":"Pop PC (2019) The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances. European Journal of Operational Research. https:\/\/doi.org\/10.1016\/j.ejor.2019.05.017, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221719304217","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"1599_CR26","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 R C (1957) Shortest connection networks and some generalizations. Bell Labs Techn J 36(6):1389\u20131401","journal-title":"Bell Labs Techn J"},{"issue":"5","key":"1599_CR27","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":"1599_CR28","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"GR Raidl","year":"2003","unstructured":"Raidl G R, Julstrom B A (2003) Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7(3):225\u2013 239","journal-title":"IEEE Trans Evol Comput"},{"key":"1599_CR29","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":"1599_CR30","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1016\/j.proeng.2012.01.110","volume":"29","author":"W Shu-Xi","year":"2012","unstructured":"Shu-Xi W (2012) The improved dijkstra\u2019s shortest path algorithm and its application. Procedia Eng 29:1186\u20131190","journal-title":"Procedia Eng"},{"key":"1599_CR31","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":"1599_CR32","doi-asserted-by":"crossref","unstructured":"Thanh PD, Binh HTT, Lam BT (2015) New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem. In: Knowledge and Systems Engineering. Springer, pp 367\u2013379","DOI":"10.1007\/978-3-319-11680-8_29"},{"key":"1599_CR33","doi-asserted-by":"crossref","unstructured":"Thanh P D, Dung D A, Tien T N, Binh H T T (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 1\u20138","DOI":"10.1109\/CEC.2018.8477684"},{"key":"1599_CR34","doi-asserted-by":"crossref","unstructured":"Thanh P D, Binh H T T, Long N B et al (2019) A heuristic based on randomized greedy algorithms for the clustered shortest-path tree problem. In: 2019 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 2915\u20132922","DOI":"10.1109\/CEC.2019.8790070"},{"key":"1599_CR35","unstructured":"Wen YW, Ting CK (2017) Parting ways and reallocating resources in evolutionary multitasking. In: 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 2404\u20132411"},{"issue":"2","key":"1599_CR36","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/s10878-014-9772-7","volume":"30","author":"BY Wu","year":"2015","unstructured":"Wu B Y, Lin C W (2015) On the clustered Steiner tree problem. J Comb Optim 30(2):370\u2013386","journal-title":"J Comb Optim"},{"key":"1599_CR37","doi-asserted-by":"crossref","unstructured":"Yuan Y, Ong Y S, Gupta A, Tan P S, Xu H (2016) Evolutionary multitasking in permutation-based combinatorial optimization problems: Realization with tsp, qap, lop, and jsp. In: 2016 IEEE Region 10 conference (TENCON). IEEE, pp 3157\u20133164","DOI":"10.1109\/TENCON.2016.7848632"},{"key":"1599_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.07.008","volume":"89","author":"T Zhang","year":"2018","unstructured":"Zhang T, Ke L, Li J, Li J, Huang J, Li Z (2018) Metaheuristics for the tabu clustered traveling salesman problem. Comput Oper Res 89:1\u201312","journal-title":"Comput Oper Res"},{"key":"1599_CR39","unstructured":"Zhou L, Feng L, Zhong J, Ong Y S, Zhu Z, Sha E (2016) Evolutionary multitasking in combinatorial search spaces: a case study in capacitated vehicle routing problem. In: 2016 IEEE Symposium Series on Computational intelligence (SSCI). IEEE, pp 1-8"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-019-01599-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-019-01599-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-019-01599-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T01:37:10Z","timestamp":1610069830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-019-01599-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,9]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["1599"],"URL":"https:\/\/doi.org\/10.1007\/s10489-019-01599-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,9]]},"assertion":[{"value":"9 January 2020","order":1,"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":"<!--Emphasis Type='Bold' removed-->Conflict of interests"}},{"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"}}]}}