Inferring future landscapes: Sampling the local optima level

Abstract

Connection patterns among Local Optima Networks (LONs) can inform heuristic design for optimisation. LONresearch has predominantly required complete enumeration of a fitness landscape, thereby restricting analysis to problems diminutive in size compared to real-life situations. LON sampling algorithms are therefore important. In this article, we study LON construction algorithms for the Quadratic Assignment Problem (QAP). Usingmachine learning,we use estimated LON features to predict search performance for competitive heuristics used in the QAP domain. The results show that by using random forest regression, LONconstruction algorithms produce fitness landscape features which can explain almost all search variance.We find that LON samples better relate to search than enumerated LONs do. The importance of fitness levels of sampled LONs in search predictions is crystallised. Features from LONs produced by different algorithms are combined in predictions for the first time, with promising results for this “super-sampling”: A model to predict tabu search success explained 99% of variance. Arguments are made for the use-case of each LON algorithm and for combining the exploitative process of one with the exploratory optimisation of the other.