New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
为旅行商问题提出了一种新的插入程序和后优化例程，两者结合形成高效算法GENIUS，在解质量和计算时间上优于已知启发式方法。
This paper describes a new insertion procedure and a new postoptimization routine for the traveling salesman problem. The combination of the two methods results in an efficient algorithm (GENIUS) which outperforms known alternative heuristics in terms of solution quality and computing time.