PENYELESAIAN TRAVELING SALESMAN PROBLEM MENGGUNAKAN ALGORITMA IMPROVED ANT COLONY OPTIMIZATION
PENYELESAIAN TRAVELING SALESMAN PROBLEM MENGGUNAKAN ALGORITMA IMPROVED ANT COLONY OPTIMIZATION DANIYA RIFA FADHILAH ABSTRAK Traveling Salesman Problem (TSP) adalah salah satu model permasalahan optimisasi untuk menentukan rute perjalanan dengan total jarak terpendek. TSP dapat diilustrasikan sebagai...
Saved in:
Main Author: | Daniya Rifa Fadhilah, - (Author) |
---|---|
Format: | Book |
Published: |
2019-08-29.
|
Subjects: | |
Online Access: | Link Metadata |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
PENYELESAIAN COLORED TRAVELING SALESMAN PROBLEM MENGGUNAKAN ALGORITMA GENETIKA HILL-CLIMBING
by: Fakhrana Nadhilah, -
Published: (2019) -
Traveling Salesman Problem
Published: (2008) -
Traveling Salesman Problem Theory and Applications
Published: (2010) -
Novel Trends in the Traveling Salesman Problem
Published: (2020) -
Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)
by: Muchammad Abrori, et al.
Published: (2015)