MUTASI DINAMIS PADA KASUS TRAVELLING SALESMAN PROBLEM (TSP) MENGGUNAKAN METODE KNAPSACK PROBLEM
Abstract
ABSTRACT
Knapsack Problem is very important to controlling how many node has crossed at Travelling Salesman Problems (TSP). Usually at TSP, all of the node will be explored to get the optimal rate at a generation. Apllying the knapack at least had two parameters to work well. In the research, knapsack had two parameters, that is total nodes and weights range. Optimation in TSP can do with calculation of weights range that has a same value one as one solution rate was specify. Total nodes influence how many coordinate point will be crossed. The optimal rate in the problem is technical dependent in mutation processing. A methode dynamic mutations intend to specify of mutation rate at each population. Situation a population of generation will be affect by result from genetic processing. This technical will approach to result it is solutions. By using this method, a genetic process will optimal.
Key words : Knapsack Problem, Travelling Salesman Problem, Optimation, Genetic Algoritm, Dynamic MutationReferences
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.