Visualisation of Combinatorial Program Space and Related Metrics
Alwyn V. Husselmann, Ken A. Hawick · 2013
Searching a large knowledge or information space for op- timal regions demands sophisticated algorithms, and some- times unusual hybrids or combined algorithms. Choosing the best algorithm often requires obtaining a good intu- itive or visual understanding of its properties and progress through a space. Visualisation in combinatorial optimizers is more challenging than visualising parametric optimizers. Each problem in combinatorial optimisation is qualitative and has a very different objective, whereas parametric op- timizers are quantitative and can be visualised almost triv- ially. We present a method for visualising abstract syntax trees in an interactive manner, as well as some certain en- hancements for evolutionary algorithms. We also discuss the use of this in improving the convergence performance of a Geometric Particle Swarm Optimiser.