Analisis Nilai Mutasi Dinamis Pada Algoritma Genetika

DAFTAR PUSTAKA

Haibo, Z., Liwen, C., Shenyong, G., Jianguo, C., Feng, Y., & Daqing, L. 2011.
Improvement of Genetic Algorithm to the Knapsack Problem. ICAIC. Part I:
202-206
Holland, J. H. 1975. Adaption in Natural and Artificial System: An Introductory
Analysis with Application to Biology, Control, and Artificial Intellegence,
University of Michigan Press, Ann Arbor, Mich: USA.
Hong, T.P., Wang, H.S., Lin, W.Y., & Lee, W.Y. 2009. Evolution of Appropriate
Crossover and Mutation Operators in a Genetic Process. Genetic and
Evolutionary Computation Conference, pp. 7 – 17.
Singh, R.P. 2011. Solving 0-1 Knapsack Problem Using Genetic Algorithm. IEEE 3rd
International Conference on Communication Software and Networks (ICCSN),
pp. 591 – 595.
Sivanandam, S.M., & Deepa, S.N. 2008. Introduction to Genetic Algorithm, Springer,
Berlin:Germany
Smith, J.E. 2002. Genetic Algorithm. In Horst, R. & Parlados, P. (Eds). Handbook of
Global Optimization Volume 2. pp. 275 – 362. Springer Science + Business
Media:Boston.
Suyanto. 2014. Artificial Intelligence: Searching, Reasoning, Planning dan Learning.
Informatika: Bandung.

Varnamkhasti, M.J, Lee, L.S, Bakar, M.R.A, & Leong, W.J. 2012. A Genetic
Algorithm with Fuzzy Crossover Operator and Probability. Advances in
Operations

Research

Volume

2012

(2012).

(Online)

http://dx.doi.org/10.1155/2012/956498
Zhu, K. Q. & Liu, Z. 2004. Population Diversity in Permutation – Based Genetic
Algorithm. Proceedings 15th European Conference on Machine Learning
(ECML), pp. 537 – 547.

Universitas Sumatera Utara