A Parallel variable neighborhood search for the Traveling Salesman Problem
When trying to find approximate solutions for the Traveling Salesman Problem with heuristic optimization algorithms, the reduction of the computational time or the increase of the exploration in the search space are two important aspects. Used variable neighborhood search to solving the Traveling Salesman Problem, and improved this algorithm in initial solutions production, neighbor structure and improved shaking step with parallel method, it makes full use of the Variable Neighborhood Search and the parallelism advantages. Test with some instances in TSPLIB, the result shows that the algorithm can achieve satisfied solution with satisfied speed.
component vns parallel computing tsp metaheuristic
Gao Lei-fu Dong Wei
Institute of Mathematics and Systems Science College of Science, Liaoning Technical University Fuxin, Liaoning, China
国际会议
成都
英文
150-152
2010-07-09（万方平台首次上网日期，不代表论文的发表时间）