Search
Now showing items 1-10 of 11
Adaptive crossover in genetic algorithms using statistics mechanism
(MIT Press, 2002)
Genetic Algorithms (GAs) emulate the natural evolution process and maintain a population of potential solutions to a given problem. Through the population, GAs implicitly maintain the statistics about the search space. ...
A self-organizing random immigrants genetic algorithm for dynamic optimization problems
(Springer, 2007-09-01)
In this paper a genetic algorithm is proposed where the worst individual and individuals with indices close to its index are replaced in every generation by randomly generated individuals for dynamic optimization problems. ...
A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling.
(Springer Science & Business, 2011)
The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in suitable rooms according to the student ...
Statistics-based adaptive non-uniform crossover for genetic algorithms
(University of Birmingham, UK, 2002)
Through the population, genetic algorithm (GA) implicitly maintains the statistics about the search space. This implicit statistics can be used explicitly to enhance GA's performance. Inspired by this idea, a statistics-based ...
Constructing dynamic test environments for genetic algorithms based on problem difficulty
(IEEE Press, 2004)
In recent years the study of dynamic optimization problems has attracted an increasing interest from the community of genetic algorithms and researchers have developed a variety of approaches into genetic algorithms to ...
A hybrid genetic algorithm and inver over approach for the travelling salesman problem.
(IEEE., 2010)
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded local search scheme. Within the SBGA, a ...
Hyper-selection in dynamic environments.
(IEEE, 2008)
In recent years, several approaches have been developed for genetic algorithms to enhance their performance in dynamic environments. Among these approaches, one kind of methods is to adapt genetic operators in order for ...
Memory-based immigrants for genetic algorithms in dynamic environments
(ACM Press, 2005)
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent years. This trend reflects the fact that many ...
Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks.
(IEEE, 2009)
In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm optimization (PSO), ...
A hybrid immigrants scheme for genetic algorithms in dynamic environments
(Springer, 2007-07-01)
Dynamic optimization problems are a kind of optimization problems that involve changes over time. They pose a serious challenge to traditional optimization methods as well as conventional genetic algorithms since the goal ...
