Multi-objective Binary Search Optimisation

摘要

In complex engineering problems, often the objective functions can be very slow to evaluate. This paper introduces a new algorithm that aims to provide controllable exploration and exploitation of the decision space with a very limited number of function evaluations. The paper compares the performance of the algorithm to a typical evolutionary approach.