GENERATIONAL MODEL GENETIC ALGORITHM FOR REAL WORLD SET PARTITIONING PROBLEMS
نویسندگان
چکیده
منابع مشابه
Genetic algorithm-based feature set partitioning for classification problems
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a single useful subset of features. This paper presents a novel feature set partitioning approach that is based on a genetic algorithm. As part of this new approach a new encoding schema is also proposed and its properti...
متن کاملA Genetic Algorithm for the Set Partitioning
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem. The set partitioning problem is an important combinatorial optimisation problem used by many airlines as a mathematical model for ight crew scheduling. We develop a steady-state genetic algorithm in conjunction with a specialised heuristic feasibility operator for solving the set partitioning ...
متن کاملAn Order Based Memetic Evolutionary Algorithm for Set Partitioning Problems
Metaheuristic algorithms, such as simulated annealing, tabu search and evolutionary algorithms, are popular techniques for solving optimization problems when exact methods are not practical. For example, the run times required to obtain exact solutions to many common combinatorial problems grow exponentially (or worse) with the problem size, and as a result, solving even a relatively modest siz...
متن کاملA Parallel Genetic Algorithm for the Set Partitioning Problem
In this dissertation we report on our e orts to develop a parallel genetic algorithm and apply it to the solution of the set partitioning problem|a di cult combinatorial optimization problem used by many airlines as a mathematical model for ight crew scheduling. We developed a distributed steady-state genetic algorithm in conjunction with a specialized local search heuristic for solving the set...
متن کاملApplying Genetic Algorithms to Real - World Problems
This paper outlines what the author perceives as crucial ingredients of a successful application of Genetic Algorithms (gas) to real-world combinatorial problems. First, the importance of the Schema Theorem is stressed, pointing to crossover as the most potent force in a ga. Second, the importance of an encoding and operators adapted to the problem being solved is demonstrated, with two implica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronic Commerce Studies
سال: 2013
ISSN: 2073-9729
DOI: 10.7903/ijecs.1138