Existing graph-theoretic heuristics for block plan design attempt to maximize the sum of the REL chart seores of adjacent pairs of facilities. A new graph-theoretic heuristic is presented which has the aim of minimizing total transport ation cost instead. This has the advantage of giving credit in the objective function to pairs of facilities which are somewhat near but not actually adjacent. Reported computational experience with the method is encouraging.