{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T12:54:39Z","timestamp":1787921679166,"version":"build-2784847793"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T00:00:00Z","timestamp":1435276800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00521-015-1978-9","type":"journal-article","created":{"date-parts":[[2015,6,25]],"date-time":"2015-06-25T03:36:40Z","timestamp":1435203400000},"page":"1853-1866","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":82,"title":["A novel discrete bat algorithm for solving the travelling salesman problem"],"prefix":"10.1007","volume":"27","author":[{"given":"Yassine","family":"Saji","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed Essaid","family":"Riffi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,6,26]]},"reference":[{"key":"1978_CR1","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Ann Arbor"},{"key":"1978_CR2","volume-title":"Numerical optimization of computer models","author":"H-P Schwefel","year":"1981","unstructured":"Schwefel H-P (1981) Numerical optimization of computer models. Wiley, London"},{"issue":"5\u20136","key":"1978_CR3","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S Kirkpatrick","year":"1984","unstructured":"Kirkpatrick S (1984) Optimization by simulated annealing: quantitative studies. J Stat Phys 34(5\u20136):975\u2013986","journal-title":"J Stat Phys"},{"key":"1978_CR4","first-page":"760","volume-title":"Encyclopedia of machine learning","author":"J Kennedy","year":"2010","unstructured":"Kennedy J (2010) Particle swarm optimization. Encyclopedia of machine learning. Springer, Berlin, pp 760\u2013766"},{"key":"1978_CR5","unstructured":"Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Proceedings of the first European conference on artificial life. Paris, France, pp 134\u2013142"},{"key":"1978_CR6","volume-title":"Integer and combinatorial optimization","author":"LA Wolsey","year":"2014","unstructured":"Wolsey LA, Nemhauser GL (2014) Integer and combinatorial optimization. Wiley, London"},{"key":"1978_CR7","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Courier Dover Publications, Mineola"},{"issue":"1","key":"1978_CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02192047","volume":"87","author":"W Wong","year":"1995","unstructured":"Wong W (1995) Matrix representation and gradient flows for NP-hard problems. J Optim Theory Appl 87(1):197\u2013220","journal-title":"J Optim Theory Appl"},{"key":"1978_CR9","first-page":"36","volume-title":"Encyclopedia of machine learning","author":"M Dorigo","year":"2010","unstructured":"Dorigo M, Birattari M (2010) Ant colony optimization. Encyclopedia of machine learning. Springer, Berlin, pp 36\u201339"},{"issue":"1","key":"1978_CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1(1):33\u201357","journal-title":"Swarm Intell"},{"issue":"2","key":"1978_CR11","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.cnsns.2012.07.017","volume":"18","author":"AH Gandomi","year":"2013","unstructured":"Gandomi AH, Yun GJ, Yang X-S, Talatahari S (2013) Chaos-enhanced accelerated particle swarm optimization. Commun Nonlinear Sci Numer Simul 18(2):327\u2013340","journal-title":"Commun Nonlinear Sci Numer Simul"},{"issue":"03","key":"1978_CR12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1142\/S0218213003001289","volume":"12","author":"P Lu\u010di\u0107","year":"2003","unstructured":"Lu\u010di\u0107 P, Teodorovi\u0107 D (2003) Computing with bees: attacking complex transportation engineering problems. Int J Artif Intell Tools 12(03):375\u2013394","journal-title":"Int J Artif Intell Tools"},{"key":"1978_CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-04944-6_14","volume-title":"Stochastic algorithms: foundations and applications","author":"X-S Yang","year":"2009","unstructured":"Yang X-S (2009) Firefly algorithms for multimodal optimization. Stochastic algorithms: foundations and applications. Springer, Berlin, pp 169\u2013178"},{"issue":"4","key":"1978_CR14","first-page":"330","volume":"1","author":"X-S Yang","year":"2010","unstructured":"Yang X-S, Deb S (2010) Engineering optimisation by cuckoo search. Int J Math Model Numer Optim 1(4):330\u2013343","journal-title":"Int J Math Model Numer Optim"},{"key":"1978_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Nature inspired cooperative strategies for optimization (NICSO 2010)","author":"X-S Yang","year":"2010","unstructured":"Yang X-S (2010) A new metaheuristic bat-inspired algorithm. Nature inspired cooperative strategies for optimization (NICSO 2010). Springer, Berlin, pp 65\u201374"},{"issue":"5","key":"1978_CR16","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1108\/02644401211235834","volume":"29","author":"X-S Yang","year":"2012","unstructured":"Yang X-S, Gandomi AH (2012) Bat algorithm: a novel approach for global engineering optimization. Eng Comput 29(5):464\u2013483","journal-title":"Eng Comput"},{"issue":"5","key":"1978_CR17","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J ACM (JACM) 45(5):753\u2013782","journal-title":"J ACM (JACM)"},{"issue":"3","key":"1978_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0167-6377(89)90037-0","volume":"8","author":"RG Bland","year":"1989","unstructured":"Bland RG, Shallcross DF (1989) Large travelling salesman problems arising from experiments in X-ray crystallography: a preliminary report on computation. Oper Res Lett 8(3):125\u2013128","journal-title":"Oper Res Lett"},{"key":"1978_CR19","unstructured":"Lenstra JK, Kan AR (1975) Some simple applications of the travelling salesman problem. Oper Res Q 717\u2013733"},{"issue":"1","key":"1978_CR20","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01415960","volume":"35","author":"M Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1991) Optimal control of plotting and drilling machines: a case study. Math Methods Oper Res 35(1):61\u201384","journal-title":"Math Methods Oper Res"},{"issue":"3","key":"1978_CR21","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1287\/opre.31.3.507","volume":"31","author":"HD Ratliff","year":"1983","unstructured":"Ratliff HD, Rosenthal AS (1983) Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper Res 31(3):507\u2013521","journal-title":"Oper Res"},{"key":"1978_CR22","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/978-1-4613-1361-8_34","volume-title":"Meta-heuristics","author":"M Zachariasen","year":"1996","unstructured":"Zachariasen M, Dam M (1996) Tabu search on the geometric traveling salesman problem. Meta-heuristics. Springer, Berlin, pp 571\u2013587"},{"issue":"2","key":"1978_CR23","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.physa.2006.04.052","volume":"371","author":"Y Chen","year":"2006","unstructured":"Chen Y, Zhang P (2006) Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution. Phys A 371(2):627\u2013632","journal-title":"Phys A"},{"issue":"3","key":"1978_CR24","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02125403","volume":"63","author":"J-Y Potvin","year":"1996","unstructured":"Potvin J-Y (1996) Genetic algorithms for the traveling salesman problem. Ann Oper Res 63(3):337\u2013370","journal-title":"Ann Oper Res"},{"issue":"3","key":"1978_CR25","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0020-0255(99)00026-2","volume":"117","author":"L Qu","year":"1999","unstructured":"Qu L, Sun R (1999) A synergetic approach to genetic algorithms for solving traveling salesman problem. Inf Sci 117(3):267\u2013283","journal-title":"Inf Sci"},{"issue":"3","key":"1978_CR26","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10589-005-4798-5","volume":"32","author":"Y Marinakis","year":"2005","unstructured":"Marinakis Y, Migdalas A, Pardalos PM (2005) Expanding neighborhood GRASP for the traveling salesman problem. Comput Optim Appl 32(3):231\u2013257","journal-title":"Comput Optim Appl"},{"issue":"1","key":"1978_CR27","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. Evol Comput IEEE Trans 1(1):53\u201366","journal-title":"Evol Comput IEEE Trans"},{"issue":"2","key":"1978_CR28","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colonies for the travelling salesman problem. BioSystems 43(2):73\u201381","journal-title":"BioSystems"},{"key":"1978_CR29","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/11903697_62","volume-title":"Simulated evolution and learning","author":"A Liu","year":"2006","unstructured":"Liu A, Deng G, Shan S (2006) Mean-contribution ant system: an improved version of ant colony optimization for traveling salesman problem. Simulated evolution and learning. Springer, Berlin, pp 489\u2013496"},{"key":"1978_CR30","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/11839088_20","volume-title":"Ant colony optimization and swarm intelligence","author":"M Manfrin","year":"2006","unstructured":"Manfrin M, Birattari M, St\u00fctzle T, Dorigo M (2006) Parallel ant colony optimization for the traveling salesman problem. Ant colony optimization and swarm intelligence. Springer, Berlin, pp 224\u2013234"},{"key":"1978_CR31","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-39930-8_8","volume-title":"New optimization techniques in engineering","author":"M Clerc","year":"2004","unstructured":"Clerc M (2004) Discrete particle swarm optimization, illustrated by the traveling salesman problem. New optimization techniques in engineering. Springer, Berlin, pp 219\u2013239"},{"key":"1978_CR32","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/11903697_24","volume-title":"Simulated evolution and learning","author":"X Li","year":"2006","unstructured":"Li X, Tian P, Hua J, Zhong N (2006) A hybrid discrete particle swarm optimization for the traveling salesman problem. Simulated evolution and learning. Springer, Berlin, pp 181\u2013188"},{"issue":"5","key":"1978_CR33","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi XH, Liang YC, Lee HP, Lu C, Wang Q (2007) Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf Process Lett 103(5):169\u2013176","journal-title":"Inf Process Lett"},{"issue":"7\u20138","key":"1978_CR34","doi-asserted-by":"crossref","first-page":"1659","DOI":"10.1007\/s00521-013-1402-2","volume":"24","author":"A Ouaarab","year":"2014","unstructured":"Ouaarab A, Ahiod B, Yang X-S (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 24(7\u20138):1659\u20131669","journal-title":"Neural Comput Appl"},{"issue":"4","key":"1978_CR35","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"issue":"3","key":"1978_CR36","doi-asserted-by":"crossref","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 Global Optim 39(3):459\u2013471","journal-title":"J Global Optim"},{"key":"1978_CR37","doi-asserted-by":"crossref","unstructured":"Kenndy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks. pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"3","key":"1978_CR38","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCS.2002.1004010","volume":"22","author":"KM Passino","year":"2002","unstructured":"Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. Control Syst IEEE 22(3):52\u201367. doi: 10.1109\/MCS.2002.1004010","journal-title":"Control Syst IEEE"},{"issue":"2","key":"1978_CR39","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s11721-008-0021-5","volume":"3","author":"K Krishnanand","year":"2009","unstructured":"Krishnanand K, Ghose D (2009) Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions. Swarm Intell 3(2):87\u2013124","journal-title":"Swarm Intell"},{"key":"1978_CR40","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1007\/978-3-540-36668-3_94","volume-title":"PRICAI 2006: trends in artificial intelligence","author":"S-C Chu","year":"2006","unstructured":"Chu S-C, Tsai P-W, Pan J-S (2006) Cat swarm optimization. PRICAI 2006: trends in artificial intelligence. Springer, Berlin, pp 854\u2013858"},{"issue":"12","key":"1978_CR41","doi-asserted-by":"crossref","first-page":"4831","DOI":"10.1016\/j.cnsns.2012.05.010","volume":"17","author":"AH Gandomi","year":"2012","unstructured":"Gandomi AH, Alavi AH (2012) Krill Herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831\u20134845","journal-title":"Commun Nonlinear Sci Numer Simul"},{"key":"1978_CR42","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-3-642-38577-3_23","volume-title":"Recent trends in applied artificial intelligence","author":"Y Gheraibia","year":"2013","unstructured":"Gheraibia Y, Moussaoui A (2013) Penguins search optimization algorithm (PeSOA). Recent trends in applied artificial intelligence. Springer, Berlin, pp 222\u2013231"},{"key":"1978_CR43","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-319-11857-4_10","volume-title":"Advances in swarm intelligence","author":"X Meng","year":"2014","unstructured":"Meng X, Liu Y, Gao X, Zhang H (2014) A new bio-inspired algorithm: chicken swarm optimization. Advances in swarm intelligence. Springer, Berlin, pp 86\u201394"},{"issue":"1","key":"1978_CR44","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s12293-013-0128-0","volume":"6","author":"JC Bansal","year":"2014","unstructured":"Bansal JC, Sharma H, Jadon SS, Clerc M (2014) Spider monkey optimization algorithm for numerical optimization. Memetic Comput 6(1):31\u201347","journal-title":"Memetic Comput"},{"issue":"6","key":"1978_CR45","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1007\/s00521-012-1028-9","volume":"22","author":"AH Gandomi","year":"2013","unstructured":"Gandomi AH, Yang X-S, Alavi AH, Talatahari S (2013) Bat algorithm for constrained optimization tasks. Neural Comput Appl 22(6):1239\u20131255","journal-title":"Neural Comput Appl"},{"key":"1978_CR46","series-title":"Advances in intelligent and soft computing","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-23163-6_9","volume-title":"Third international conference on software, services and semantic technologies S3T 2011","author":"K Khan","year":"2011","unstructured":"Khan K, Nikov A, Sahai A (2011) A fuzzy bat clustering method for ergonomic screening of office workplaces. In: Dicheva D, Markov Z, Stefanova E (eds) Third international conference on software, services and semantic technologies S3T 2011, vol 101., Advances in intelligent and soft computingSpringer, Berlin Heidelberg, pp 59\u201366. doi: 10.1007\/978-3-642-23163-6_9"},{"key":"1978_CR47","series-title":"Studies in computational intelligence","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-642-29694-9_26","volume-title":"Artificial intelligence, evolutionary computing and metaheuristics","author":"AL Tamiru","year":"2013","unstructured":"Tamiru AL, Hashim FM (2013) Application of bat algorithm and fuzzy systems to model energy changes in a gas turbine. In: Yang X-S (ed) Artificial intelligence, evolutionary computing and metaheuristics, vol 427., Studies in computational intelligenceSpringer, Berlin Heidelberg, pp 685\u2013719. doi: 10.1007\/978-3-642-29694-9_26"},{"key":"1978_CR48","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.asoc.2014.11.029","volume":"28","author":"S Y\u0131lmaz","year":"2015","unstructured":"Y\u0131lmaz S, K\u00fc\u00e7\u00fcksille EU (2015) A new modification approach on bat algorithm for solving optimization problems. Appl Soft Comput 28:259\u2013275","journal-title":"Appl Soft Comput"},{"key":"1978_CR49","series-title":"Advances in intelligent systems and computing","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-07773-4_5","volume-title":"Intelligent data analysis and its applications","author":"T-T Nguyen","year":"2014","unstructured":"Nguyen T-T, Pan J-S, Dao T-K, Kuo M-Y, Horng M-F (2014) Hybrid bat algorithm with artificial bee colony. In: Pan J-S, Snasel V, Corchado ES, Abraham A, Wang S-L (eds) Intelligent data analysis and its applications, vol II-298., Advances in intelligent systems and computingSpringer, Berlin, pp 45\u201355. doi: 10.1007\/978-3-319-07773-4_5"},{"key":"1978_CR50","series-title":"Advances in intelligent systems and computing","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-12286-1_5","volume-title":"Genetic and evolutionary computing","author":"T-S Pan","year":"2015","unstructured":"Pan T-S, Dao T-K, Nguyen T-T, Chu S-C (2015) Hybrid particle swarm optimization with bat algorithm. In: Sun H, Yang C-Y, Lin C-W, Pan J-S, Snasel V, Abraham A (eds) Genetic and evolutionary computing, vol 329., Advances in intelligent systems and computingSpringer, Berlin, pp 37\u201347. doi: 10.1007\/978-3-319-12286-1_5"},{"issue":"3","key":"1978_CR51","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1504\/IJBIC.2014.062637","volume":"6","author":"X Cai","year":"2014","unstructured":"Cai X, Wang L, Kang Q, Wu Q (2014) Bat algorithm with Gaussian walk. Int J Bio-Inspired Comput 6(3):166\u2013174","journal-title":"Int J Bio-Inspired Comput"},{"issue":"2","key":"1978_CR52","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.jocs.2013.10.002","volume":"5","author":"AH Gandomi","year":"2014","unstructured":"Gandomi AH, Yang X-S (2014) Chaotic bat algorithm. J Comput Sci 5(2):224\u2013232","journal-title":"J Comput Sci"},{"issue":"3\u20134","key":"1978_CR53","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s00521-013-1525-5","volume":"25","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili S, Yang X-S (2014) Binary bat algorithm. Neural Comput Appl 25(3\u20134):663\u2013681. doi: 10.1007\/s00521-013-1525-5","journal-title":"Neural Comput Appl"},{"issue":"3","key":"1978_CR54","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1504\/IJBIC.2013.055093","volume":"5","author":"X-S Yang","year":"2013","unstructured":"Yang X-S, He X (2013) Bat algorithm: literature review and applications. Int J Bio-Inspired Comput 5(3):141\u2013149","journal-title":"Int J Bio-Inspired Comput"},{"key":"1978_CR55","doi-asserted-by":"crossref","unstructured":"Nakamura RY, Pereira LA, Costa K, Rodrigues D, Papa JP, Yang X-S (2012) BBA: A binary bat algorithm for feature selection. In: Graphics, patterns and images (SIBGRAPI), 2012 25th SIBGRAPI Conference on IEEE, pp 291\u2013297","DOI":"10.1109\/SIBGRAPI.2012.47"},{"key":"1978_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-39482-9_21","volume-title":"Intelligent computing theories and technology","author":"J Xie","year":"2013","unstructured":"Xie J, Zhou Y, Tang Z (2013) Differential L\u00e9vy-Flights bat algorithm for minimization makespan in permutation flow shops. In: Huang D-S, Jo K-H, Zhou Y-Q, Han K (eds) Intelligent computing theories and technology, vol 7996., Lecture Notes in Computer ScienceSpringer, Berlin Heidelberg, pp 179\u2013188. doi: 10.1007\/978-3-642-39482-9_21"},{"issue":"2","key":"1978_CR57","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1504\/IJBIC.2014.060598","volume":"6","author":"S Sabba","year":"2014","unstructured":"Sabba S, Chikhi S (2014) A discrete binary version of bat algorithm for multidimensional knapsack problem. Int J Bio-Inspired Comput 6(2):140\u2013152","journal-title":"Int J Bio-Inspired Comput"},{"key":"1978_CR58","series-title":"Studies in computational intelligence","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-13826-8_6","volume-title":"Recent advances in swarm intelligence and evolutionary computation","author":"S B\u00fcy\u00fcksaat\u00e7\u0131","year":"2015","unstructured":"B\u00fcy\u00fcksaat\u00e7\u0131 S (2015) Bat algorithm application for the single row facility layout problem. In: Yang X-S (ed) Recent advances in swarm intelligence and evolutionary computation, vol 585., Studies in computational intelligenceSpringer, Berlin, pp 101\u2013120. doi: 10.1007\/978-3-319-13826-8_6"},{"key":"1978_CR59","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1016\/j.neucom.2014.07.034","volume":"149","author":"I Fister","year":"2015","unstructured":"Fister I, Rauter S, Yang X-S, Ljubi\u010d K (2015) Planning the sports training sessions with the bat algorithm. Neurocomputing 149:993\u20131002","journal-title":"Neurocomputing"},{"issue":"5","key":"1978_CR60","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1504\/IJBIC.2011.042259","volume":"3","author":"X-S Yang","year":"2011","unstructured":"Yang X-S (2011) Bat algorithm for multi-objective optimisation. Int J Bio-Inspired Comput 3(5):267\u2013274","journal-title":"Int J Bio-Inspired Comput"},{"key":"1978_CR61","series-title":"Springer Briefs in Optimization","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-1-4614-9053-1_3","volume-title":"Optimization approaches for solving string selection problems","author":"E Pappalardo","year":"2013","unstructured":"Pappalardo E, Pardalos P, Stracquadanio G (2013) Mathematical optimization. Optimization approaches for solving string selection problems., Springer Briefs in OptimizationSpringer, New York, pp 13\u201325"},{"key":"1978_CR62","volume-title":"Handbook of combinatorial optimization: supplement","author":"D-Z Du","year":"1999","unstructured":"Du D-Z, Pardalos PM (1999) Handbook of combinatorial optimization: supplement, vol 1. Springer, Berlin"},{"key":"1978_CR63","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation. 1997 IEEE International Conference on, IEEE, pp 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"issue":"2","key":"1978_CR64","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif Intell Rev 13(2):129\u2013170. doi: 10.1023\/A:1006529012972","journal-title":"Artif Intell Rev"},{"key":"1978_CR65","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/978-3-540-74282-1_24","volume-title":"Advanced intelligent computing theories and applications. With aspects of contemporary intelligent computing techniques","author":"L Li","year":"2007","unstructured":"Li L, Zhang Y (2007) An improved genetic algorithm for the traveling salesman problem. Advanced intelligent computing theories and applications. With aspects of contemporary intelligent computing techniques. Springer, Berlin, pp 208\u2013216"},{"issue":"12","key":"1978_CR66","doi-asserted-by":"crossref","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","volume":"38","author":"S-M Chen","year":"2011","unstructured":"Chen S-M, Chien C-Y (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl 38(12):14439\u201314450","journal-title":"Expert Syst Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-1978-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-015-1978-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-1978-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T14:03:55Z","timestamp":1566914635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-015-1978-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,26]]},"references-count":66,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["1978"],"URL":"https:\/\/doi.org\/10.1007\/s00521-015-1978-9","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,26]]}}}