An Improved Unordered Pair Bat Algorithm for Solving the Symmetrical Traveling Salesman Problem

Nan, Zhang; Zhimin, Lv; Shen, Qiao; Ting, Li

doi:10.2478/fcds-2022-0004

References

[1] Abdel-Raouf O, Abdel-Baset M, El-Henawy I., An improved chaotic bat algorithm for solving integer programming problems, International Journal of Modern Education and Computer Science, 6, 8, 2014, 18.10.5815/ijmecs.2014.08.03
Search in Google Scholar Back to article
[2] Afrabandpey H, Ghaffari M, Mirzaei A, et al., A novel bat algorithm based on chaos for optimization tasks, 2014 Iranian Conference on Intelligent Systems (ICIS), IEEE, 2014, 1-6.10.1109/IranianCIS.2014.6802527
Search in Google Scholar Back to article
[3] Al-Sorori, Wedad, A., Mohsen, and Walid Aljoby ßer., An Improved Hybrid Bat Algorithm for Traveling Salesman Problem, International Conference on Bio-Inspired Computing: Theories and Applications, Springer, Singapore, 2016: 504-511.10.1007/978-981-10-3611-8_47
Search in Google Scholar Back to article
[4] Chen S M, Chien C Y., Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques, Expert Systems with Applications, 38, 12, 2011, 14439-14450.10.1016/j.eswa.2011.04.163
Search in Google Scholar Back to article
[5] Cheng H, Yang S, Cao J, Dynamic genetic algorithms for the dynamic load balanced clustering problem in mobile ad hoc networks, Pergamon Press, Inc, 2013.10.1007/978-3-642-38416-5_14
Search in Google Scholar Back to article
[6] Crişan G C, Pintea C M, Palade V., Emergency management using geographic information systems: application to the first romanian traveling salesman problem instance, Knowledge and Information Systems, 50, 1, 2017, 265-285.10.1007/s10115-016-0938-8
Search in Google Scholar Back to article
[7] Dorigo M, Di Caro G, Ant colony optimization: a new meta-heuristic, Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), IEEE, 2,1999, 1470-1477.
Search in Google Scholar Back to article
[8] Eberhart R, Kennedy J, Particle swarm optimization, Proceedings of the IEEE international conference on neural networks, 4, 1995, 1942-1948.
Search in Google Scholar Back to article
[9] Fischer A, Fischer F, Jäger G, et al., Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics, Discrete Applied Mathematics, 166, 2014, 97-114.10.1016/j.dam.2013.09.011
Search in Google Scholar Back to article
[10] Fister Jr I, Fister D, Yang X S., A hybrid bat algorithm, arXiv preprint arXiv, 2013,1303.6310.
Search in Google Scholar Back to article
[11] Gandomi A H, Yang X S, Alavi A H, Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems, Engineering with computers, 29(1), 2013, 17-35.10.1007/s00366-011-0241-y
Search in Google Scholar Back to article
[12] Gandomi A H, Yang X S., Chaotic bat algorithm, Journal of Computational Science, 5(2), 2014, 224-232.10.1016/j.jocs.2013.10.002
Search in Google Scholar Back to article
[13] Glover F, Tabu search2part I, ORSA Journal on computing, 1(3), 1989, 190-206.10.1287/ijoc.1.3.190
Search in Google Scholar Back to article
[14] He X, Ding W J, Yang X S., Bat algorithm based on simulated annealing and Gaussian perturbations, Neural Computing and Applications, 25, 2, 2014, 459-468.10.1007/s00521-013-1518-4
Search in Google Scholar Back to article
[15] Hoffman K L, Padberg M, Rinaldi G., Traveling salesman problem, Encyclopedia of operations research and management science, Springer US, 2013, 1573-1578.10.1007/978-1-4419-1153-7_1068
Search in Google Scholar Back to article
[16] Lin Y, Bian Z, Liu X., Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing–tabu search algorithm to solve the symmetrical traveling salesman problem, Applied Soft Computing, 49, 2016, 937-952.10.1016/j.asoc.2016.08.036
Search in Google Scholar Back to article
[17] Mahi M, Baykan Ö K, Kodaz H., A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem, Applied Soft Computing, 30, 2015, 484-490.10.1016/j.asoc.2015.01.068
Search in Google Scholar Back to article
[18] Marichlvam M K, Prabaharam T., A bat algorithm for realistic hybrid flowshop scheduling problems to minimize makespan and mean flow time, ICTACT Journal on Soft Computing, 3, 1, 2012, 428-433.10.21917/ijsc.2012.0066
Search in Google Scholar Back to article
[19] Marichelvam M K, Prabaharan T, Yang X S, et al., Solving hybrid flow shop scheduling problems using bat algorithm, International Journal of Logistics Economics and Globalisation, 5, 1, 2013, 15-29.10.1504/IJLEG.2013.054428
Search in Google Scholar Back to article
[20] Masutti T A S, de Castro L N., A self-organizing neural network using ideas from the immune system to solve the traveling salesman problems, Information Sciences, 179, 10, 2009, 1454-1468.10.1016/j.ins.2008.12.016
Search in Google Scholar Back to article
[21] Mirjalili S, Mirjalili S M, Yang X S., Binary bat algorithm, Neural Computing and Applications, 25(3-4), 2014, 663-681.10.1007/s00521-013-1525-5
Search in Google Scholar Back to article
[22] Osaba E, Yang X S, Diaz F, et al., An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems, Engineering Applications of Artificial Intelligence, 48, 2006, 59-71.10.1016/j.engappai.2015.10.006
Search in Google Scholar Back to article
[23] Ouaarab A, Ahiod B, Yang X S., Discrete cuckoo search algorithm for the travelling salesman problem, Neural Computing and Applications, 24, 7-8, 2014, 1659-1669.10.1007/s00521-013-1402-2
Search in Google Scholar Back to article
[24] Pedro O, Saldanha R, Camargo, R., A tabu search approach for the prize collecting traveling salesman problem, Electronic Notes in Discrete Mathematics, 41, 2013, 261-268.10.1016/j.endm.2013.05.101
Search in Google Scholar Back to article
[25] Plateau G, Nagih., A 0–1 Knapsack Problems. Paradigms of Combinatorial Optimization, 2nd Edition, 2010, 215-242.10.1002/9781119005353.ch8
Search in Google Scholar Back to article
[26] Quiroz-Castellanos M, Cruz-Reyes L, Torres-Jimenez J et al., A grouping genetic algorithm with controlled gene transmission for the bin packing problem, Computers & Operations Research, 55, 2015, 52-64.10.1016/j.cor.2014.10.010
Search in Google Scholar Back to article
[27] Saji Y, Riffi M E., A novel discrete bat algorithm for solving the travelling salesman problem, Neural Computing and Applications, 2015, 1-14.10.1109/ICoCS.2015.7483231
Search in Google Scholar Back to article
[28] Toth, Paolo, and Daniele Vigo, eds., Vehicle routing: problems, methods, and applications, Society for Industrial and Applied Mathematics, 2014.10.1137/1.9781611973594
Search in Google Scholar Back to article
[29] Van Laarhoven P J M, Aarts E H L, Simulated annealing, Simulated annealing: Theory and applications, Springer, Dordrect, 1987, 7-15.10.1007/978-94-015-7744-1_2
Search in Google Scholar Back to article
[30] Wang J, Ersoy O K, He M, et al., Multi-offspring genetic algorithm and its application to the traveling salesman problem, Applied Soft Computing, 43, 2016, 415-423.10.1016/j.asoc.2016.02.021
Search in Google Scholar Back to article
[31] Whitley D, A genetic algorithm tutorial, Statistics and computing, 4(2), 1994, 65-85.10.1007/BF00175354
Search in Google Scholar Back to article
[32] Yang X S., A new metaheuristic bat-inspired algorithm, Nature inspired cooperative strategies for optimization (NICSO 2010), Springer Berlin Heidelberg, 2010, 65-74.10.1007/978-3-642-12538-6_6
Search in Google Scholar Back to article
[33] Zhou Y, Xie J, Li L, et al., Cloud model bat algorithm, The Scientific World Journal, 2014.10.1155/2014/237102405536424967425
Search in Google Scholar Back to article