The Color Mix Problem

Abstract

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.

Keywords

• color mix problem
• combinatorial optimization
• heuristic algorithms
• genetic algorithms
• tabu search