Faculty Advisor

Servatius, Brigitte

Abstract

We evaluated three heuristics used to approximate solutions to the Traveling Salesman Problem, namely the 2-Opt and 3-Opt procedures, and a genetic algorithm. We considered the complexity of each heuristic and the quality of the solution it produced. Each of these algorithms was implemented and tested on problems from the TSPLIB. Simulation data were compared with results from the theoretical analysis.

Publisher

Worcester Polytechnic Institute

Date Accepted

January 2000

Major

Mathematical Sciences

Project Type

Major Qualifying Project

Accessibility

Restricted-WPI community only

Advisor Department

Mathematical Sciences

Share

COinS