{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T16:55:48Z","timestamp":1783184148720,"version":"3.54.6"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T00:00:00Z","timestamp":1641168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T00:00:00Z","timestamp":1641168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62066005"],"award-info":[{"award-number":["62066005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2018GXNSFAA138146"],"award-info":[{"award-number":["2018GXNSFAA138146"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Intell Syst"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The multiple traveling salesman problem (MTSP) is an extension of the traveling salesman problem (TSP). It is found that the MTSP problem on a three-dimensional sphere has more research value. In a spherical space, each city is located on the surface of the Earth. To solve this problem, an integer-serialized coding and decoding scheme was adopted, and artificial electric field algorithm (AEFA) was mixed with greedy strategy and state transition strategy, and an artificial electric field algorithm based on greedy state transition strategy (GSTAEFA) was proposed. Greedy state transition strategy provides state transition interference for AEFA, increases the diversity of population, and effectively improves the accuracy of the algorithm. Finally, we test the performance of GSTAEFA by optimizing examples with different numbers of cities. Experimental results show that GSTAEFA has better performance in solving SMTSP problems than other swarm intelligence algorithms.<\/jats:p>","DOI":"10.1007\/s44196-021-00059-0","type":"journal-article","created":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T13:03:22Z","timestamp":1641215002000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Artificial Electric Field Algorithm with Greedy State Transition Strategy for Spherical Multiple Traveling Salesmen Problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Jian","family":"Bi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guo","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4404-952X","authenticated-orcid":false,"given":"Yongquan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qifang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wu","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,3]]},"reference":[{"key":"59_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0927-0507(05)80121-5","volume":"7","author":"M J\u00fcnger","year":"1995","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G.: The traveling salesman problem. Handbooks Oper. Res. Manag. Sci. 7, 225\u2013330 (1995)","journal-title":"Handbooks Oper. Res. Manag. Sci."},{"key":"59_CR2","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.knosys.2018.05.033","volume":"158","author":"Y Zhao","year":"2018","unstructured":"Zhao, Y., Zheng, Z., Liu, Y.: Survey on computational-intelligence-based UAV path planning. Knowl.-Based Syst. 158, 54\u201364 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"59_CR3","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.cie.2015.02.029","volume":"85","author":"CM Joo","year":"2015","unstructured":"Joo, C.M., Kim, B.S.: Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability. Comput. Ind. Eng. 85, 102\u2013109 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"59_CR4","first-page":"1","volume":"2018","author":"F Xi","year":"2018","unstructured":"Xi, F., Wang, W., He, L., Huang, Z., Yang, L., Zhang, L.: Research on improved NSGA-II Algorithm and its application in emergency management. Math. Prob. Eng. 2018, 1\u201313 (2018)","journal-title":"Math. Prob. Eng."},{"issue":"3","key":"59_CR5","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1016\/j.ejor.2017.04.061","volume":"262","author":"L Gouveia","year":"2017","unstructured":"Gouveia, L., Leitner, M., Ruthmair, M.: Extended Formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem. Eur. J. Oper. Res. 262(3), 908\u2013928 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"59_CR6","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.ejor.2017.02.017","volume":"261","author":"J Kinable","year":"2017","unstructured":"Kinable, J., Smeulders, B., Delcour, E., Spieksma, F.C.R.: Exact algorithms for the Equitable Traveling Salesman Problem. Eur. J. Oper. Res. 261(2), 475\u2013485 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"59_CR7","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1287\/opre.2017.1603","volume":"65","author":"A Asadpour","year":"2017","unstructured":"Asadpour, A., Goemans, M.X., Mdry, A., Gharan, S.O., Saberi, A.: An O (log n \/log log n )-Approximation algorithm for the asymmetric traveling salesman problem. Oper. Res. 65(4), 1043\u20131061 (2017)","journal-title":"Oper. Res."},{"issue":"10","key":"59_CR8","doi-asserted-by":"crossref","first-page":"8947","DOI":"10.1016\/j.eswa.2012.02.029","volume":"39","author":"Y Nagata","year":"2012","unstructured":"Nagata, Y., Soler, D.: A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst. Appl. 39(10), 8947\u20138953 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"59_CR9","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1023\/B:HEUR.0000045321.59202.52","volume":"10","author":"L Buriol","year":"2004","unstructured":"Buriol, L., Franca, P.M., Moscato, P.: A new memetic algorithm for the asymmetric traveling salesman problem. J Heuristics 10(5), 483\u2013506 (2004)","journal-title":"J Heuristics"},{"issue":"22","key":"59_CR10","doi-asserted-by":"crossref","first-page":"8956","DOI":"10.1016\/j.eswa.2015.07.051","volume":"42","author":"ID Psychas","year":"2015","unstructured":"Psychas, I.D., Delimpasi, E., Marinakis, Y.: Hybrid evolutionary algorithms for the multiobjective traveling salesman problem. Expert Syst. Appl. 42(22), 8956\u20138970 (2015)","journal-title":"Expert Syst. Appl."},{"key":"59_CR11","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/j.swevo.2018.08.004","volume":"44","author":"SS Choong","year":"2019","unstructured":"Choong, S.S., Wong, L.P., Lim, C.P.: An artificial bee colony algorithm with a modified choice function for the traveling salesman problem. Swarm Evol. Comput. 44, 622\u2013635 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"59_CR12","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.eswa.2014.07.054","volume":"42","author":"JB Escario","year":"2015","unstructured":"Escario, J.B., Jimenez, J.F., Giron-Sierra, J.M.: Ant colony extended: experiments on the travelling salesman problem. Expert Syst. Appl. 42(1), 390\u2013410 (2015)","journal-title":"Expert Syst. Appl."},{"key":"59_CR13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.asoc.2018.06.047","volume":"71","author":"E Osaba","year":"2018","unstructured":"Osaba, E., Del Ser, J., Sadollah, A., Bilbao, M.N., Camacho, D.: A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem. Appl. Soft Comput. 71, 277\u2013290 (2018)","journal-title":"Appl. Soft Comput."},{"key":"59_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba, E., Yang, X.S., Diaz, F., Lopez-Garcia, P., Carballedo, R.: An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng. Appl. Artif. Intell. 48, 59\u201371 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"4","key":"59_CR15","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1007\/s00500-014-1322-9","volume":"19","author":"A Ouaarab","year":"2015","unstructured":"Ouaarab, A., Ahiod, B., Yang, X.S.: Random-key cuckoo search for the travelling salesman problem. Soft. Comput. 19(4), 1099\u20131106 (2015)","journal-title":"Soft. Comput."},{"issue":"24","key":"59_CR16","doi-asserted-by":"crossref","first-page":"8167","DOI":"10.1007\/s00500-017-2760-y","volume":"22","author":"A Hatamlou","year":"2018","unstructured":"Hatamlou, A.: Solving travelling salesman problem using black hole algorithm. Soft. Comput. 22(24), 8167\u20138175 (2018)","journal-title":"Soft. Comput."},{"key":"59_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","volume":"42","author":"Y Zhong","year":"2018","unstructured":"Zhong, Y., Lin, J., Wang, L., Zhang, H.: Discrete comprehensive learning particle swarm optimization algorithm with metropolis acceptance criterion for traveling salesman problem. Swarm Evol. Comput. 42, 77\u201388 (2018)","journal-title":"Swarm Evol. Comput."},{"key":"59_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.eswa.2017.01.053","volume":"77","author":"AE-S Ezugwu","year":"2017","unstructured":"Ezugwu, A.E.-S., Adewumi, A.O., Fr\u00cencu, M.E.: Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert Syst. Appl. 77, 189\u2013210 (2017)","journal-title":"Expert Syst. Appl."},{"issue":"11","key":"59_CR19","doi-asserted-by":"crossref","first-page":"e0165804","DOI":"10.1371\/journal.pone.0165804","volume":"11","author":"Z Jiang","year":"2016","unstructured":"Jiang, Z., Yang, Q.: A discrete fruit fly optimization algorithm for the traveling salesman problem. PLoS ONE 11(11), e0165804 (2016)","journal-title":"PLoS ONE"},{"key":"59_CR20","first-page":"1","volume":"99","author":"Z Wang","year":"2020","unstructured":"Wang, Z., Fang, X., Li, H., Jin, H.: An improved Partheno-Genetic algorithm with reproduction mechanism for the multiple traveling salesperson problem. IEEE Access. 99, 1\u20131 (2020)","journal-title":"IEEE Access."},{"issue":"3","key":"59_CR21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006)","journal-title":"Omega"},{"issue":"1","key":"59_CR22","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1016\/j.asoc.2010.03.002","volume":"11","author":"S Ghafurian","year":"2011","unstructured":"Ghafurian, S., Javadian, N.: An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems. Appl. Soft Comput. 11(1), 1256\u20131262 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"59_CR23","first-page":"65","volume":"16","author":"M Yousefikhoshbakht","year":"2013","unstructured":"Yousefikhoshbakht, M., Didehvar, F., Rahmati, F.: Modication of the ant colony optimization for solving the multiple traveling salesman problem. Romanian J. Info. Sci. Technol. 16(1), 65\u201380 (2013)","journal-title":"Romanian J. Info. Sci. Technol."},{"issue":"16","key":"59_CR24","doi-asserted-by":"crossref","first-page":"4661","DOI":"10.1007\/s00500-016-2075-4","volume":"21","author":"C Changdar","year":"2016","unstructured":"Changdar, C., Pal, R.K., Mahapatra, G.S.: A genetic ant colony optimization based algorithm for solid multiple travelling salesmen problem in fuzzy rough environment. Soft Comput. 21(16), 4661\u20134675 (2016)","journal-title":"Soft Comput."},{"issue":"1","key":"59_CR25","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(95)00185-9","volume":"93","author":"CJ Malmborg","year":"1996","unstructured":"Malmborg, C.J.: A genetic algorithm for service level based vehicle scheduling. Eur. J. Oper. Res. 93(1), 121\u2013134 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"59_CR26","first-page":"246","volume":"175","author":"AE Carter","year":"2006","unstructured":"Carter, A.E., Ragsdale, C.T.: A new approach to solving the multiple traveling salesperson problem using genetic algorithms. Ship Electron. Eng. 175(1), 246\u2013257 (2006)","journal-title":"Ship Electron. Eng."},{"key":"59_CR27","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.asoc.2014.09.029","volume":"26","author":"P Venkatesh","year":"2015","unstructured":"Venkatesh, P., Singh, A.: Two metaheuristic approaches for the multiple traveling salesperson problem. Appl. Soft Comput. 26, 74\u201389 (2015)","journal-title":"Appl. Soft Comput."},{"key":"59_CR28","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1016\/j.asoc.2017.08.041","volume":"61","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Jia, Z., Ai, X., Yang, D., Yu, J.: A modified two-part wolf pack search algorithm for the multiple traveling salesmen problem. Appl. Soft Comput. 61, 714\u2013725 (2017)","journal-title":"Appl. Soft Comput."},{"key":"59_CR29","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.asoc.2017.12.031","volume":"64","author":"H Zhou","year":"2018","unstructured":"Zhou, H., Song, M., Pedrycz, W.: A comparative study of improved GA and PSO in solving multiple traveling salesmen problem. Appl. Soft Comput. 64, 564\u2013580 (2018)","journal-title":"Appl. Soft Comput."},{"key":"59_CR30","doi-asserted-by":"crossref","unstructured":"Takahashi, S., K. Fujimura, H. Tokutaka.: The SOM-TSP method for the three-dimension city location problem. International Conference on Neural Information Processing IEEE (2002)","DOI":"10.1109\/ICONIP.2002.1201955"},{"issue":"3","key":"59_CR31","first-page":"219","volume":"14","author":"A Ugur","year":"2009","unstructured":"Ugur, A., Korukoglu, S., Cal\u0131skan, A., et al.: Genetic algorithm based solution for TSP on a sphere. Math Comput Appl 14(3), 219\u2013228 (2009)","journal-title":"Math Comput Appl"},{"key":"59_CR32","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1785\/BSSA0850030951","volume":"85","author":"C Lomnitz","year":"1995","unstructured":"Lomnitz, C.: On the distribution of distances between random points on a sphere. Bull Seismol Soc Am 85, 951\u2013953 (1995)","journal-title":"Bull Seismol Soc Am"},{"issue":"4","key":"59_CR33","first-page":"1242","volume":"20","author":"H Eldem","year":"2017","unstructured":"Eldem, H., \u00dclker, E.: The application of ant colony optimization in the solution of 3D traveling salesman problem on a sphere. Eng. Sci. Technol. Int. J. 20(4), 1242\u20131248 (2017)","journal-title":"Eng. Sci. Technol. Int. J."},{"key":"59_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.04.057","author":"X Chen","year":"2017","unstructured":"Chen, X., Zhou, Y., et al.: A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems. Appl. Soft Comput. (2017). https:\/\/doi.org\/10.1016\/j.asoc.2017.04.057","journal-title":"Appl. Soft Comput."},{"key":"59_CR35","doi-asserted-by":"crossref","first-page":"2155","DOI":"10.1007\/s00521-017-3176-4","volume":"31","author":"Y Zhou","year":"2019","unstructured":"Zhou, Y., Wang, R., Zhao, C., et al.: Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput & Applic 31, 2155\u20132170 (2019)","journal-title":"Neural Comput & Applic"},{"issue":"2","key":"59_CR36","doi-asserted-by":"crossref","first-page":"777","DOI":"10.12785\/amis\/070248","volume":"7","author":"X Ouyang","year":"2013","unstructured":"Ouyang, X., Zhou, Y., Luo, Q., Chen, H.: A novel discrete cuckoo search algorithm for spherical traveling salesman problem. Appl. Math. Info. Sci. 7(2), 777\u2013784 (2013)","journal-title":"Appl. Math. Info. Sci."},{"key":"59_CR37","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.swevo.2019.03.013","volume":"48","author":"S Anita","year":"2019","unstructured":"Anita, S., Yadav, A.: AEFA: artificial electric field algorithm for global optimization. Swarm Evol. Comput. 48, 93\u2013108 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"59_CR38","doi-asserted-by":"publisher","unstructured":"Anita, Y.A., Kumar, N.: Artificial electric field algorithm for solving real parameter CEC 2017 benchmark problems. In: Nagar, A., Deep, K., Bansal, J., Das, K. (eds.) Soft Computing for Problem Solving 2019. Advances in Intelligent Systems and Computing, vol. 1138. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-3290-0_13","DOI":"10.1007\/978-981-15-3290-0_13"},{"key":"59_CR39","doi-asserted-by":"crossref","first-page":"113308","DOI":"10.1016\/j.eswa.2020.113308","volume":"149","author":"S Anita","year":"2020","unstructured":"Anita, S., Yadav, A., Kumar, N.: Artificial electric field algorithm for engineering optimization problems. Expert Syst. Appl. 149, 113308 (2020)","journal-title":"Expert Syst. Appl."},{"key":"59_CR40","doi-asserted-by":"crossref","first-page":"106260","DOI":"10.1016\/j.asoc.2020.106260","volume":"92","author":"S Anita","year":"2020","unstructured":"Anita, S., Yadav, A.: Discrete artificial electric field algorithm for high-order graph matching. Appl. Soft Comput. 92, 106260 (2020)","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"59_CR41","doi-asserted-by":"crossref","first-page":"584","DOI":"10.3390\/pr8050584","volume":"8","author":"H Petwal","year":"2020","unstructured":"Petwal, H., Rani, R.: An improved artificial electric field algorithm for multi-objective optimization. Processes 8(5), 584 (2020)","journal-title":"Processes"},{"issue":"1","key":"59_CR42","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1002\/er.5756","volume":"45","author":"SI Selem","year":"2021","unstructured":"Selem, S.I., El-Fergany, A.A., Hasanien, H.M.: Artificial electric field algorithm to extract nine parameters of triple-diode photovoltaic model. Int. J. Energy Res. 45(1), 590\u2013604 (2021)","journal-title":"Int. J. Energy Res."},{"issue":"3","key":"59_CR43","doi-asserted-by":"crossref","first-page":"1386","DOI":"10.1002\/ima.22530","volume":"31","author":"P Sinthia","year":"2020","unstructured":"Sinthia, P., Malathi, M.: Cancer detection using convolutional neural network optimized by multistrategy artificial electric field algorithm. Int. J. Imaging Syst. Technol. 31(3), 1386\u20131403 (2020)","journal-title":"Int. J. Imaging Syst. Technol."},{"issue":"10","key":"59_CR44","first-page":"105893","volume":"199","author":"A Sajwan","year":"2021","unstructured":"Sajwan, A., Yadav, A.: An intelligent model for the detection of white blood cells using artificial intelligence. Comput. Methods Programs Biomed. 199(10), 105893 (2021)","journal-title":"Comput. Methods Programs Biomed."},{"issue":"2","key":"59_CR45","doi-asserted-by":"crossref","first-page":"120028","DOI":"10.1016\/j.energy.2021.120028","volume":"223","author":"A Sharma","year":"2021","unstructured":"Sharma, A., Jain, S.K.: Day-ahead optimal reactive power ancillary service procurement under dynamic multi-objective framework in wind integrated deregulated power system. Energy 223(2), 120028 (2021)","journal-title":"Energy"},{"issue":"9","key":"59_CR46","doi-asserted-by":"crossref","first-page":"8355","DOI":"10.1007\/s13369-021-05486-x","volume":"46","author":"H Das","year":"2021","unstructured":"Das, H., Naik, B., Behera, H.S.: Optimal selection of features using artificial electric field algorithm for classification. Arab J Sci Eng 46(9), 8355\u20138369 (2021)","journal-title":"Arab J Sci Eng"},{"key":"59_CR47","doi-asserted-by":"crossref","first-page":"106905","DOI":"10.1016\/j.knosys.2021.106905","volume":"8","author":"S Niroomand","year":"2021","unstructured":"Niroomand, S.: Hybrid artificial electric field algorithm for assembly line balancing problem with equipment model selection possibility. Knowledge-Based Syst. 8, 106905 (2021)","journal-title":"Knowledge-Based Syst."},{"issue":"1","key":"59_CR48","doi-asserted-by":"crossref","first-page":"107278","DOI":"10.1016\/j.asoc.2021.107278","volume":"105","author":"A Naderipour","year":"2021","unstructured":"Naderipour, A., Abdul-Malek, Z., Mustafa, M., Guerrero, J.M.: A multi-objective artificial electric field optimization algorithm for allocation of wind turbines in distribution systems. Appl Soft Comput. 105(1), 107278 (2021)","journal-title":"Appl Soft Comput."},{"key":"59_CR49","doi-asserted-by":"crossref","first-page":"112867","DOI":"10.1016\/j.eswa.2019.112867","volume":"139","author":"C Jiang","year":"2019","unstructured":"Jiang, C., Wan, Z., Peng, Z.: A new efficient hybrid algorithm for large scale multiple traveling salesman problems. Expert Syst. Appl. 139, 112867 (2019)","journal-title":"Expert Syst. Appl."},{"key":"59_CR50","doi-asserted-by":"crossref","unstructured":"Zhou, X., Yang, C., Gui, W.: Initial version of state transition algorithm. In: 2011 Second International Conference on Digital Manufacturing & Automation (IEEE), pp. 644\u2013647 (2011)","DOI":"10.1109\/ICDMA.2011.160"},{"key":"59_CR51","doi-asserted-by":"crossref","unstructured":"Zhou, X., Yang, C., Gui, W.: A new transformation into state transition algorithm for finding the global minimum. In: 2011 2nd International Conference on Intelligent Control and Information Processing (IEEE), vol 2, pp. 674\u201367 (2011)","DOI":"10.1109\/ICICIP.2011.6008335"},{"issue":"4","key":"59_CR52","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.3934\/jimo.2012.8.1039","volume":"8","author":"X Zhou","year":"2012","unstructured":"Zhou, X., Yang, C., Gui, W.: State transition algorithm. J. Ind. Manag. Optim. 8(4), 1039\u20131056 (2012)","journal-title":"J. Ind. Manag. Optim."},{"key":"59_CR53","doi-asserted-by":"crossref","unstructured":"Tan, Y, Zhu, Y.: Fireworks algorithm for optimization. Advances in Swarm Intelligence, First International Conference, ICSI 2010, Beijing, China, June 12\u201315, 2010, Proceedings, Part I (2010)","DOI":"10.1007\/978-3-642-13495-1"},{"key":"59_CR54","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Flower pollination algorithm for global optimization. In: Unconventional computation and natural computation, Lecture Notes in Computer Science, 445, 240\u2013249 (2012)","DOI":"10.1007\/978-3-642-32894-7_27"},{"key":"59_CR55","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S Li","year":"2020","unstructured":"Li, S., Chen, H., Wang, M., Heidari, A.A., Mirjalili, S.: Slime mould algorithm: a new method for stochastic optimization. Futur. Gener. Comput. Syst. 111, 300\u2013323 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"59_CR56","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.ins.2020.06.037","volume":"540","author":"I Ahmadianfar","year":"2020","unstructured":"Ahmadianfar, I., Bozorg-Haddad, O., Chu, X.: Gradient-based optimizer: a new metaheuristic optimization algorithm. Info. Sci. 540, 131\u2013159 (2020)","journal-title":"Info. Sci."},{"issue":"6","key":"59_CR57","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda, S., Molina, D., Lozano, M., Herrera, F.: A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: acase study on the CEC\u20192005 Special Session on Real Parameter Optimization. J. Heuristics 15(6), 617\u2013644 (2009)","journal-title":"J. Heuristics"},{"key":"59_CR58","first-page":"1","volume":"99","author":"X Han","year":"2020","unstructured":"Han, X., Xu, Q., Yue, L., Dong, Y., Xu, X.: an improved crow search algorithm based on spiral search mechanism for solving numerical and engineering optimization problems. IEEE Access 99, 1\u20131 (2020)","journal-title":"IEEE Access"},{"key":"59_CR59","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.ins.2018.11.041","volume":"478","author":"H Garg","year":"2019","unstructured":"Garg, H.: A hybrid GSA-GA algorithm for constrained optimization problems. Info. Sci. 478, 499\u2013523 (2019)","journal-title":"Info. Sci."},{"key":"59_CR60","unstructured":"Harish, G.: A hybrid GA-GSA algorithm for optimizing the performance of an industrial system by utilizing uncertain data (2015)"},{"key":"59_CR61","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.amc.2015.11.001","volume":"274","author":"H Garg","year":"2016","unstructured":"Garg, H.: A hybrid PSO-GA algorithm for constrained optimization problems. Appl. Math. Comput. 274, 292\u2013305 (2016). https:\/\/doi.org\/10.1016\/j.amc.2015.11.001","journal-title":"Appl. Math. Comput."},{"key":"59_CR62","doi-asserted-by":"publisher","DOI":"10.1002\/int.22707","author":"T Kundu","year":"2021","unstructured":"Kundu, T., Garg, H.: A hybrid ITLHHO algorithm for numerical and engineering optimization problems. Int. J. Intell. Syst. (2021). https:\/\/doi.org\/10.1002\/int.22707","journal-title":"Int. J. Intell. Syst."}],"container-title":["International Journal of Computational Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-021-00059-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44196-021-00059-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-021-00059-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T15:12:13Z","timestamp":1674313933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44196-021-00059-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,3]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s44196-021-00059-0","relation":{},"ISSN":["1875-6883"],"issn-type":[{"value":"1875-6883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,3]]},"assertion":[{"value":"15 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflicts 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":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"5"}}