西南交通大学学报（英文版）2005，Vol.13Issue(1)：1-4,4.
Novel Local Search Method for the Traveling Salesman Problem
Novel Local Search Method for the Traveling Salesman Problem
摘要
Abstract
A new local search method for the traveling salesman problem based on an original greedy representation of solution space and neighborhood structure is proposed. First, a partial closed route that only consists of three cities is given; then other cities are added to this route by a greedy procedure successively. Implemented on a personal computer, this algorithm finds optimal solutions for 24 out of 27 standard benchmarks, and outperforms the Full Subpath Ejection Algorithm (F-SEC) proposed by Rego in 1998.关键词
Traveling salesman problem/Heuristics/Local searchKey words
Traveling salesman problem/Heuristics/Local search分类
社会科学引用本文复制引用
Huang Wenqi,Wang Lei..Novel Local Search Method for the Traveling Salesman Problem[J].西南交通大学学报（英文版）,2005,13(1):1-4,4.基金项目
The National Grand Fundamental Research 973 Program of China (No.G1998030600). （No.G1998030600）
