Hybridizing non-dominated sorting algorithms
Margarita Markina, Maxim Buzdalov · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2017
Many production-grade algorithms benefit from combining an asymptotically efficient algorithm for solving big problem instances, by splitting them into smaller ones, and an asymptotically inefficient algorithm with a very small implementation constant for solving small subproblems. A well-known example is stable sorting, where mergesort is often combined with insertion sort to achieve a constant but noticeable speed-up.