Algorithms for solving a spatial optimisation problem on a parallel computer

✍ Scribed by George, Felicity; Radcliffe, Nicholas; Smith, Mark; Birkin, Mark; Clarke, Martin

• Publisher: John Wiley and Sons
• Year: 1997
• Tongue: English
• Weight: 337 KB
• Volume: 9
• Category: Article
• ISSN: 1040-3108
• DOI: 10.1002/(sici)1096-9128(199708)9:8<753::aid-cpe246>3.0.co;2-q

✦ Synopsis

In a collaborative project between GMAP Ltd and EPCC, an existing heuristic optimisation scheme for strategic resource planning was parallelised to run on the data parallel Connection Machine CM-200. The parallel software was found to run over 2700 times faster than the original workstation software. This has allowed the exploration of complex business planning strategies at a national, rather than regional, level for the first time. The availability of a very fast evaluation program for planning solutions also enabled an investigation of the use of genetic algorithms in place of GMAP's existing heuristic optimisation scheme. The results of this study show that genetic algorithms can provide better quality solutions in terms of both predicted profit from the solution and spatial diversity to provide a range of possible solutions. This paper discusses both the parallelisation of the original optimisation scheme and the use of genetic algorithms in place of this method.