TITLE:
A Neighborhood Expansion Tabu Search Algorithm Based On Genetic Factors
AUTHORS:
Dan Wang, Haitao Xiong, Deying Fang
KEYWORDS:
Traveling Salesman Problem, Genetic Algorithm, Tabu Algorithm, Genetic Factors
JOURNAL NAME:
Open Journal of Social Sciences,
Vol.4 No.3,
March
31,
2016
ABSTRACT: 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.