Standard Article

Heuristics for the Traveling Salesman Problem

  1. Mary E. Kurz

Published Online: 15 FEB 2011

DOI: 10.1002/9780470400531.eorms0929

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Kurz, M. E. 2011. Heuristics for the Traveling Salesman Problem. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. Clemson University, Department of Industrial Engineering, Clemson, South Carolina

Publication History

  1. Published Online: 15 FEB 2011

Abstract

The article considers heuristics (methods to create feasible solutions) for the traveling salesman problem (TSP). We differentiate between constructive heuristics which create feasible solutions from no solution, and improvement heuristics which potentially create new feasible solutions from existing feasible solutions. While the list of published heuristics and variants of the TSP is nearly unlimited, this article focuses on an overview of the most enduring methods for the TSP with an unrestricted distance matrix.

Keywords:

  • insertion heuristics;
  • constructive heuristics;
  • improvement heuristics;
  • traveling salesman problem