You're butting against the relatively complex problem efficiently laying out graphs. The simplest way to approach this is using Force-based algorithms.

Essentially, treat the locations as masses connected by damped springs. Then run what amounts to a physics simulation until the masses no longer move or some specified number of iterations is reached.

For a pre-packaged Perl solution, I've used Graph::Layouter to good effect.