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.
Worcester Polytechnic Institute
Major Qualifying Project
Access to this report is limited to members of the WPI community. Please contact a project advisor or their department to request access
Restricted-WPI community only