Basic algorithms were first produced 20 years ago
a so called mild steepest descent heuristic (AZP) worked well on small problems (N=73) see Openshaw (1977)
a form of Monte Carlo optimisation that swapped edge zones in and out to optimise a function
BUT
- no suitable digital map data
- HPC computers were far too slow