Kitektro
Vol 1, No 1 (2016)

IMPLEMENTASI REPLACEMENT STRATEGY STEADY STATE DAN GENERATIONAL DALAM ALGORITMA BEREVOLUSI UNTUK PENYELESAIAN TSP

Munawir Munawir (Magister Teknik Elektro Program Pascasarjana Universitas Syiah Kuala)
Taufiq A. Gani (Magister Teknik Elektro Program Pascasarjana Universitas Syiah Kuala)
Yuwaldi Away (Magister Teknik Elektro Program Pascasarjana Universitas Syiah Kuala)



Article Info

Publish Date
10 May 2016

Abstract

Travelling salesman problem is the traveling salesman optimization problems in visiting the city and every town just skipped right one. TSP problem can be applied to various cases that are to optimize, in the completion of TSP there are several methods that can be used, including the algorithms evolve. To improve the quality of the solution, the method used is the strategy of steady state and generational turnover. This research analyzes the methods of steady state strategy and generational turnover for the completion of TSP. Test data used is the data tsplib as much as 10 datasets with the number of cities between 51 to 100 cities, resulting from this testing is the average distance from each dataset. Keywords -- Algorithm Evolved, TSP, Replacement Strategy, Steady State, generational

Copyrights © 2016






Journal Info

Abbrev

kitektro

Publisher

Subject

Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering

Description

KITEKTRO is an online journal (electronic) for Scientific Work of Computer Engineering/Science, Information Technology, and Electrical Engineering field. KITEKTRO has been published as dissemination media of research to public domain. KITEKTRO has been publishing articles since 2012 with e-ISSN: ...