Solving the graph coloring problem via hybrid genetic algorithms
نویسندگان
چکیده
منابع مشابه
Solving Graph Coloring Problem by Fuzzy Clustering-Based Genetic Algorithm
The graph coloring problem is one of famous combinatoria1 optimization problerns. Some researchers attempted to solve combinatoria1 optimization problem with evolutionary a1gorithm, which can find near optima1 solution based on the evolution mechanism of the nature. However, it sometimes requires too much cost to eva1uate fitness of a large number of individuals in the population when applying ...
متن کاملSecurely Solving the Distributed Graph Coloring Problem
Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some fashion. A typical approach for solving such problem is to collect all of this information together and centrally solve the problem. However, this requires all...
متن کاملSolving Graph Coloring Problems Using Cultural Algorithms
In this paper, we combine a novel Sequential Graph Coloring Heuristic Algorithm (SGCHA) with a non-systematic method based on a cultural algorithm to solve the graph coloring problem (GCP). The GCP involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In our solving approach, we first use an estimator which is implemented...
متن کاملSolving the Generalized Graph Search Problem with Genetic Algorithms
This paper describes a genetic algorithm for finding low-cost paths through connectivity graphs. The map search problem does not lend itself to implementation with genetic algorithms because it is difficult to define a physically meaningful crossover operator: combining half of one set of driving directions with half of another set will rarely result in meaningful instructions. A selective cros...
متن کاملHybrid Evolutionary Algorithms for Graph Coloring
A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. In this paper, we present such hybrid algorithms for the graph coloring problem. These algorithms combine a new class of highly specialized crossover operators and a well-known tabu search algorithm. Experiments of such a hybrid algorithm are carried out on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of King Saud University - Engineering Sciences
سال: 2015
ISSN: 1018-3639
DOI: 10.1016/j.jksues.2013.04.001