Districting Problems - New Geometrically Motivated Approaches

This thesis focuses on districting problems were the basic areas are represented by points or lines. In the context of points, it presents approaches that utilize the problem's underlying geometrical information. For lines it introduces an algorithm combining features of geometric approaches, tabu search, and adaptive randomized neighborhood search that includes the routing distances explicitly. Moreover, this thesis summarizes, compares and enhances existing compactness measures.