New Insertion and Postoptimization Procedures for the Traveling Salesman Problem

1 December 1992

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 40 (6) , 1086-1094
https://doi.org/10.1287/opre.40.6.1086

Abstract

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.

Keywords

POSTOPTIMIZATION
PROCEDURES
ROUTINE
GENIUS
EFFICIENT
HEURISTICS
TRAVELING SALESMAN PROBLEM
NEW INSERTION

This publication has 0 references indexed in Scilit: