New insertion and postoptimization procedures for the traveling salesman problem. (English) Zbl 0767.90087
This paper describes a new insertion procedure and 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.
Reviewer: A.Hertz (Lausanne)
MSC:
90C35 | Programming involving graphs or networks |
90C27 | Combinatorial optimization |
90B06 | Transportation, logistics and supply chain management |
90-08 | Computational methods for problems pertaining to operations research and mathematical programming |