A Taxonomy of Global Optimization Methods Based on Response Surfaces
Journal of Global Optimization
Geometric generalisation of surrogate model based optimisation to combinatorial spaces
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Geometry of evolutionary algorithms
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Geometry of evolutionary algorithms
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that a type of SMs - radial basis function networks (RBFNs) - can be rigorously generalised to encompass combinatorial spaces based in principle on any arbitrarily complex underlying solution representation by extending their natural geometric interpretation from continuous to general metric spaces. This direct approach to representations does not require a vector encoding of solutions, and allows us to use SMs with the most natural representation for the problem at hand. In this work, we apply this framework to combinatorial problems using the permutation representation and report experimental results on the quadratic assignment problem.