AIS: Ars Iuris Salmanticensis

Aarts, E. H. & Stehouwer, H. P., 1993. Neural networks and the travelling salesman problem. s.l., Springer London, pp. 950-955.

Abdoun, O. & Abouchabaka, J., 2012. A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem. arXiv preprint arXiv:1203.3097.

Alkafaween, E. O., 2015. Novel Methods for Enhancing the Performance of Genetic Algorithms, Mutah: Mutah University.

Ayala, H. V. H. & dos Santos Coelho, L., 2012. Tuning of PID controller based on a multiobjective genetic algorithm applied to a robotic manipulator. Expert Systems with Applications, 39(10), pp. 8968-8974.

Banzhaf, W., 1990. The “molecular” traveling salesman. Biological Cybernetics, 64(1), pp. 7-14.

Benkhellat, Z. & Belmehdi, A., 2012. Genetic algorithms in speech recognition systems. s.l., s.n., pp. 853-858.

Boyabatli, O. & Sabuncuoglu, I., 2004. Parameter selection in genetic algorithms. Journal of Systemics, Cybernetics and Informatics, 4(2), p. 78.

Deep, K. & Mebrathu, . H., 2011. Combined mutation operators of genetic algorithm for the travelling salesman problem. International Journal of Combinatorial Optimization Problems and Informatics, 2(3), p. 2.

Deng , Y., Liu , Y. & Zhou, D., 2015. An improved genetic algorithm with initial population strategy for symmetric TSP. Mathematical Problems in Engineering, Volume 2015.

Dong, M. & Wu, Y., 2009. Dynamic Crossover and Mutation Genetic Algorithm Based on Expansion Sampling. Berlin, Heidelberg, Springer, pp. 141--149.

Dorigo, M. & Gambardella, L. M., 1997. Ant colony system: a cooperative learning approach to the traveling salesman problem. Evolutionary Computation, IEEE Transactions on, 1(1), pp. 53-66.

Durbin, R., Szeliski, R. & Yuille, A., 1989. An analysis of the elastic net approach to the traveling salesman problem. Neural Computation, 1(3), pp. 348-358.

Eiben, A. E., Michalewicz, Z., Schoenauer, M. & Smith, J. E., 2007. Parameter control in evolutionary algorithms. In Parameter setting in evolutionary algorithms, pp. 19-46.

Fogel, D. A., 1990. A parallel processing approach to a multiple travelling salesman problem using evolutionary programming. s.l., s.n., p. 318–326.

Freisleben, B. & Merz, P., 1996. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. s.l., IEEE, pp. 616-621.

Friedrichs , T., Oliveto, P. S., Sudhol, D. & Witt, C., 2009. Analysis of diversity-preserving mechanisms for global exploration. Evolutionary Computation, 17(4), pp. 455-476.

Gendreau, M., Hertz, A. & Laporte, G., 1994. A tabu search heuristic for the vehicle routing problem. Management science, 40(10), pp. 1276--1290.

Gendreau, M., Hertz, A. & Laporte, G., 1994. A tabu search heuristic for the vehicle routing problem. Management science, 40(10), pp. 1276-1290.

Golberg, D. E., 1989. Genetic algorithms in search, optimization, and machine learning. Addion wesley.

Gupta, H. & Wadhwa, D. S., 2014. Speech feature extraction and recognition using genetic algorithm. International Journal of Emerging, 4(1).

Haroun, S. A., Jamal, B. & ElHassani, H., 2015. A Performance Comparison of GA and ACO Applied to TSP. International Journal of Computer Applications, 117(20), pp. 28-35.

Hassanat, A. et al., 2016. Enhancing Genetic Algorithms using Multi Mutations: Experimental Results on the Travelling Salesman Problem. International Journal of Computer Science and Information Security, 14(7), p. 785.

Hassanat, A. B. & Alkafaween, E., 2017. On enhancing genetic algorithms using new crossovers. International Journal of Computer Applications in Technology, 55(3), pp. 202-212.

Hassanat, A. B. et al., 2018. An Improved Genetic Algorithm with a New Initialization Mechanism Based on Regression Techniques. Information, 9(7), p. 167.

Hilding, F. & Ward, K., 2005. Automated Crossover and Mutation Operator Selection on Genetic Algorithms. Melbourne, s.n., pp. 903-909.

Holland, J. H., 1975. Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. Cambridge, MA: MIT Press.

Hong, T. P., Wang, H. S. & Chen, W. C., 2000. Simultaneously applying multiple mutation operators in genetic algorithms. Journal of heuristics, 6(4), pp. 439-455.

Hong, T. P., Wang, H. S., Lin, W. Y. & Lee, W. Y., 2002. Evolution of appropriate crossover and mutation operators in a genetic process. Applied Intelligence, 16(1), pp. 7-17.

Karkory, F. A. & Abudalmola, A. A., 2013. Implementation of Heuristics for Solving Travelling Salesman Problem Using Nearest Neighbour and Minimum Spanning Tree Algorithms. International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering (Vol:7).

Katayama , . K., Sakamoto, . H. & Narihisa, . H., 2000. The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. Mathematical and Computer Modelling, 31(10-12), pp. 197--203.

Korejo , I., Yang, S. & Li, C., 2010. A directed mutation operator for real coded genetic algorithms. s.l., Springer, pp. 491-500.

Larrañaga, P. et al., 1999. Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artificial Intelligence Review, 13(2), pp. 129-170.

