C. H. Papadimitriou, The euclidean traveling salesman problem is NP-complete, Theoretical Computer Science, vol.4, issue.3, pp.237-244, 1977.
DOI : 10.1016/0304-3975(77)90012-3
URL : https://doi.org/10.1016/0304-3975(77)90012-3

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theoryof NP-Completeness, 1979.

R. Matai, S. P. Singh, and M. L. Mittal, Traveling Salesman Problem: An Overview of Applications, Formulations, and Solution Approaches, pp.1-24, 2010.

J. N. Macgregor and Y. Chu, Human Performance on the Traveling Salesman and Related Problems: A Review, The Journal of Problem Solving, vol.3, issue.2, 2011.

G. Finke, A. Claus, and E. Gunn, A two-commodity network flow approach to the traveling salesman problem, Congressus Numerantium, vol.41, pp.167-178, 1984.

M. Held and R. M. Karp, A dynamic programming approach to sequencing problems, Journal of the Society for Industrial and Applied Mathematics, vol.10, issue.1, pp.196-210, 1962.

B. Fleischmann, A cutting plane procedure for the travelling salesman problem on road networks, European Journal of Operational Research, vol.21, issue.3, pp.307-317, 1985.

M. Bellmore and G. L. Nemhauser, The traveling salesman problem: A survey, Operations Research, vol.16, issue.3, pp.538-558, 1968.

D. J. Rosenkrantz, R. E. Stearns, and M. L. Philip, An analysis of several heuristics for the traveling salesman problem, SIAM Journal on Computing, vol.6, issue.3, pp.563-581, 1977.

G. A. Croes, A method for solving traveling-salesman problems, Operations Research, vol.6, issue.6, pp.791-812, 1958.

S. Lin, Computer solutions of the travelling salesman problem, Bell Systems Technical Journal, vol.44, issue.10, pp.2245-2269, 1965.

S. Lin and B. Kernighan, W: An effective heuristic algorithm for the traveling salesman problem, Operations Research, vol.21, issue.2, pp.498-516, 1973.

P. Hansen and N. Mladenovi´cmladenovi´c, An introduction to variable neighborhood search, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp.433-458, 1999.
DOI : 10.1007/978-1-4615-5775-3_30

P. Hansen and N. Mladenovi´cmladenovi´c, Variable neighborhood search: principles and applications, European Journal of Operational Research, vol.130, issue.3, pp.449-467, 2001.
DOI : 10.1016/s0377-2217(00)00100-4

S. Hore, A. Chatterjee, and A. Dewanji, Improving variable neighborhood search to solve the traveling salesman problem, Applied Soft Computing, vol.68, pp.83-91, 2018.
DOI : 10.1016/j.asoc.2018.03.048

S. Kirkpatrick, C. D. Gelatt, and M. Vecchi, Optimization by simulated annealing, New Series, vol.220, issue.4598, pp.671-680, 1983.

D. Whitley, A genetic algorithm tutorial, Statistics and Computing, vol.4, issue.2, pp.65-85, 1994.
DOI : 10.1007/bf00175354
URL : http://www.cs.uga.edu/~potter/CompIntell/ga_tutorial.pdf

D. Guo, H. Chen, and B. Wang, An Improved Genetic Algorithm with Decision Function for Solving Travelling Salesman Problem. Proceeding of 12th ISKE, pp.1-7, 2017.
DOI : 10.1109/iske.2017.8258774

,

A. Colorni, M. Dorigo, and V. Maniezzo, Distributed Optimization by Ant Colonies, Proceedings of European Conference on Artificial Life, pp.134-142, 1991.

L. Shufen, L. Huang, and H. Lu, Pheromone Model Selection in Ant Colony Optimization for the Travelling Salesman Problem, Chinese Journal of Electronics, vol.26, issue.2, pp.223-229, 2017.

N. Xiong, W. Wu, and C. Wu, An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks. Autonomous and Sustainable Computing for preparing the Internet of, Things Environment, vol.9, issue.6, p.985, 2017.

C. Ratanavilisagul, Modified Ant Colony Optimization with Pheromone Mutation for Travelling Salesman Problem. Proceeding of 14th ECTI-CON, pp.411-414, 2017.

,

M. Cheng and D. Prayogo, Symbiotic Organisms Search: A new metaheuristic optimization algorithm, Computers and Structures, vol.139, pp.98-112, 2014.

A. E. Ezugwu, .. Adewumi, and A. O. , Discrete symbiotic organisms search algorithm for travelling salesman problem, Expert Systems With Applications, vol.87, pp.70-78, 2017.

A. E. Ezugwu, .. Adewumi, A. O. Fr??ncufr??ncu, and M. E. , Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem, Expert Systems With Applications, vol.77, issue.1, pp.189-210, 2017.

S. G. Ozden, A. E. Smith, and K. R. Gue, Solving large batches of travelling salesman problems with parallel and distributed computing, Computers and Operations Research, vol.85, pp.87-96, 2017.

J. Xu, Probe Machine. IEEE transations on neural networks and learning systems, vol.27, pp.1405-1416, 2016.