Saturday, November 03, 2007

Heuristics for Travelling Salesman Problem

I added matlab code for some heuristics of travelling salesman problem (TSP) to snipplr.

The code contains three different heuristics:
1. Nearest neighborhood
2. 2 opt (improvement algorithm)
3. Farthest and arbitrary insertion

I prepared these snippets for a graduate course called as Heuristic Methods in OR that I take in Bogazici University Industrial Engineering department.