{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T14:31:29Z","timestamp":1776781889619,"version":"3.51.2"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T00:00:00Z","timestamp":1504051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61463007"],"award-info":[{"award-number":["61463007"]}],"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":["61563008"],"award-info":[{"award-number":["61563008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00521-017-3176-4","type":"journal-article","created":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T09:50:53Z","timestamp":1504086653000},"page":"2155-2170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Discrete greedy flower pollination algorithm for spherical traveling salesman problem"],"prefix":"10.1007","volume":"31","author":[{"given":"Yongquan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengyan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qifang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed A.","family":"Metwally","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,30]]},"reference":[{"issue":"5","key":"3176_CR1","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1999","unstructured":"Arora S (1999) Polynomial time approximation schemes for Euclidean travelling salesman and other geometric problems. J ACM 45(5):753\u2013782","journal-title":"J ACM"},{"issue":"1\u20132","key":"3176_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0004-3702(95)00054-2","volume":"81","author":"WX Zhang","year":"1996","unstructured":"Zhang WX, Korf RE (1996) A study of complexity transitions on the asymmetric travelling salesman problem. Artif Intell 81(1\u20132):223\u2013239","journal-title":"Artif Intell"},{"issue":"7","key":"3176_CR3","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1016\/j.cor.2011.09.005","volume":"39","author":"A Rodriguez","year":"2012","unstructured":"Rodriguez A, Ruiz R (2012) The effect of the asymmetry of road transportation networks on the travelling salesman problem. Comput Oper Res 39(7):1566\u20131576","journal-title":"Comput Oper Res"},{"issue":"2","key":"3176_CR4","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.rcim.2009.05.003","volume":"26","author":"Y Wang","year":"2010","unstructured":"Wang Y, Liu JH (2010) Chaotic particle swarm optimization for assembly sequence planning. Robot Comput Integr Manuf 26(2):212\u2013222","journal-title":"Robot Comput Integr Manuf"},{"key":"3176_CR5","doi-asserted-by":"crossref","unstructured":"Berman P, Karpinski M (2006) Approximation algorithm for TSP. In: SODA\u201906, Miami, pp 641\u2013648","DOI":"10.1145\/1109557.1109627"},{"key":"3176_CR6","doi-asserted-by":"publisher","DOI":"10.5772\/12909","author":"R Matail","year":"2010","unstructured":"Matail R (2010) Travelling salesman problem: an overview of applications, formulations, and solution approaches. Travel Salesm Probl Theory Appl. doi: 10.5772\/12909","journal-title":"Travel Salesm Probl Theory Appl"},{"key":"3176_CR7","doi-asserted-by":"publisher","unstructured":"Shi P, Jia S (2013) A hybrid artificial bee colony algorithm combined with simulated annealing algorithm for travelling salesman problem. In: IEEE 2013 International conference on information science and cloud computing companion (ISCC-C). doi: 10.1109\/ISCC-C.2013.13","DOI":"10.1109\/ISCC-C.2013.13"},{"key":"3176_CR8","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586153","author":"S-P Tseng","year":"2010","unstructured":"Tseng S-P (2010) A fast ant colony optimization algorithm for travelling salesman problem. Evol Comput. doi: 10.1109\/CEC.2010.5586153","journal-title":"Evol Comput"},{"key":"3176_CR9","doi-asserted-by":"crossref","unstructured":"Honda K, Nagata Y, Ono I (2013) A parallel genetic algorithm with edge assembly crossover for 100,000-city scale TSPs. In: IEEE 2013 IEEE congress on evolutionary computation (CEC), pp 1278\u20131285","DOI":"10.1109\/CEC.2013.6557712"},{"issue":"14","key":"3176_CR10","first-page":"137","volume":"11","author":"Y Duan","year":"2009","unstructured":"Duan Y, Sun Y (2009) A particle swarm optimization algorithm with ant search for solving travelling salesman problem. Int Conf Comput Intell Secur 11(14):137\u2013141","journal-title":"Int Conf Comput Intell Secur"},{"key":"3176_CR11","doi-asserted-by":"publisher","DOI":"10.5772\/13270","author":"A Chaudhuri","year":"2008","unstructured":"Chaudhuri A, De K (2008) A study of travelling salesman problem using fuzzy self-organizing map. Ind Inf Syst. doi: 10.5772\/13270","journal-title":"Ind Inf Syst"},{"key":"3176_CR12","doi-asserted-by":"publisher","unstructured":"Takahash S (2002) The SOM-TSP method for the there-dimension city location problem. In: Proceedings of the 9th international conference on neural information processing. doi: 10.1109\/ICONIP.2002.1201955","DOI":"10.1109\/ICONIP.2002.1201955"},{"issue":"3","key":"3176_CR13","first-page":"219","volume":"14","author":"A U\u011fur","year":"2009","unstructured":"U\u011fur A, Koruko\u011flu S, \u00c7al\u0131\u015fkan A et al (2009) Genetic algorithm based solution for TSP on a sphere. Math Comput Appl 14(3):219\u2013228","journal-title":"Math Comput Appl"},{"key":"3176_CR14","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1785\/BSSA0850030951","volume":"85","author":"C Lomnitz","year":"1995","unstructured":"Lomnitz C (1995) On the distribution of distances between random points on a sphere. Bull Seismol Soc Am 85:951\u2013953","journal-title":"Bull Seismol Soc Am"},{"key":"3176_CR15","first-page":"4489","volume":"28","author":"W Gang","year":"2011","unstructured":"Gang W, Zhigang L (2011) Spherical travelling salesman problem constant and its experimental analysis. Appl Res Comput 28:4489\u20134491","journal-title":"Appl Res Comput"},{"key":"3176_CR16","doi-asserted-by":"crossref","unstructured":"Yang XS (2012) Flower pollination algorithm for global optimization. In: Unconventional computation and natural computation, lecture notes in computer science, vol 445, pp 240\u2013249","DOI":"10.1007\/978-3-642-32894-7_27"},{"issue":"9","key":"3176_CR17","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1080\/0305215X.2013.832237","volume":"46","author":"XS Yang","year":"2014","unstructured":"Yang XS, Karamanoglu M, He XS (2014) Flower pollination algorithm: a novel approach for multi-objective optimization. Eng Optim 46(9):1222\u20131237","journal-title":"Eng Optim"},{"key":"3176_CR18","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.procs.2013.05.251","volume":"18","author":"XS Yang","year":"2013","unstructured":"Yang XS, Karamanoglu M, He XS (2013) Multiobjective flower algorithm for optimization. Procedia Comput Sci 18:861\u2013868","journal-title":"Procedia Comput Sci"},{"issue":"3","key":"3176_CR19","first-page":"54","volume":"4","author":"M Sharawi","year":"2014","unstructured":"Sharawi M, Emary E, Saroit IA et al (2014) Flower pollination optimization algorithm for wireless sensor network lifetime global optimization. Int J Soft Comput Eng 4(3):54\u201359","journal-title":"Int J Soft Comput Eng"},{"issue":"3","key":"3176_CR20","doi-asserted-by":"publisher","first-page":"126","DOI":"10.14445\/22315381\/IJETT-V7P225","volume":"7","author":"O Abdel-Raouf","year":"2014","unstructured":"Abdel-Raouf O, Abdel-Baset M, El-henawy I (2014) A novel hybrid flower pollination algorithm with chaotic harmony search for solving sudoku puzzles. Int J Eng Trends Technol 7(3):126\u2013132","journal-title":"Int J Eng Trends Technol"},{"key":"3176_CR21","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.neucom.2015.01.110","volume":"188","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Wang R, Luo Q (2016) Elite opposition-based flower pollination algorithm. Neurocomputing 188:294\u2013310","journal-title":"Neurocomputing"},{"issue":"4","key":"3176_CR22","doi-asserted-by":"publisher","first-page":"1659010","DOI":"10.1142\/S0218001416590102","volume":"30","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Wang R (2016) An improved flower pollination algorithm for optimal unmanned undersea vehicle path planning problem. Int J Pattern Recognit Artif Intell 30(4):1659010","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"1","key":"3176_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2015.08.007","volume":"116","author":"R Wang","year":"2016","unstructured":"Wang R, Zhou Y, Qiao S, Huang K (2016) Flower pollination algorithm with bee pollinator for cluster analysis. Inf Process Lett 116(1):1\u201314","journal-title":"Inf Process Lett"},{"issue":"3","key":"3176_CR24","first-page":"72","volume":"8","author":"I El-henawy","year":"2014","unstructured":"El-henawy I, Ismail M (2014) An improved chaotic flower pollination algorithm for solving large integer programming problems. Int J Digit Content Technol Its Appl 8(3):72\u201381","journal-title":"Int J Digit Content Technol Its Appl"},{"key":"3176_CR25","unstructured":"Wikipedia, Great circle. http:\/\/en.wikipedia.org\/wiki\/Great_circle.2012"},{"key":"3176_CR26","doi-asserted-by":"publisher","DOI":"10.1002\/9780470640425","volume-title":"Engineering optimization: an introduction with metaheuristic applications","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Engineering optimization: an introduction with metaheuristic applications. Wiley, New York"},{"issue":"3","key":"3176_CR27","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459\u2013471","journal-title":"J Glob Optim"},{"key":"3176_CR28","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1016\/j.cam.2012.01.013","volume":"236","author":"W-F Gao","year":"2012","unstructured":"Gao W-F, Liu S-Y (2012) A global best artificial bee colony algorithm for global optimization. J Comput Appl Math 236:2741\u20132753","journal-title":"J Comput Appl Math"},{"issue":"3","key":"3176_CR29","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"CN Fiechter","year":"1994","unstructured":"Fiechter CN (1994) A parallel tabu search algorithm for large travelling salesman problems. Discrete Appl Math 51(3):243\u2013267","journal-title":"Discrete Appl Math"},{"key":"3176_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-017-4803-x","author":"M Abdel-Basset","year":"2017","unstructured":"Abdel-Basset M, Wang G-G, Sangaiah AK, Rushdy E (2017) Krill herd algorithm based on cuckoo search for solving engineering optimization problems. Multimed Tools Appl. doi: 10.1007\/s11042-017-4803-x","journal-title":"Multimed Tools Appl"},{"key":"3176_CR31","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.asoc.2015.02.019","volume":"30","author":"AK Sangaiah","year":"2015","unstructured":"Sangaiah AK, Thangavelu AK, Gao XZ, Anbazhagan N, Saleem Dur M (2015) An ANFIS approach for evaluation of team-level service climate in GSD projects using Taguchi-genetic learning algorithm. Appl Soft Comput 30:628\u2013635","journal-title":"Appl Soft Comput"},{"key":"3176_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2017.2703784","author":"G-G Wang","year":"2017","unstructured":"Wang G-G, Cai X, Cui Z, Min G, Chen J (2017) High performance computing for cyber physical social systems by using evolutionary multi-objective optimization algorithm. IEEE Trans Emerg Top Comput. doi: 10.1109\/TETC.2017.2703784","journal-title":"IEEE Trans Emerg Top Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-3176-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-017-3176-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-3176-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T23:25:06Z","timestamp":1659396306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-017-3176-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,30]]},"references-count":32,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["3176"],"URL":"https:\/\/doi.org\/10.1007\/s00521-017-3176-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,30]]},"assertion":[{"value":"27 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2017","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 conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}