Mapping, order-independent genes and the knapsack problem
作者： R. Hinterding
关键词:
摘要: This paper uses the simple structure of knapsack problem to study issues mapping and representation for genetic algorithms. Two algorithms using different mappings were implemented solve problem. In one these, neither order nor position genes is significant. Both perform well on problem, we attribute divergent parameter settings mappings. >
vu.edu.au
sci-hub.se 参考文章(7)
L. Darrell Whitley, V. Scott Gordon, Serial and Parallel Genetic Algorithms as Function Optimizers international conference on genetic algorithms. pp. 177- 183 ,(1993)
E. Falkenauer, A. Delchambre, A genetic algorithm for bin packing and line balancing international conference on robotics and automation. pp. 1186- 1192 ,(1992) , 10.1109/ROBOT.1992.220088
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
V. Scott Gordon, A. P. Wim Böhm, Darrell Whitley, A note on the performance of genetic algorithms on zero-one knapsack problems acm symposium on applied computing. pp. 194- 195 ,(1994) , 10.1145/326619.326696
D. E. Goldberg, Genetic Algorithms in Search Optimization, and MachineLearning. pp. 192- 208 ,(1989)
Lawrence. Davis, Handbook of Genetic Algorithms ,(1991)
David E. Goldberg, Genetic algorithms in search, optimization and machine learning Reading: Addison-Wesley. ,(1989)