Algoritmic approaches for routing problems

Routing problems are among the most important optimization problems in the field of Operations Research. Due to the significant economic benefit that can be achieved by optimizing the routing problems, researchers give more and more attention to these problems. Besides, since routing problems belong to the class of NP-hard, these problems play an important role in computer science literature. In this thesis, routing problems are investigated and traveling salesman problem and multiple traveling salesman problem, which are considered as pure routing problems, are studied, the solution approaches for the problem are investigated and new heuristic algorithms are proposed for these problems. The proposed algorithms have been implemented in C language, have been tested on the TSPLIB library and compared with a similar literature works. The experimental results show that the proposed algorithms find better solutions than the existing methods.