Researchers and legislators alike continue the search for methods of drawing fair districting plans. A districting plan is a partition of a state's subdivisions (e.g. counties, voting precincts, etc.). By modeling these districting plans as graphs, they are easier to create, store, and operate on. Since graph partitioning with balancing populations is a computationally intractable (NP-hard) problem most attempts to solve them use heuristic methods. In this paper, we present a variant on the $k$-medoids algorithm where, given a set of initial medoids, we find a partition of the graph's vertices to admit a districting plan. We first use the $k$-medoids process to find an initial districting plan, then use local search strategies to fine-tune the results, such as reducing population imbalances between districts. We also experiment with coarsening the graph to work with fewer vertices. The algorithm is tested on Iowa and Florida using 2010 census data to evaluate the effectiveness.