The Color Mix Problem

In this paper, we introduce a new combinatorial optimization problem entitled the color mix problem (CMP), which is a more general case of the grey pattern quadratic assignment problem (GP-QAP). Also, we propose an original hybrid genetic-iterated tabu search algorithm for heuristically solving the CMP. In addition, we present both analytical solutions and graphical visualizations of the obtained solutions, which clearly demonstrate the excellent performance of the proposed heuristic algorithm.

Experimental Analysis of Hybrid Genetic Algorithm for the Grey Pattern Quadratic Assignment Problem

In this paper, we present the results of the extensive computational experiments with the hybrid genetic algorithm (HGA) for solving the grey pattern quadratic assignment problem (GP-QAP). The experiments are on the basis of the component-based methodology where the important algorithmic ingredients (features) of HGA are chosen and carefully examined. The following components were investigated: initial population, selection of parents, crossover procedures, number of offspring per generation, local improvement, replacement of population, population restart). The obtained results of the conducted experiments demonstrate how the methodical redesign (reconfiguration) of particular components improves the overall performance of the hybrid genetic algorithm.

TESTING OF CROSSOVER OPERATORS FOR THE GREY PATTERN PROBLEM

Recently genetic algorithms (GAs) are a great success in solving combinatorial optimization problems. In this paper the performance issues related to the genetic search in the context of the grey pattern problem (GPP) are discussed. The main attention is paid to the investigation of the solution recombination, i.e. crossover operators, which play an important role developing robust genetic algorithms. We implemented seven crossover operators within the hybrid genetic algorithm (HGA) framework, and carried out the extensive experiments in order to test the influence of the recombination operators on the genetic search process. The results obtained from the experimentation with GPP test instances (benchmarks) demonstrate promising efficiency of so‐called multiple parent crossover which is based on a special type of recombination of several solutions‐parents.