Traveling Salesman Problem - Parallel Methods Using SMP (OpenMP)

Thesis compares serial and parallel methods for solving traveling salesman problem. Some of the well-known heuristics are used. These have been tested for long hours. Time and space complexity are used as comparing measure. It was discovered that small part of ACO source code in parallel is going to speed up the code according to Amdahl's law