The Traveling Salesman Problem asks for a cheapest (shortest) connection of nodes from a node set by a selection of arcs. Thereby it has to be considered, that each node is connected to exactly two arcs and furthermore, that the result yields exactly one cycle, called a tour. The Quadratic Traveling Salesman Problem also asks for a cheapest tour, but in this case any two in a tour consecutive arcs are assigned a certain cost value. This master thesis enfolds the development and implementation of heuristics for the symmetric Angular Traveling Salesman Problem and the symmetric Angular-Distance Traveling Salesman Problem. For the Angular Traveling Salesman Problem the angles at nodes, which are formed by creating a tour, are the cost factors which should be minimized. For the Angular-Distance Traveling Salesman Problem these angles and the distances between the nodes are considered in combination. It is stated, that the mentioned problems cannot be solved optimally in an efficient way. Therefore, for finding solutions, it is useful to use heuristic approaches. This master thesis presents classical approaches used for the Traveling Salesman Problem like the Nearest Neighbor method and moreover new developed heuristics like working with convex hulls, which are using the special geometrical structure of the nodes which are given as points in the plane. Mathematical terms used in this thesis get introduced in a formal way and the implemented heuristics are explained verbally, technically and in the form of pseudocodes. An extensive evaluation compares the heuristic results with already known optimal values and with heuristic results from reference literature. It can be shown, that the new developed algorithms can distinctly outperform previously known methods.