Sciweavers

196 search results - page 6 / 40
» Assortative Mating in Genetic Algorithms for Dynamic Problem...
Sort
View
ICANNGA
2007
Springer
138views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Liquid State Genetic Programming
Abstract. A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing...
Mihai Oltean
EVOW
2006
Springer
13 years 11 months ago
Associative Memory Scheme for Genetic Algorithms in Dynamic Environments
In recent years dynamic optimization problems have attracted a growing interest from the community of genetic algorithms with several approaches developed to address these problems...
Shengxiang Yang
ISCC
2006
IEEE
188views Communications» more  ISCC 2006»
14 years 1 months ago
Dejong Function Optimization by Means of a Parallel Approach to Fuzzified Genetic Algorithm
Genetic Algorithms are very powerful search methods that are used in different optimization problems. Parallel versions of genetic algorithms are easily implemented and usually in...
Ebrahim Bagheri, Hossein Deldari
ICTAI
2003
IEEE
14 years 1 months ago
A Diversity-Controlling Adaptive Genetic Algorithm for the Vehicle Routing Problem with Time Windows
This paper presents an adaptive genetic algorithm (GA) to solve the Vehicle Routing Problem with Time Windows (VRPTW) to near optimal solutions. The algorithm employs a unique dec...
Kenny Qili Zhu
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 11 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom