INISIALISASI POPULASI PADA ALGORITMA GENETIKA MENGGUNAKAN SIMPLE HILL CLIMBING (SHC) UNTUK TRAVELING SALESMAN PROBLEM (TSP)
Isi Artikel Utama
Abstrak
In classical genetic algorithm, the determination of the initial individu generated by random methods. In the study using a large individu, these methods often cause undesirable effects such as premature convergence in finding the optimal solution. In this study, algorithm Simple Hill Climbing (SHC) as the algorithm locally optimal analyzed its application to improve the performance of the genetic algorithm in order to avoid the genetic algorithm to the problem of convergence premature so expect to achieve optimal solutions in solving the Traveling Salesman Problem (TSP), In this research, three types of experiments by applying different parameters of Genetic Algorithm.In the first experiment, initial values obtained for the solution is 3596.6, Genetic Algorithm In the second experimental values obtained initial solution to SHC at 3494.1, and the best SHC for the best solution Genetic Algorithm In the third experiment obtained the initial value of 3330.9
Rincian Artikel
Referensi
Aawar, H.E. & Bakri, H. 2014. A simulated motion planning algorithm in 2d and 3d environment using hill climbing. International Journal of Artificial intelligence and aplications. 5(1) : 35-53.
Deb, K., Prapta, A., Agarwal, S. & Meyarivan, T. 2005. A fast and elitist multiobjetive genetic algorithm: NSGA-II. IEEE-Evolutionary computation. 6(2) : 123-143.
Ebrahimzadeh, R. 2013. Chaotic genetic algorithm based on lorenz chaotic system for optimization problems. International Journal Intelligent Systems and Applications, 13 (05) : 19-24
Goldberg, D.E. & Richardson, J. (1987) Genetic algorithms with sharing for multimodal function optimization, Proceedings of the Second International Conference on Genetic algorithms and their application : pp. 41 -49.
Hill, K. 1999. Canonical genetic algorithm to optimize cut order plan solutionsinapparel manufacturing. Canadian Institute of Actuaries : Canada
Kühn, M., Severin, T. & Salzwedel, H. 2013. Variable mutation rate at genetic algorithms: introduction of chromosome fitness in connection with multi-chromosome representation. International Journal of Computer Applications 72(17) : 0975 – 8887
Kumar, R. 2012. Novel encoding scheme in genetic algorithms.for better fitness. International Journal of Engineering and Advanced Technology (IJEAT). 1(6) : 2249 – 8958.
Kochra, S. & Joshi, S. 2012. Study on hill climbing algorithm for image segmentation International Journal of Engineering research and aplication. 2(3) : 2171-2174
Kuczapski, A., M., Micea, M., V. & Maniu., A., L. Efficient generation of optimal initial population to enhance genetic algorithm for job-shop scheduling. Journal of information technology and control. 39(1) : 32-38
Kumar.V, Dutta, D., Roy, R. & Choudhury, K. 2013. An overview of methods maintaining diversity in genetic algorithms. International Journal of Advanced Research in Computer Science and Software Engineering. 3(3) : 430- 434.
Lim, A., Lim, J., Rodrigues, B. & Xiao, F. 2006. Ant colony optimization with hill climbing for the bandwidth minimization problem. Journal of applied soft computing. 304(4) : 1-7
Malhotra, R., Singh, N. & Singh.Y. 2011. Genetic algorithms concepts, design for optimization of process controllers. Journal of Computer and Information Science. 4( 2 ): 39-5