Ahmadvand, M., YousefiKhoshbakht, M., &MahmoodiDarani, N. (2012).Solving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm.Journal of Advances in Computer Research, 3(3), 75-84.
Anantathanavit, M., &Munlin, M. (2015).Using K-means Radius Particle Swarm Optimization for the Travelling Salesman Problem. IETE Technical Review, 1-9.
Battarra, M., & Pessoa, A. A. (2014). Subramanian, A., Uchoa, E., Exact algorithms for the traveling salesman problem with draft limits. European Journal of Operational Research, 235(1), 115-128.
Dorigo, M., Maniezzo, V., &Colorni, A. (1996).Ant System: Optimization by a colony of cooperating agents.IEEE Transactions on Systems, Man, and Cybernetics—Part B, 26(1), 29-41.
Glover, F. (1986).Future paths for integer programming and links to artificial intelligence.Computer Operation Research, 13, 533.549.
Lin, S. (1965). Computer solutions of the traveling salesman problem.Bell System Technical Journal, 44, 2245-2269.
Odili, J. B., &MohmadKahar, M. N. (2016).Solving the Traveling Salesman’s Problem Using the African Buffalo Optimization. Computational Intelligence and Neuroscience.
Qinghong, WU.,&Jihui, Z. (1999). ACO with the characteristic of Mutation, Computer research and development, 240-245.
Sedighpour, M., YousefiKhoshbakht, M., &MahmoodiDarani, N. (2011). An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem. Journal of optimization in Industrial Engineering, 4(8), 73-79.
Tsai, C. F.,&Tsai.C.W. (2002).A new approach for solving large traveling salesman problem using evolution ant rules, in Neural Networks, IJCNN 2002, Proc. of the 2002 Int’l Joint Conf., Honolulu, IEEE Press, 540-1545.
Xiao, M., &Nagamochi, H. (2016).An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4. Theory of Computing Systems, 58(2), 241-272.
YousefiKhoshbakht, M., Didehvar, F., & Rahmati, F. (2013). Modification of the Ant Colony Optimization for Solving the Multiple Traveling Salesman Problem, Romanian Journal of information science and technology, 16(1), 65–80.
Yousefikhoshbakht, M., Didehvar, F., & Rahmati, F. (2014).Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm. International Journal of Production Research, 52(9), 2565-2575.
YousefiKhoshbakht, M., &Sedighpour, M. (2012).A New Imperialist Competitive Algorithm to Solve the Traveling Salesman Problem.International Journal of Computer Mathematics, 90(7), 1495-1505.
YousefiKhoshbakht, M., Sedighpour, M., &Mahmoodabadi, E. (2011).A Modified Elite ACO Based Avoiding Premature Convergence for Traveling Salesman Problem. Journal of Industrial Engineering International, 7(15), 68-75.
Zhong, W., Zhang, J., & Chen, W. (2007). A novel discrete particle swarm optimization to solve traveling salesman problem. Evolutionary Computation, 3283–3287.