Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Jurnal Serambi Engineering
Erdiwansyah Erdiwansyah
Teknik Informatika, Fakultas Teknik, Universitas Serambi Mekkah
Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Engineering Environmental Science

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Analisis Perbandingan Metode Local Search dan Population Based Dalam Algoritma Berevolusi untuk Penyelesaian Travelling Salesman Problem (TSP) Erdiwansyah Erdiwansyah
Jurnal Serambi Engineering Vol 1, No 1 (2016)
Publisher : Fakultas Teknik

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32672/jse.v1i1.307

Abstract

Traveling  Salesman  Problem (TSP) is an optimization problems that can be applied to a variety of activities such as distribution of goods, making burning electricity bills and scheduling. TSP optimization problem in a very famous and has become the standard to try algorithm komputational. Local search algorithm is a method of finding a solution based on the neighborhood of the initial solution. This method is known as iterative improvement. While a search algorithm Based Population global with out considering the surrounding solution. Results showed local search algorithm is better than algorithm-based population in the search for optimal value. However, population-based superior in diversity.
Co-Authors