منابع مشابه
Genetic Algorithms for Partitioning Sets
We first revisit a problem from the literature, that of partitioning a given set of numbers into subsets such that their sums are as nearly equal as possible. We devise a new genetic algorithm, Eager Breeder, for this problem. The algorithm is distinctive in its novel and aggressive way of extracting parental genetic material when forming a child partition, and its results are a substantial imp...
متن کاملPartitioning Sets with Genetic Algorithms
We first revisit a problem in the literature of genetic algorithms: arranging numbers into groups whose summed weights are as nearly equal as possible. We provide a new genetic algorithm which very aggressively breeds new individuals which should be improved groupings of the numbers. Our results improve upon those in the literature. Then we extend and generalize our algorithm to a related class...
متن کاملGraph Partitioning Using Genetic Algorithms
The eecient implementation of parallel processing ar-chitectures generally requires the solution of hard combi-natorial problems involving allocation and scheduling of tasks. Such problems can often be modelled with considerable accuracy as a graph partitioning problem|a problem well-known from complexity theory to be NP-hard, which implies that for practical purposes the global optimum will no...
متن کاملProblem Partitioning in Hybrid Genetic Algorithms
Genetic algorithms are well suited to hybridization. Problem division between components of the hybrid varies by problem type and by the mechanisms included in the hybrid. We propose a hybridization technique for combining genetic algorithms (GAs) and deterministic algorithms based on solution candidate partitioning. We conduct a set of experiments to evaluate several instances of this hybridiz...
متن کاملGraph Partitioning for Independent Sets
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations based on graph partitioning and local search algorithms. More precisely, we employ a state-of-the-art graph partitioner to derive operations that enable us to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Artificial Intelligence Tools
سال: 2001
ISSN: 0218-2130,1793-6349
DOI: 10.1142/s0218213001000490