{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:31:00Z","timestamp":1773930660281,"version":"3.50.1"},"reference-count":33,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2024,1,14]],"date-time":"2024-01-14T00:00:00Z","timestamp":1705190400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"name":"Shandong Provincial Natural Science Foundation of China","award":["ZR2023MF092"],"award-info":[{"award-number":["ZR2023MF092"]}]},{"name":"Foundation of State Key Laboratory of Public Big Data","award":["PBD2023-14"],"award-info":[{"award-number":["PBD2023-14"]}]},{"name":"Beijing Key Laboratory of Urban Spatial Information Engineering","award":["20220109"],"award-info":[{"award-number":["20220109"]}]},{"name":"Basic Science Research Project of Colleges and Universities in Jiangsu Province","award":["22KJA520004"],"award-info":[{"award-number":["22KJA520004"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371491"],"award-info":[{"award-number":["12371491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902189"],"award-info":[{"award-number":["61902189"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010088","name":"Shandong Provincial Key Laboratory of Software Engineering","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010088","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,24]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>This research presents a new problem maximum scatter colored traveling salesman problem (MSCTSP), the objective of MSCTSP is to find Hamiltonian cycles with the minimal edge as max as possible, it is used to simulate the real-world applications of network and transport. Since MSCTSP has been proved to be a NP-hard problem, population-based algorithms can be used for solving it. However, the performances are not satisfactory. Thus, it is necessary to develop novel algorithms to obtain high quality feasible solution. Based on the above reason, the paper proposes a novel hybrid IT\u00d6 (HIT\u00d6) algorithm, which integrates the two new strategies: crossover operator and mutation strategy, into the standard IT\u00d6. In the iteration course of HIT\u00d6, the dual-chromosome coding is used to code a feasible solution of MSCTSP, and the stochastic drift and volatility operators are used to explore and exploit new unknown region. During the process, drift operator is performed by crossover operator, volatility operator is carried out by mutation strategy, and they are both affected by activity intensity of particles which functionally depends on the radius and temperature. Experiments display HIT\u00d6 shows an improvement over comparative algorithms on solution quality.<\/jats:p>","DOI":"10.1093\/comjnl\/bxad131","type":"journal-article","created":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T06:52:20Z","timestamp":1705301540000},"page":"2172-2188","source":"Crossref","is-referenced-by-count":4,"title":["Hybrid IT\u00d6 Algorithm for Maximum Scatter Colored Traveling Salesman Problem"],"prefix":"10.1093","volume":"67","author":[{"given":"Xueshi","family":"Dong","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Qingdao University , Ningxia Road, Qingdao, 266071 , China"},{"name":"State Key Laboratory of Public Big Data, Guizhou University , Jiaxiu South Road, Huaxi District, Guiyang, 550025 , China"}]},{"given":"Qing","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Qingdao University , Ningxia Road, Qingdao, 266071 , China"},{"name":"Beijing Key Laboratory of Urban Spatial Information Engineering , Nanlishi Road, Xicheng District, Beijing, 100038 , China"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Qingdao University , Ningxia Road, Qingdao, 266071 , China"}]}],"member":"286","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"key":"2024062414154217300_ref1","doi-asserted-by":"crossref","first-page":"2390","DOI":"10.1109\/TCYB.2014.2371918","article-title":"Colored traveling salesman problem","volume":"45","author":"Li","year":"2015","journal-title":"IEEE Transact. Cybernet."},{"key":"2024062414154217300_ref2","first-page":"1","volume-title":"Proceedings of the 2013 IEEE International Conference on Systems Man and Cybernetics","author":"Li","year":"2013"},{"key":"2024062414154217300_ref3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1504\/IJWMC.2016.080175","article-title":"Discrete IT\u00d4 algorithm to the colored travelling salesman problem","volume":"11","author":"Dong","year":"2016","journal-title":"Int. J. Wireless Mobile Comput."},{"key":"2024062414154217300_ref4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/TSMC.2016.2591267","article-title":"Population-based incremental learning algorithm for a serial colored traveling salesman problem","volume":"48","author":"Meng","year":"2018","journal-title":"IEEE Transact. Syst., Man, and Cybernet.: Systems"},{"key":"2024062414154217300_ref5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.neucom.2014.01.075","article-title":"Evolutionary algorithm and decisional DNA for multiple travelling salesman problem","volume":"150","author":"Wang","year":"2015","journal-title":"Neurocomputing"},{"key":"2024062414154217300_ref6","doi-asserted-by":"crossref","first-page":"3410","DOI":"10.1016\/j.apm.2014.11.043","article-title":"Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming","volume":"39","author":"Kota","year":"2015","journal-title":"App. Math. Model."},{"key":"2024062414154217300_ref7","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.asoc.2014.09.029","article-title":"Two metaheuristic approaches for the multiple traveling salesperson problem","volume":"26","author":"Venkatesh","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"2024062414154217300_ref8","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.ejor.2017.02.017","article-title":"Exact algorithms for the equitable traveling salesman problem","volume":"261","author":"Kinable","year":"2017","journal-title":"Eur. J. Operat. Res."},{"key":"2024062414154217300_ref9","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/j.ejor.2018.04.028","article-title":"The indefinite period traveling salesman problem","volume":"270","author":"Sun","year":"2018","journal-title":"Eur. J. Operat. Res."},{"key":"2024062414154217300_ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2016.12.017","article-title":"The traveling purchaser problem and its variants","volume":"259","author":"Manerba","year":"2017","journal-title":"Eur. J. Operat. Res."},{"key":"2024062414154217300_ref11","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":"Eur. J. Operat. Res."},{"key":"2024062414154217300_ref12","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.ejor.2017.11.063","article-title":"Solving the family traveling salesman problem","volume":"267","author":"Bernardino","year":"2018","journal-title":"Eur. J. Operat. Res."},{"key":"2024062414154217300_ref13","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.ejor.2018.03.042","article-title":"Fixed-parameter algorithms for rectilinear steiner tree and rectilinear traveling salesman problem in the plane","volume":"270","author":"Cambazard","year":"2018","journal-title":"Eur. J. Operat. Res."},{"key":"2024062414154217300_ref14","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1016\/j.ejor.2018.05.009","article-title":"The bi-objective insular traveling salesman problem with maritime and ground transportation costs","volume":"271","author":"Miranda","year":"2018","journal-title":"Eur. J. Operat. Res."},{"key":"2024062414154217300_ref15","doi-asserted-by":"crossref","first-page":"2717","DOI":"10.1109\/TCYB.2016.2577587","article-title":"A novel consensus-based particle swarm optimization-assisted trust-tech methodology for large-scale global optimization","volume":"47","author":"Zhang","year":"2017","journal-title":"IEEE Transaction on Cybernetics"},{"key":"2024062414154217300_ref16","doi-asserted-by":"crossref","first-page":"4108","DOI":"10.1109\/TCYB.2016.2600577","article-title":"Test problems for large-scale multiobjective and many-objective optimization","volume":"47","author":"Cheng","year":"2017","journal-title":"IEEE Transact. Cybernet."},{"key":"2024062414154217300_ref17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TEVC.2016.2600642","article-title":"A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization","volume":"22","author":"Zhang","year":"2018","journal-title":"IEEE Transact. Evolution. Comput."},{"key":"2024062414154217300_ref18","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.ins.2016.11.013","article-title":"Cooperation coevolution with fast interdependency identification for large scale optimization","volume":"381","author":"Hu","year":"2017","journal-title":"Inform. Sci."},{"key":"2024062414154217300_ref19","doi-asserted-by":"crossref","first-page":"1744","DOI":"10.1109\/TPAMI.2016.2611662","article-title":"Efficient & effective prioritized matching for large-scale image-based localization","volume":"39","author":"Sattler","year":"2017","journal-title":"IEEE Transact. Pattern Analysis Mach. Intell."},{"key":"2024062414154217300_ref20","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.future.2018.04.026","article-title":"A novel IT\u00d6 algorithm for influence maximization in the large scale social networks","volume":"88","author":"Wang","year":"2018","journal-title":"Future Generat. Comput. Syst."},{"key":"2024062414154217300_ref21","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1049\/iet-its.2016.0282","article-title":"Ant colony optimization for colored traveling salesman problem by multi-task learning","volume":"12","author":"Dong","year":"2018","journal-title":"IET Intell. Transport Syst."},{"key":"2024062414154217300_ref22","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.future.2018.12.065","article-title":"A novel genetic algorithm for large scale colored balanced traveling salesman problem","volume":"95","author":"Dong","year":"2019","journal-title":"Future Generation Comput. Syst."},{"key":"2024062414154217300_ref23","doi-asserted-by":"crossref","first-page":"107330","DOI":"10.1016\/j.knosys.2021.107330","article-title":"IT\u00d6 algorithm with local search for large scale multiple balanced traveling salesmen problem","volume":"229","author":"Dong","year":"2021","journal-title":"Knowledge-Based Syst."},{"key":"2024062414154217300_ref24","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.future.2020.07.008","article-title":"Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem","volume":"114","author":"Dong","year":"2021","journal-title":"Future Generation Computer Syst."},{"key":"2024062414154217300_ref25","doi-asserted-by":"crossref","first-page":"1483","DOI":"10.1049\/iet-its.2018.5359","article-title":"Artificial bee colony algorithm with generating neighborhood solution for large scale colored traveling salesman problem","volume":"13","author":"Dong","year":"2019","journal-title":"IET Intell. Transport Syst."},{"key":"2024062414154217300_ref26","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.eswa.2016.05.007","article-title":"Dynamic multiscale region search algorithm using vitality selection for traveling salesman problem","volume":"60","author":"Zhang","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"2024062414154217300_ref27","doi-asserted-by":"crossref","first-page":"100514","DOI":"10.1016\/j.iot.2022.100514","article-title":"AI for next generation computing: emerging trends and future directions","volume":"19","author":"Gill","year":"2022","journal-title":"Internet of Things"},{"key":"2024062414154217300_ref28","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1109\/TCYB.2017.2780274","article-title":"Improving metaheuristic algorithms with information feedback models","volume":"49","author":"Wang","year":"2019","journal-title":"IEEE Transact. Cybernet"},{"key":"2024062414154217300_ref29","doi-asserted-by":"crossref","first-page":"107968","DOI":"10.1016\/j.knosys.2021.107968","article-title":"Self-attention neural architecture search for semantic image segmentation","volume":"239","author":"Fan","year":"2022","journal-title":"Knowledge-Based Syst."},{"key":"2024062414154217300_ref30","doi-asserted-by":"crossref","first-page":"2595","DOI":"10.1109\/TNNLS.2020.3006877","article-title":"Discriminative ridge machine: a classifier for high-dimensional data or imbalanced data","volume":"32","author":"Peng","year":"2021","journal-title":"IEEE Transact. Neural Network Learn. Syst."},{"key":"2024062414154217300_ref31","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.ins.2019.09.074","article-title":"Robust principal component analysis: a factorization-based approach with linear complexity","volume":"513","author":"Peng","year":"2020","journal-title":"Inform. Sci."},{"key":"2024062414154217300_ref32","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1109\/TMC.2019.2946811","article-title":"Portfolio optimization in traffic offloading: concept, model, and algorithms","volume":"20","author":"Xu","year":"2021","journal-title":"IEEE Transact. Mobile Comput."},{"key":"2024062414154217300_ref33","doi-asserted-by":"crossref","first-page":"101406","DOI":"10.1016\/j.swevo.2023.101406","article-title":"A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem","volume":"83","author":"Dong","year":"2023","journal-title":"Swarm Evolution. Comput."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/6\/2172\/58309114\/bxad131.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/6\/2172\/58309114\/bxad131.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T14:54:38Z","timestamp":1719240878000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/6\/2172\/7536051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,14]]},"references-count":33,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,1,14]]},"published-print":{"date-parts":[[2024,6,24]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxad131","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,6]]},"published":{"date-parts":[[2024,1,14]]}}}