Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/62488
Title: Rekayasa Perangkat Lunak Untuk Pemetaan Jalur Kabel Listrik Dengan Menggunakan Algoritma Genetika
Authors: Saiful Bukhori
Keywords: Non-deterministic Polynomial Time Complete, Traveling Salesman Problem, Genetic Algorithm, Efficient
Issue Date: 12-May-2015
Abstract: Electric cable line mapping as Non-deterministic Polynomial-time Complete (NPC) is difficult to solve using ordinary linier algorithm. In solving the problem there isn’t a node encounter twice and route must shortest one, so that it’s needed efficiently material. Depend on this problem in this research used Traveling Salesman Problem (TSP). The result showed that using genetic algorithm one of the methods that can be used to determine electric cable line that has high complexity, so give optimum electric cable design, and using time and cost efficient
URI: http://repository.unej.ac.id/handle/123456789/62488
Appears in Collections:Fakultas Ilmu Komputer

Files in This Item:
File Description SizeFormat 
cover.pdf2.26 MBAdobe PDFView/Open
redaksi.pdf513.66 kBAdobe PDFView/Open
DaftarIsi.pdf949.79 kBAdobe PDFView/Open
ISI.pdf6.03 MBAdobe PDFView/Open
Gematika.pdf9.74 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.