Larrañaga, P. et al., 1999. Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artificial Intelligence Review, 13(2), pp. 129-170.

Louis, S. J. & Tang, R., 1999. Interactive genetic algorithms for the traveling salesman problem. s.l., s.n., pp. 1043-1048.

Malek, M., Guruswamy, M., Pandya, M. & Owens, H., 1989. Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Annals of Operations Research, 21(1), pp. 59-84.

Man, K. F., Tang, K. S. & Kwong, S., 1996. Genetic Algorithms: Concepts and Applications. IEEE Transactions on Industrial Electronics, 43(5), pp. 519-534.

Michalewicz, Z., 2013. Genetic algorithms+ data structures= evolution programs. s.l.:Springer Science & Business Media.

Mohammed, A. A. & Nagib, G., 2012. Optimal Routing In Ad-Hoc Network Using Genetic Algorithm. International Journal of Advanced Networking and Applications, 3(05), pp. 1323-1328.

Nicoară, E. S., 2009. Mechanisms to avoid the premature convergence of genetic algorithms. Petroleum–Gas University of Ploieşti Bulletin, Math.–Info.–Phys, pp. 87-96.

Osaba, E., Carballedo, R., Roberto, D. & Fernando , P. A., 2013. Analysis of the suitability of using blind crossover operators in genetic algorithms for solving routing problems. s.l., IEEE, pp. 17--22.

Paul , P. V. et al., n.d. A new population seeding technique for permutation-coded Genetic Algorithm: Service transfer approach. Journal of Computational Science, 5(2), pp. 277--297.

Paulinas, M. & Ušinskas, A., 2015. A survey of genetic algorithms applications for image enhancement and segmentation. Information Technology and control, 36(3).

Potvin, J.-Y., 1996. Genetic algorithms for the traveling salesman problem. Annals of Operations Research, 63(3), pp. 337--370.

Potvin, J. Y., 1996. Genetic algorithms for the traveling salesman problem. Annals of Operations Research, 63(3), pp. 337-370.

Rai, K., Madan, L. & Anand, K., 2014. Research Paper on Travelling Salesman Problem And it’s Solution Using Genetic Algorithm. International Journal Of Innovative Research In Technology, 1(11), pp. 103-114.

Rani , K. & Kumar, V., 2014. Solving travelling salesman problem using genetic algorithm based on heuristic crossover and mutation operator. International Journal of Research in Engineering & Technology, 2(2), pp. 27-34.

Rao , A. & Hegde, S. . K., 2015. Literature survey on travelling salesman problem using genetic algorithms. International Journal of Advanced Research in Eduation Technology (IJARET), 2(1), p. 42.

Rao, I. & Hegde, K., 2015. Literature Survey On Travelling Salesman Problem Using Genetic Algorithms. International Journal of Advanced Research, 2(1).

Ray, . S. S., Bandyopadhyay, S. & Pal, S. K., 2004. New operators of genetic algorithms for traveling salesman problem. s.l., IEEE, pp. 497--500.

Reinelt & Gerhard, 1996. TSPLIB. University of Heidelberg. [Online]

Available at: http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/ [Accessed 2017].

Reinelt & Gerhard, 1996. TSPLIB. University of Heidelberg. [Online]

Available at: http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/ [Accessed 2015].

Samanta, S., De, A. & Singha, S., 2011. OLUTION OF TRAVELING SALESMAN PROBLEM ON SCX BASED SELECTION WITH PERFORMANCE ANALYSIS USING GENETIC ALGORITHM. International Journal of Engineering Science and Technology, 3(8).

Shi, X. H. et al., 2007. Particle swarm optimization-based algorithms for TSP and generalized TSP. Information Processing Letters, 103(5), pp. 169-176.

Singh, A. & Singh, R., 2014. Exploring Travelling Salesman Problem using Genetic Algorithm. International Journal of Engineering Research & Technology (IJERT), 3(2).

Sivanandam, S. & Deepa, S., 2007. Introduction to genetic algorithms. s.l.:Springer.

Soni, N. & Kumar, T., 2014. Study of Various Mutation Operators in Genetic. International Journal of Computer Science and Information Technologies, 5(3), pp. 4519-4521.

Soni, N. & Kumar, T., 2014. Study of Various Mutation Operators in Genetic. (IJCSIT) International Journal of Computer Science and Information Technologies, 5(3), pp. 4519-4521.

Soni, N. & Kumar, T., 2014. Study of Various Mutation Operators in Genetic Algorithms. (IJCSIT) International Journal of Computer Science and Information Technologies, 5(3), pp. 4519-4521.

Srivastava, P. R. & Kim, T. H., 2009. Application of genetic algorithm in software testing. International Journal of software Engineering and its Applications, 3(4), pp. 87-96.

Sun, W., 2009. A novel genetic admission control for real-time multiprocessor systems. s.l., IEEE, pp. 130-137.

T I, M. Z., 1992. Genetic Algorithms+ data Structures= Evolutionary Programs. Berlin: Springer.

Tsang, P. W. & Au, A. T., 1996. A genetic algorithm for projective invariant object recognition. s.l., IEEE, pp. 58-63.

Whitley, D., 1994. A genetic algorithm tutorial. Statistics and computing, 4(2), pp. 65-85.

Yang, S., 2002. Adaptive non-uniform mutation based on statistics for genetic algorithms. s.l., ACM, pp. 490- 495.