A new hybrid optimization algorithm

We develop a new optimization algorithm that combines the genetic algorithm and a recently proposed global optimization algorithm called the nested partitions method. The resulting hybrid algorithm retains the global perspective of the nested partitions method and the local search capabilities of the genetic algorithm. We also present a detailed application of the new algorithm to a NP-hard product design problem and it is found empirically to outperform a pure genetic algorithm implementation, particularly for large problems.