Improving the genetic algorithm through new composing of migration and parent centric selection
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Since 1970, the successful solution of combinatorial optimization problems by genetic algorithms is frequently reported. This work is focused on random initial population,migration and female centric selection, characterizing parents for creating offsprings through two-point crossover methods. The resulting algorithm is performed on several standard multidimentional knapsack problemand satisfactory computational is resulted.
Abstract
Since 1970, the successful solution of combinatorial optimization problems by genetic algorithms is frequently reported. This work is focused on random initial population,migration and female centric selection, characterizing parents for creating offsprings through two-point crossover methods. The resulting algorithm is performed on several standard multidimentional knapsack problemand satisfactory computational is resulted.
참고문헌 (7)
- Asexual versus sexual reproduction in genetic algorithms, "Deslauriers, W.A", Carleton Univercity, ~ (2006)
- Kubota, N, "Genetic algorithms with age structure" (1997), Springer verlag
- Miller, G.F, "The role of mate choice in evolutionary computation: sexual selection as a process of search, optimization and diversification" (1998), Springer verlag
- Ochoa, G, "Dynamic problems and mate selection: The effect of assortative mating on genetic algorithms for dynamic problems" (2002), Santa fe summer school
- Ochoa, G, "Assortative mating in genetic algorithms for dynamic problems" (2005), Springer verlag
- Raghuwanshi, M.M, "Distributed Quasi steady-state genetic algorithm with niches and species", International journal of computational intelligence research (2007)
- Simoes, A, "An evolutionary approach to the zero", one knapsack problm, testing ideas from biology, 2001, ~