Rekayasa Perangkat Lunak Untuk Pemetaan Jalur Kabel Listrik Dengan Menggunakan Algoritma Genetika
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Academic Paper |
| Published: |
2015-05-12T14:03:06Z.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 01255 am a22001693u 4500 | ||
|---|---|---|---|
| 001 | repository_unej_123456789_62488 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Saiful Bukhori |e author |
| 245 | 0 | 0 | |a Rekayasa Perangkat Lunak Untuk Pemetaan Jalur Kabel Listrik Dengan Menggunakan Algoritma Genetika |
| 260 | |c 2015-05-12T14:03:06Z. | ||
| 500 | |a http://repository.unej.ac.id/handle/123456789/62488 | ||
| 520 | |a 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 | ||
| 520 | |a Universitas Jember | ||
| 690 | |a Non-deterministic Polynomial Time Complete, Traveling Salesman Problem, Genetic Algorithm, Efficient | ||
| 655 | 7 | |a Article |2 local | |
| 787 | 0 | |n http://repository.unej.ac.id/handle/123456789/62488 | |
| 856 | 4 | 1 | |u http://repository.unej.ac.id/handle/123456789/62488 |z Get Fulltext |