{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:21:01Z","timestamp":1740108061767,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"36","license":[{"start":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T00:00:00Z","timestamp":1728518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T00:00:00Z","timestamp":1728518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00521-024-10475-w","type":"journal-article","created":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T08:01:57Z","timestamp":1728547317000},"page":"23223-23250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Discrete orca predation algorithm for the traveling salesman problem"],"prefix":"10.1007","volume":"36","author":[{"given":"Hamdi","family":"Kilin\u00e7","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8567-8798","authenticated-orcid":false,"given":"\u0130lhan","family":"\u0130lhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,10]]},"reference":[{"issue":"1","key":"10475_CR1","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10(1):196\u2013210","journal-title":"J Soc Ind Appl Math"},{"issue":"4","key":"10475_CR2","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler EL, Wood DE (1966) Branch-and-bound methods: a survey. Oper Res 14(4):699\u2013719","journal-title":"Oper Res"},{"issue":"1","key":"10475_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg M, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev 33(1):60\u2013100","journal-title":"SIAM Rev"},{"key":"10475_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01609016","volume":"15","author":"P Miliotis","year":"1978","unstructured":"Miliotis P (1978) Using cutting planes to solve the symmetric travelling salesman problem. Math Program 15:177\u2013188","journal-title":"Math Program"},{"issue":"4","key":"10475_CR5","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2(4):393\u2013410","journal-title":"J Oper Res Soc Am"},{"issue":"10","key":"10475_CR6","doi-asserted-by":"publisher","first-page":"7627","DOI":"10.1007\/s00521-021-06883-x","volume":"34","author":"\u0130 \u0130lhan","year":"2022","unstructured":"\u0130lhan \u0130, G\u00f6kmen G (2022) A list-based simulated annealing algorithm with crossover operator for the traveling salesman problem. Neural Comput Appl 34(10):7627\u20137652. https:\/\/doi.org\/10.1007\/s00521-021-06883-x","journal-title":"Neural Comput Appl"},{"issue":"3","key":"10475_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W Cook","year":"2003","unstructured":"Cook W, Seymour P (2003) Tour merging via branch-decomposition. INFORMS J Comput 15(3):233\u2013248","journal-title":"INFORMS J Comput"},{"key":"10475_CR8","unstructured":"Helsgaun K (2006) An effective implementation of K-opt moves for the Lin-Kernighan TSP heuristic. Doctoral dissertation, Roskilde University, Department of Computer Science"},{"issue":"2\u20133","key":"10475_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun K (2009) General k-opt submoves for the Lin-Kernighan TSP heuristic. Math Progr Comput 1(2\u20133):119\u2013163. https:\/\/doi.org\/10.1007\/s12532-009-0004-6","journal-title":"Math Progr Comput"},{"key":"10475_CR10","doi-asserted-by":"crossref","unstructured":"Dong C, J\u00e4ger G, Richter D, Molitor P (2009) Effective tour searching for TSP by contraction of pseudo backbone edges. In: Algorithmic aspects in information and management: 5th international conference","DOI":"10.1007\/978-3-642-02158-9_16"},{"key":"10475_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109277","volume":"126","author":"A Tabak","year":"2022","unstructured":"Tabak A, \u0130lhan \u0130 (2022) An effective method based on simulated annealing for automatic generation control of power systems. Appl Soft Comput 126:109277. https:\/\/doi.org\/10.1016\/j.asoc.2022.109277","journal-title":"Appl Soft Comput"},{"key":"10475_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100911","volume":"64","author":"\u0130 \u0130lhan","year":"2021","unstructured":"\u0130lhan \u0130 (2021) An improved simulated annealing algorithm with crossover operator for capacitated vehicle routing problem. Swarm Evol Comput 64:100911. https:\/\/doi.org\/10.1016\/j.swevo.2021.100911","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"10475_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.47112\/neufmbd.2021.7","volume":"3","author":"M Karakoyun","year":"2021","unstructured":"Karakoyun M, \u00d6zk\u0131\u015f A (2021) Development of binary moth-flame optimization algorithms using transfer functions and their performance comparison. Necmettin Erbakan Univ J Sci Eng 3(2):1\u201310. https:\/\/doi.org\/10.47112\/neufmbd.2021.7","journal-title":"Necmettin Erbakan Univ J Sci Eng"},{"issue":"3","key":"10475_CR14","first-page":"1","volume":"42","author":"MAH Akhand","year":"2015","unstructured":"Akhand MAH, Akter S, Rashid MA, Yaakob SB (2015) Velocity tentative PSO: an optimal velocity implementation-based particle swarm optimization to solve traveling salesman problem. IAENG Int J Comput Sci 42(3):1\u201312","journal-title":"IAENG Int J Comput Sci"},{"key":"10475_CR15","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"I Khan","year":"2019","unstructured":"Khan I, Maiti MK (2019) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput 44:428\u2013438. https:\/\/doi.org\/10.1016\/j.swevo.2018.05.006","journal-title":"Swarm Evol Comput"},{"key":"10475_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105887","volume":"86","author":"MAH Akhand","year":"2020","unstructured":"Akhand MAH, Ayon SI, Shahriyar SA, Siddique N, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput J 86:105887. https:\/\/doi.org\/10.1016\/j.asoc.2019.105887","journal-title":"Appl Soft Comput J"},{"key":"10475_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang XS, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u201371. https:\/\/doi.org\/10.1016\/j.engappai.2015.10.006","journal-title":"Eng Appl Artif Intell"},{"key":"10475_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108469","volume":"118","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Han Y (2022) Discrete sparrow search algorithm for symmetric traveling salesman problem. Appl Soft Comput 118:108469. https:\/\/doi.org\/10.1016\/j.asoc.2022.108469","journal-title":"Appl Soft Comput"},{"key":"10475_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109339","volume":"127","author":"P Zhang","year":"2022","unstructured":"Zhang P, Wang J, Tian Z, Sun S, Li J, Yang J (2022) A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem. Appl Soft Comput 127:109339. https:\/\/doi.org\/10.1016\/j.asoc.2022.109339","journal-title":"Appl Soft Comput"},{"key":"10475_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114639","volume":"172","author":"Y Saji","year":"2021","unstructured":"Saji Y, Barkatou M (2021) A discrete bat algorithm based on L\u00e9vy flights for Euclidean traveling salesman problem. Expert Syst Appl 172:114639. https:\/\/doi.org\/10.1016\/j.eswa.2021.114639","journal-title":"Expert Syst Appl"},{"key":"10475_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107298","volume":"105","author":"K Panwar","year":"2021","unstructured":"Panwar K, Deep K (2021) Discrete grey Wolf optimizer for symmetric travelling salesman problem. Appl Soft Comput 105:107298. https:\/\/doi.org\/10.1016\/j.asoc.2021.107298","journal-title":"Appl Soft Comput"},{"key":"10475_CR22","doi-asserted-by":"publisher","unstructured":"Ford JKB (2018) \u201cKiller Whale\u201d. In: Encyclopedia of marine mammals, pp 531\u2013537. https:\/\/doi.org\/10.1016\/b978-0-12-804327-1.00010-8","DOI":"10.1016\/b978-0-12-804327-1.00010-8"},{"key":"10475_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116026","volume":"188","author":"Y Jiang","year":"2022","unstructured":"Jiang Y, Wu Q, Zhu S, Zhang L (2022) Orca predation algorithm: a novel bio-inspired algorithm for global optimization problems. Expert Syst Appl 188:116026. https:\/\/doi.org\/10.1016\/j.eswa.2021.116026","journal-title":"Expert Syst Appl"},{"key":"10475_CR24","unstructured":"\u201cRichard Hamming\u2014Vikipedi.\u201d https:\/\/tr.wikipedia.org\/wiki\/Richard_Hamming. Accessed Feb 17, 2023"},{"issue":"6","key":"10475_CR25","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791\u2013812","journal-title":"Oper Res"},{"issue":"10","key":"10475_CR26","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44(10):2245\u20132269","journal-title":"Bell Syst Tech J"},{"key":"10475_CR27","first-page":"162","volume":"85","author":"L Davis","year":"1985","unstructured":"Davis L (1985) Applying adaptive algorithms to epistatic domains. IJCAI 85:162\u2013164","journal-title":"IJCAI"},{"key":"10475_CR28","unstructured":"\u201cSymmetric TSPs.\u201d http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/STSP.html. Accessed Feb. 20, 2023"},{"key":"10475_CR29","unstructured":"Taguchi G (1986) Introduction to quality engineering. In: Designing quality into products and processes"},{"issue":"1\u20132","key":"10475_CR30","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.mcm.2011.06.056","volume":"57","author":"A Mozdgir","year":"2013","unstructured":"Mozdgir A, Mahdavi I, Badeleh IS, Solimanpur M (2013) Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing. Math Comput Model 57(1\u20132):137\u2013151. https:\/\/doi.org\/10.1016\/j.mcm.2011.06.056","journal-title":"Math Comput Model"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10475-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-024-10475-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10475-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T20:07:44Z","timestamp":1732651664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-024-10475-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,10]]},"references-count":30,"journal-issue":{"issue":"36","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10475"],"URL":"https:\/\/doi.org\/10.1007\/s00521-024-10475-w","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2024,10,10]]},"assertion":[{"value":"5 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2024","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 that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The datasets used in the current study can be accessed from the following link:","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data availability statement"}}]}}