PENGGUNAAN METODE SIMULATED ANNEALING UNTUK PENYELESAIAN TRAVELLING SALESMAN PROBLEM
Abstrak— Travelling Salesman Problem (TSP) merupakan salah satu cara yang digunakan untuk mendapat rute atau jalur yang terpendek oleh seorang sales. Penggunaan TSP dilakukan dengan cara mengunjungi semua lokasi secara berurutan hanya sekali dan kembali lagi ke lokasi awal. Metode simulated annealin...
Saved in:
Main Authors: | Rahmi Hidayati, Irwan Guntoro, Suci Junianti |
---|---|
Format: | article |
Language: | ID |
Published: |
Universitas Negeri Medan
2019
|
Subjects: | |
Online Access: | https://doaj.org/article/316831bd0d104cf09d17d91373f95bc9 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Complexity indices for the traveling salesman problem continued
by: Cvetković Dragoš, et al.
Published: (2021) -
Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
by: Siddharth Jain
Published: (2021) -
OPTIMIZATION OF DOUBLY REINFORCED BEAM DESIGN USING SIMULATED ANNEALING
by: SIMON OLAYIWOLA ADEREMI OLAWALE, et al.
Published: (2020) -
OPTIMIZATION OF SINGLY REINFORCED BEAM DESIGN USING SIMULATED ANNEALING
by: SIMON OLAYIWOLA ADEREMI OLAWALE, et al.
Published: (2021) -
A unified matheuristic for solving multi-constrained traveling salesman problems with profits
by: Rahma Lahyani, et al.
Published: (2017)