{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T18:52:16Z","timestamp":1775155936822,"version":"3.50.1"},"reference-count":52,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876185"],"award-info":[{"award-number":["61876185"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,23]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>To solve travelling salesman problems (TSPs), most existing evolutionary algorithms search for optimal solutions from zero initial information without taking advantage of the historical information of solving similar problems. This paper studies a transfer learning-based particle swarm optimization (PSO) algorithm, where the optimal information of historical problems is used to guide the swarm to find optimal paths quickly. To begin with, all cities in the new and historical TSP problems are clustered into multiple city subsets, respectively, and a city topology matching strategy based on geometric similarity is proposed to match each new city subset to a historical city subset. Then, on the basis of the above-matched results, a hierarchical generation strategy of the feasible path (HGT) is proposed to initialize the swarm to improve the performance of PSO. Moreover, a problem-specific update strategy, i.e. the particle update strategy with adaptive crossover and clustering-guided mutation, is introduced to enhance the search capability of the proposed algorithm. Finally, the proposed algorithm is applied to 20 typical TSP problems and compared with 12 state-of-the-art algorithms. Experimental results show that the transfer learning mechanism can accelerate the search efficiency of PSO and make the proposed algorithm achieve better optimal paths.<\/jats:p>","DOI":"10.1093\/jcde\/qwac039","type":"journal-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T11:13:48Z","timestamp":1650885228000},"page":"933-948","source":"Crossref","is-referenced-by-count":30,"title":["A transfer learning-based particle swarm optimization algorithm for travelling salesman problem"],"prefix":"10.1093","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1993-4124","authenticated-orcid":false,"given":"Rui-zhao","family":"Zheng","sequence":"first","affiliation":[{"name":"School of Information and Control Engineering, China University of Mining and Technology , Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information and Control Engineering, China University of Mining and Technology , Xuzhou 221116, China"},{"name":"Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University , Changchun 130012, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kang","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Information and Control Engineering, China University of Mining and Technology , Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,5,23]]},"reference":[{"key":"2022070406563594200_bib1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/EICT.2014.6777868","article-title":"Velocity tentative particle swarm optimization to solve TSP","volume-title":"2013 International Conference on Electrical Information and Communication Technology (EICT)","author":"Akhand","year":"2014"},{"issue":"3","key":"2022070406563594200_bib2","first-page":"1","article-title":"Velocity tentative PSO: An optimal velocity implementation based particle swarm optimization to solve traveling salesman problem","volume":"42","author":"Akhand","year":"2015","journal-title":"IAENG International Journal of Computer Science"},{"key":"2022070406563594200_bib3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-3-319-50920-4_17","article-title":"An improved spider monkey optimization for solving a convex economic dispatch problem","volume-title":"Nature-Inspired Computing and Optimization","author":"Ali","year":"2017"},{"key":"2022070406563594200_bib4","doi-asserted-by":"crossref","first-page":"100607","DOI":"10.1016\/j.swevo.2019.100607","article-title":"A novel design of differential evolution for solving discrete traveling salesman problems","volume":"52","author":"Ali","year":"2020","journal-title":"Swarm and Evolutionary Computation"},{"issue":"2","key":"2022070406563594200_bib5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1080\/02564602.2015.1057770","article-title":"Using k-means radius particle swarm optimization for the travelling salesman problem","volume":"33","author":"Anantathanavit","year":"2016","journal-title":"IETE Technical Review"},{"issue":"3","key":"2022070406563594200_bib6","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1016\/j.ejor.2019.07.062","article-title":"Dynamic traveling salesman problem with stochastic release dates","volume":"280","author":"Archetti","year":"2020","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"2022070406563594200_bib7","doi-asserted-by":"crossref","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","article-title":"Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques","volume":"38","author":"Chen","year":"2011","journal-title":"Expert Systems with Applications"},{"issue":"10","key":"2022070406563594200_bib8","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1007\/s00500-012-0855-z","article-title":"A novel two-stage hybrid swarm intelligence optimization algorithm and application","volume":"16","author":"Deng","year":"2012","journal-title":"Soft Computing"},{"key":"2022070406563594200_bib9","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1109\/CEC.2015.7257018","article-title":"Transfer learning in genetic programming","volume-title":"2015 IEEE Congress on Evolutionary Computation (CEC)","author":"Dinh","year":"2015"},{"key":"2022070406563594200_bib10","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.asoc.2014.09.031","article-title":"A comparative study of the improvement of performance using a PSO modified by ACO applied to TSP","volume":"25","author":"Elloumi","year":"2014","journal-title":"Applied Soft Computing"},{"issue":"3","key":"2022070406563594200_bib11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s12293-015-0166-x","article-title":"Memes as building blocks: A case study on evolutionary optimization+ transfer learning for routing problems","volume":"7","author":"Feng","year":"2015","journal-title":"Memetic Computing"},{"issue":"4","key":"2022070406563594200_bib12","doi-asserted-by":"crossref","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","article-title":"Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search","volume":"11","author":"Geng","year":"2011","journal-title":"Applied Soft Computing"},{"issue":"3","key":"2022070406563594200_bib13","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1016\/j.ejor.2017.04.061","article-title":"Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem","volume":"262","author":"Gouveia","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"2022070406563594200_bib14","doi-asserted-by":"crossref","first-page":"107049","DOI":"10.1016\/j.knosys.2021.107049","article-title":"A surrogate-assisted multi-objective particle swarm optimization of expensive constrained combinatorial optimization problems","volume":"223","author":"Gu","year":"2021","journal-title":"Knowledge-Based Systems"},{"issue":"5","key":"2022070406563594200_bib15","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","article-title":"A parallel cooperative hybrid method based on ant colony optimization and 3-opt algorithm for solving traveling salesman problem","volume":"22","author":"G\u00fclc\u00fc","year":"2018","journal-title":"Soft Computing"},{"key":"2022070406563594200_bib16","first-page":"842","article-title":"Text categorization with knowledge transfer from heterogeneous data sources","volume-title":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence","author":"Gupta","year":"2008"},{"key":"2022070406563594200_bib17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","article-title":"Improving variable neighborhood search to solve the traveling salesman problem","volume":"68","author":"Hore","year":"2018","journal-title":"Applied Soft Computing"},{"key":"2022070406563594200_bib18","doi-asserted-by":"crossref","first-page":"108068","DOI":"10.1016\/j.knosys.2021.108068","article-title":"A multi-objective discrete particle swarm optimization method for particle routing in distributed particle filters","volume":"240","author":"Hou","year":"2022","journal-title":"Knowledge-Based Systems"},{"key":"2022070406563594200_bib19","doi-asserted-by":"crossref","first-page":"108736","DOI":"10.1016\/j.asoc.2022.108736","article-title":"Multi-surrogate assisted binary particle swarm optimization algorithm and its application for feature selection","volume":"121","author":"Hu","year":"2022","journal-title":"Applied Soft Computing"},{"issue":"2","key":"2022070406563594200_bib20","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1093\/jcde\/qwab009","article-title":"A novel particle swarm optimization-based grey model for the prediction of warehouse performance","volume":"8","author":"Islam","year":"2021","journal-title":"Journal of Computational Design and Engineering"},{"issue":"4","key":"2022070406563594200_bib21","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/TEVC.2021.3064835","article-title":"Dual-surrogate-assisted cooperative particle swarm optimization for expensive multimodal problems","volume":"25","author":"Ji","year":"2021","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"4","key":"2022070406563594200_bib22","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TEVC.2017.2771451","article-title":"Transfer learning-based dynamic multiobjective optimization algorithms","volume":"22","author":"Jiang","year":"2017","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2022070406563594200_bib23","doi-asserted-by":"crossref","first-page":"107199","DOI":"10.1016\/j.knosys.2021.107199","article-title":"Development of deer hunting linked earthworm optimization algorithm for solving large scale traveling salesman problem","volume":"227","author":"Kanna","year":"2021","journal-title":"Knowledge-Based Systems"},{"key":"2022070406563594200_bib24","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle swarm optimization","volume-title":"Proceedings of ICNN\u201995 \u2013 International Conference on Neural Networks","author":"Kennedy","year":"1995"},{"key":"2022070406563594200_bib25","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","article-title":"A swap sequence based artificial bee colony algorithm for traveling salesman problem","volume":"44","author":"Khan","year":"2019","journal-title":"Swarm and Evolutionary Computation"},{"issue":"10","key":"2022070406563594200_bib26","doi-asserted-by":"crossref","first-page":"6997","DOI":"10.1016\/j.eswa.2010.03.019","article-title":"Genetic transfer learning","volume":"37","author":"Ko\u00e7er","year":"2010","journal-title":"Expert Systems with Applications"},{"key":"2022070406563594200_bib27","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.swevo.2015.05.002","article-title":"Heterogeneous comprehensive learning particle swarm optimization with enhanced exploration and exploitation","volume":"24","author":"Lynn","year":"2015","journal-title":"Swarm and Evolutionary Computation"},{"key":"2022070406563594200_bib28","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","article-title":"A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem","volume":"30","author":"Mahi","year":"2015","journal-title":"Applied Soft Computing"},{"issue":"10","key":"2022070406563594200_bib29","doi-asserted-by":"crossref","first-page":"1454","DOI":"10.1016\/j.ins.2008.12.016","article-title":"A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem","volume":"179","author":"Masutti","year":"2009","journal-title":"Information Sciences"},{"issue":"12","key":"2022070406563594200_bib30","doi-asserted-by":"crossref","first-page":"8955","DOI":"10.1007\/s00521-019-04427-y","article-title":"Transfer learning-based convolutional neural networks with heuristic optimization for hand gesture recognition","volume":"31","author":"Ozcan","year":"2019","journal-title":"Neural Computing and Applications"},{"issue":"10","key":"2022070406563594200_bib31","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/TKDE.2009.191","article-title":"A survey on transfer learning","volume":"22","author":"Pan","year":"2009","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"2022070406563594200_bib32","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1093\/jcde\/qwaa035","article-title":"V-rep-based navigation of automated wheeled robot between obstacles using pso-tuned feedforward neural network","volume":"7","author":"Pandey","year":"2020","journal-title":"Journal of Computational Design and Engineering"},{"key":"2022070406563594200_bib33","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.asoc.2015.03.038","article-title":"Performance analyses over population seeding techniques of the permutation-coded genetic algorithm: An empirical study based on traveling salesman problems","volume":"32","author":"Paul","year":"2015","journal-title":"Applied Soft Computing"},{"issue":"4","key":"2022070406563594200_bib34","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"Tsplib\u2013a traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"2022070406563594200_bib35","first-page":"1","article-title":"To transfer or not to transfer","volume-title":"NIPS 2005 Workshop on Transfer Learning","author":"Rosenstein","year":"2005"},{"key":"2022070406563594200_bib36","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.neucom.2018.09.039","article-title":"On computational complexity of the constructive-optimizer neural network for the traveling salesman problem","volume":"321","author":"Saadatmand-Tarzjan","year":"2018","journal-title":"Neurocomputing"},{"issue":"4","key":"2022070406563594200_bib37","doi-asserted-by":"crossref","first-page":"2003","DOI":"10.1007\/s11071-019-05092-5","article-title":"Continuous relaxations for the traveling salesman problem","volume":"97","author":"Sahai","year":"2019","journal-title":"Nonlinear Dynamics"},{"key":"2022070406563594200_bib38","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/ICEC.1998.699146","article-title":"A modified particle swarm optimizer","volume-title":"1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98TH8360)","author":"Shi","year":"1998"},{"issue":"5","key":"2022070406563594200_bib39","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1109\/TEVC.2020.2968743","article-title":"Variable-size cooperative coevolutionary particle swarm optimization for feature selection on high-dimensional data","volume":"24","author":"Song","year":"2020","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"2022070406563594200_bib40","first-page":"1","article-title":"A new generalized partition crossover for the traveling salesman problem: Tunneling between local optima","volume":"28","author":"Tin\u00f3s","year":"2019","journal-title":"Evolutionary computation"},{"key":"2022070406563594200_bib42","doi-asserted-by":"crossref","first-page":"107439","DOI":"10.1016\/j.asoc.2021.107439","article-title":"Ant colony optimization for traveling salesman problem based on parameters optimization","volume":"107","author":"Wang","year":"2021","journal-title":"Applied Soft Computing"},{"key":"2022070406563594200_bib41","doi-asserted-by":"crossref","first-page":"2424","DOI":"10.1109\/TIP.2019.2948480","article-title":"Class-specific reconstruction transfer learning for visual recognition across domains","volume":"29","author":"Wang","year":"2019","journal-title":"IEEE Transactions on Image Processing"},{"key":"2022070406563594200_bib43","doi-asserted-by":"crossref","first-page":"114145","DOI":"10.1016\/j.eswa.2020.114145","article-title":"A multi-objective co-evolutionary algorithm of scheduling on parallel non-identical batch machines","volume":"167","author":"Wang","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"2022070406563594200_bib44","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/AMS.2010.41","article-title":"A generic bee colony optimization framework for combinatorial optimization problems","volume-title":"2010 Fourth Asia International Conference on Mathematical\/Analytical Modelling and Computer Simulation","author":"Wong","year":"2010"},{"key":"2022070406563594200_bib45","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.neucom.2012.10.043","article-title":"Evolving RBF neural networks for rainfall prediction using hybrid particle swarm optimization and genetic algorithm","volume":"148","author":"Wu","year":"2015","journal-title":"Neurocomputing"},{"issue":"12","key":"2022070406563594200_bib46","doi-asserted-by":"crossref","first-page":"4862","DOI":"10.1109\/TCYB.2019.2943928","article-title":"Triple archives particle swarm optimization","volume":"50","author":"Xia","year":"2020","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"5","key":"2022070406563594200_bib47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3340848","article-title":"Self-adaptive particle swarm optimization for large-scale feature selection in classification","volume":"13","author":"Xue","year":"2019","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"key":"2022070406563594200_bib48","doi-asserted-by":"crossref","first-page":"101505","DOI":"10.1016\/j.jobe.2020.101505","article-title":"Multi-objective optimization of building energy performance using a particle swarm optimizer with less control parameters","volume":"32","author":"Yong","year":"2020","journal-title":"Journal of Building Engineering"},{"key":"2022070406563594200_bib49","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.knosys.2016.10.024","article-title":"Accelerating bio-inspired optimizer with transfer reinforcement learning for reactive power optimization","volume":"116","author":"Zhang","year":"2017","journal-title":"Knowledge-Based Systems"},{"issue":"5","key":"2022070406563594200_bib50","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1093\/jcde\/qwab041","article-title":"An adaptive hybrid atom search optimization with particle swarm optimization and its application to optimal no-load pid design of hydro-turbine governor","volume":"8","author":"Zhao","year":"2021","journal-title":"Journal of Computational Design and Engineering"},{"key":"2022070406563594200_bib51","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ins.2017.08.067","article-title":"Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem","volume":"421","author":"Zhong","year":"2017","journal-title":"Information Sciences"},{"key":"2022070406563594200_bib52","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","article-title":"Discrete comprehensive learning particle swarm optimization algorithm with metropolis acceptance criterion for traveling salesman problem","volume":"42","author":"Zhong","year":"2018","journal-title":"Swarm and Evolutionary Computation"}],"container-title":["Journal of Computational Design and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/9\/3\/933\/44386599\/qwac039.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/9\/3\/933\/44386599\/qwac039.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T06:57:29Z","timestamp":1656917849000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jcde\/article\/9\/3\/933\/6590609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5,23]]}},"URL":"https:\/\/doi.org\/10.1093\/jcde\/qwac039","relation":{},"ISSN":["2288-5048"],"issn-type":[{"value":"2288-5048","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,6]]},"published":{"date-parts":[[2022,5,23]]}}}