References

Adewole, A.P., K. Otubamowo and T.O. Egunjobi, 2012. A comparative study of simulated annealing and genetic algorithm for solving the travelling salesman problem. Int. J. Applied Inform. Syst., 4: 6-12.
CrossRef  |  Direct Link  |  

Alp, A., 2004. Ant colony optimization for the single model U-type assembly line balancing problem. Ph.D Thesis, Bilkent University, Ankara, Turkey.

Applegate, D.L., R.E. Bixby, V. Chvatal and W.J. Cook, 2007. The Traveling Salesman Problem: A Computational Study. Princeton University Press, New Jersey.

Brezina Jr, I. and Z. Cickova, 2011. Solving the travelling salesman problem using the ant colony optimization. Manage. Inf. Syst., 16: 10-14.

Colorni, A., M. Dorigo and V. Maniezzo, 1991. Distributed optimization by Ant Colonies. In: Toward a Practice of Autonomous Systems: Proceedings of the European Conference on Artificial Life, Varela, F.J. and P. Bourgine (Eds.). MIT Press, Cambridge, Massachusetts, USA., pp: 134-142.

Colorni, A., M. Dorigo and V. Maniezzo, 1992. An Investigation of Some Properties of an Ant Algorithm. In: Parallel Problem Solving from Nature, 2: Proceedings of the Second Conference on Parallel Problem Solving from Nature, Manner, R. and B. Manderick (Eds.). Elsevier Publishing, Brussels, Belgium, pp: 509-520.

Demez, H., 2013. Combinatorial optimization: Solution methods of traveling salesman problem. Ph.D Thesis, Eastern Mediterranean University, Famagusta, Northern Cyprus.

Dorigo, M., V. Maniezzo and A. Colorni, 1991. Positive feedback as a search strategy. Technical Report No. 91-016, Politecnico di Milano, Italy.

Fekete, S.P., R. Fleischer, A. Fraenkel and M. Schmitt, 2004. Traveling salesmen in the presence of competition. Theor. Comput. Sci., 313: 377-392.
Direct Link  |  

Firoozkooh, I., 2011. Using imperial competitive algorithm for solving traveling salesman problem and comparing the efficiency of the proposed algorithm with methods in use. Aust. J. Basic Appl. Sci., 5: 540-543.
Direct Link  |  

Kendall, G. and J. Li, 2013. Competitive travelling salesmen problem: A hyper-heuristic approach. J. Oper. Res. Soc., 64: 208-216.
Direct Link  |  

Li, J. and G. Kendall, 2015. A hyper-heuristic methodology to generate adaptive strategies for games. IEEE. Trans. Comput. Intell. AI Games, 9: 1-10.
Direct Link  |  

Matai, R., S. Singh and M.L. Mittal, 2010. Traveling Salesman Problem: An Overview of Applications, Formulations and Solution Approaches. In: Traveling Salesman Problem, Theory and Applications, Davendra, D. (Ed.). InTech Publisher, Rijeka, Croatia, ISBN:978-953-307-426-9, pp: 1-24.

Mohtadi, M. and K. Nogondarian, 2014. Solving the traveling salesman problem in competitive situations using the game theory. Appl. Math. Eng. Manage. Technol., 2: 311-325.
Direct Link  |  

Rani, K. and V. Kumar, 2014. Solving travelling salesman problem using genetic algorithm based on heuristic crossover and mutation operator. Intl. J. Res. Eng. Technol., 2: 27-34.
Direct Link  |  

Shaikh, M. and M. Panchal, 2012. Solving asymmetric travelling salesman problem using memetic algorithm. Int. J. Emerg. Technol. Adv. Eng., 2: 634-639.
Direct Link  |  

Taba, M.S.E., 2009. Solving traveling salesman problem with a non-complete graph. Ph.D Thesis, University of Waterlo, Waterloo, Canada.