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.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Lavoie, Matthew David
• Freeman, Andre Lawrence

Publisher

• Worcester Polytechnic Institute

Identifier

• 00D087M

Advisor

• Servatius, Brigitte

Year

• 2000

Date created

• 2000-01-01

Resource type

• Major Qualifying Project

Major

• Mathematical Sciences

Rights statement

• In Copyright

License

• All rights reserved