Travelling salesman problem and Vehicle Routing Problems are the typical classical combinatorial optimization problem. Exact algorithms couldn't solve the real problem with big number of cities, therefore, heuristic methods are another approaches or way to solve problems with high dimension. 
The work was carried out at the section of Operations Research at System Analysis and Control department, Saint-Petersburg State Polytechnic University. The project relate to many algorithms, for examples: the Ant Colony System, Genetic Algorithm, Guided Local search, Lin-Kernighan, Meta-Heuristic, 2-Opt, k-Opt. Program was writen on C#.