2014
DOI: 10.21512/comtech.v5i2.2281
|View full text |Cite
|
Sign up to set email alerts
|

Aplikasi Hybrid Firefly Algorithm untuk Pemecahan Masalah Traveling Salesman: Studi Kasus pada PT Anugerah Mandiri Success

Abstract: Determining a good route is a major problem in a transport

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…then continue checking to the next node 3. The 6th index node in the population is 26, 4 to 26 has no distance, then continue checking to the next node node [1,2,3,4,5,25,17,26] 5th iteration (m-th index starts from k to finish) [1,2,3,4,5,25,17,26,15,19,6,14,27,9,20,21,8,16,22,13,18,23,10,12,24,11,7]…”
mentioning
confidence: 99%
“…then continue checking to the next node 3. The 6th index node in the population is 26, 4 to 26 has no distance, then continue checking to the next node node [1,2,3,4,5,25,17,26] 5th iteration (m-th index starts from k to finish) [1,2,3,4,5,25,17,26,15,19,6,14,27,9,20,21,8,16,22,13,18,23,10,12,24,11,7]…”
mentioning
confidence: 99%