To reduce clutter on wide-area geographic data view displays of electric power systems, substations in geographically compact areas should be spread out and line overlaps and intersections minimized. Such pat- terns optimized with respect to given constraints can be modeled as a multicommodity flow problem. Due to the size of the developed model, we developed two clustering-based iterative algorithms to decompose the global network into smaller regions and then iteratively solve the subproblem in each region by readjusting some values. Three solutions were selected for experimental evaluation. The experimental results were somewhat inconclusive, due to naïve participants, simple task, and limitations of the eye tracker. Nevertheless, two of the decluttered maps appeared to have distinct advantage over the baseline map, where substations were simply connected by straight lines, in terms of performance time and workload.

Publication Date


Document Type

Technical Report

Department, Program, or Center

Psychology, Department of


College of Liberal Arts


RIT – Main Campus