The Color Mix Problem
Source abstract
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.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Advanced Manufacturing and Logistics Optimization · Optimization and Packing Problems · Scheduling and Optimization Algorithms
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Multimedia Engineering, Kaunas University of Technology, Studentu st. 50-400, LT-51368 Kaunas, Lithuania
References (20)
Show source-provided references
1. Çela, E. (1998). The Quadratic Assignment Problem: Theory and Algorithms, Kluwer.10.1007/978-1-4757-2787-6 ↗
2. Comparison of iterative searches for the quadratic assignment problem10.1016/0966-8349(95)00008-6 ↗
3. Kang, H.R. (1999). Digital Color Halftoning, IEEE Press.
4. Kuznetsov, Y.V. (2021). Principles of Image Printing Technology, Springer.10.1007/978-3-030-60955-9 ↗
5. Lau, D.L., and Arce, G.R. (2008). Modern Digital Halftoning, Marcel Dekker.10.1201/9781420047547 ↗
6. Ulichney, R. (1987). Digital Halftoning, MIT Press.10.7551/mitpress/2421.001.0001 ↗
7. Image processing for halftones
8. Martí, R., Pardalos, P.M., and Resende, M.G.C. (2018). Handbook of Heuristics, Springer.10.1007/978-3-319-07124-4 ↗
9. Finding a cluster of points and the grey pattern quadratic assignment problem10.1007/s00291-005-0010-7 ↗
10. Voß, S., Martello, S., Osman, I.H., and Roucairol, C. (1999). Parallel tabu search for large optimization problems. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer.10.1007/978-1-4615-5775-3 ↗
11. Taillard, E.D., and Gambardella, L.M. (1997). Adaptive Memories for the Quadratic Assignment Problem, CiteSeerX. Technical Report IDSIA-87-97.
12. Experiments with hybrid genetic algorithm for the grey pattern problem10.15388/Informatica.2006.136 ↗
13. A new hybrid genetic algorithm for the grey pattern quadratic assignment problem
14. Hierarchicity-based (self-similar) hybrid genetic algorithm for the grey pattern quadratic assignment problem10.1007/s12293-020-00321-6 ↗
15. Misevičius, A., and Verenė, D. (2021). A hybrid genetic-hierarchical algorithm for the quadratic assignment problem. Entropy, 23.10.3390/e23010108 ↗
16. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley.
17. A multilevel tabu search algorithm for balanced partitioning of unstructured grids10.1002/nme.5003 ↗
18. Glover, F., and Laguna, M. (1997). Tabu Search, Kluwer.10.1007/978-1-4615-6089-0 ↗
19. QAPLIB—A quadratic assignment problem library10.1023/A:1008293323270 ↗
20. (2021, June 30). Hexadecimal Color. Available online: https://cgtweb1.tech.purdue.edu/courses/cgt215/141/Htmlhowto/hexcolor.html.