JSS  Vol.4 No.3 , March 2016
A Neighborhood Expansion Tabu Search Algorithm Based On Genetic Factors

We provide an improved algorithm called “a neighborhood expansion tabu search algorithm based on genetic factors” (NETS) to solve traveling salesman problem. The algorithm keeps the traditional tabu algorithm’s neighborhood, ensure the algorithm’s strong climbing ability and go to the local optimization. At the same time, introduce the genetic algorithm’s genetic factor (crossover factor and variation factor) to develop new search space for bounded domain. It can avoid the defects of the alternate search. The results show that this optimization algorithm has improved a lot in the target of “target value”, “convergence” and compared with traditional tabu algorithm and genetic algorithm.

Cite this paper
Wang, D. , Xiong, H. and Fang, D. (2016) A Neighborhood Expansion Tabu Search Algorithm Based On Genetic Factors. Open Journal of Social Sciences, 4, 303-308. doi: 10.4236/jss.2016.43037.
[1]   Gao, H.C., Feng, B.Q. and Zhu, L. (2006) Reviews of the Meta-Heuristic Algorithms for TSP. Control and Decision, 21, 241-247.

[2]   Li, Y. and Kang, Z. (2000) Guo’s Algorithm and Its Application. Journal of Wuhan University of Technology, 22, 101- 104.

[3]   Jin, L., Guo, Z.H. and Zheng, C.Y. (2014) Study on Improved Method of Neural Net-work to Solve TSP. Computer Simulation, 31, 355-358.

[4]   Xie, Y. (1998) A Summary on the Simulated Annealing Algorithm. Application Research of Computers, 15, 7-9.

[5]   Li, Y.X. and Peng, G. (2010) TSP Problem Based on Tabu Search. Guangxi Computer Society. Proceedings of the 2010 Academic Annual Conference of Guangxi Computer Society, 5.

[6]   Guo, P. and Yan, W.J. (2007) The Review of Ant Colony Algorithm Based on TSP. Computer Science, 10, 181-184+ 194.

[7]   Wang, L. and Zheng, D.Z. (2000) Meta-Heuristic Algorithm: A Review. Control and Decision, 3, 257-262.

[8]   Yu, L. and Lu, F. (2014) A Hybrid Algorithm for Traveling Salesman Problem in Road Network. Acta Geodaetica et Cartographica Sinica, 43, 1197-1203.

[9]   Glover, F. (1986) Future Paths for Integer Programming and Links to Artificial Intelligence. Computers & Operations Research, 13, 533-549.

[10]   Holland, J.H. (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1992.

[11]   Li, D.W., Wang, L. and Wang, M.G. (1998) Genetic Algorithm And Tabu Search: A Hybrid Strategy. Journal of Systems Engineering, 3, 30-36.

[12]   Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading.

[13]   Torr, P.H.S. and Murray, D.W. (1997) The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix. International journal of computer vision, 24, 271-300. http://dx.doi.org/10.1023/A:1007927408552

[14]   Zhang, Z., Qin, H., Zhu, W., et al. (2012) The Single Vehicle Routing Problem with Toll-by-Weight Scheme: A Branch-and-Bound Approach. European Journal of Operational Research, 220, 295-304. http://dx.doi.org/10.1016/j.ejor.2012.01.035