A novel application of crossover operator to a hybrid optimization framework: Investigation into cutting problems

The Generate and Solve (GS) is a hybrid optimization framework that combines a metaheuristic engine (genetic algorithm), which works as a generator of reduced instances of the original optimization problem, and an integer programming solver. GS has been recently introduced in the literature and achieved promising results in cutting and packing problem instances. In this paper, we present a novel application of crossover operator, the Uniform Order-Based Crossover, to the GS framework. As a means to assess the potentialities behind the novel application, we provide as instantiation of the framework for dealing specifically with the constrained two-dimensional non-guillotine cutting problem. Computational experiments performed over standard benchmark problems are reported and discussed here, evidencing the effectiveness of the novel operator.