Solving Dichotomy-based Constrained Encoding With Twin Graph Coloring
نویسنده
چکیده
Constrained encoding consists of finding a minimum length state encoding that meets some requirements. Dichotomy-based constrained encoding is more general than other constrained encoding frameworks, but it is also more difficult to solve in practice. This paper introduces a new formalization of this problem, which reduces it to what we call a twin graph coloring. This new problem leads to original exact and heuristic algorithms. Experimental results show that the exact solver outperforms the best known exact solvers, and that the heuristic version is competitive.
منابع مشابه
Selection Graph Coloring: Application to Constrained Encoding
This paper aims at introducing the concept of selection graph with an application to a non-trivial problem. A selection graph is made of a set of classes, each class having multiple realizations, and of an uncompatibility graph built on these realizations. Coloring a selection graph can be used to solve constrained scheduling, constrained ressource allocation, and dichotomy-based constrained en...
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کاملNew Order-Based Crossovers for the Graph Coloring Problem
Huge color class redundancy makes the graph coloring problem (GCP) very challenging for genetic algorithms (GAs), and designing effective crossover operators is notoriously difficult. Thus, despite the predominance of population based methods, crossover plays a very minor role in most state-of-the-art approaches to solving the GCP. Two main encoding methods have been adopted for heuristic and G...
متن کاملMinimum Cost Homomorphisms with Constrained Costs
Minimum cost homomorphism problems can be viewed as a generalization of list homomorphism problems. They also extend two well-known graph colouring problems: the minimum colour sum problem and the optimum cost chromatic partition problem. In both of these problems, the cost function meets an additional constraint: the cost of using a specific colour is the same for every vertex of the input gra...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کامل