Pemanfaatan Algoritma Generate and Test Dalam Kasus Travelling Salesman Problem Pencarian Jalur Terpendek
The Generate and Tesr algorithm is a very simple method in a heuristic search. The completion process of this algorithm is a combination of depth-first search with backtracking because the solution must be generated completely before testing. systematically and following procedures will find a solut...
Saved in:
| Published in | Jurnal Sistem Komputer dan Informatika (JSON) Vol. 3; no. 2; p. 128 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
31.12.2021
|
| Online Access | Get full text |
| ISSN | 2685-998X 2685-998X |
| DOI | 10.30865/json.v3i2.3617 |
Cover
| Abstract | The Generate and Tesr algorithm is a very simple method in a heuristic search. The completion process of this algorithm is a combination of depth-first search with backtracking because the solution must be generated completely before testing. systematically and following procedures will find a solution. The problem in this study is that if the problem discussed in the Generate test algorithm is very broad, it takes a long time to solve it. The main purpose of this study is to find the shortest alternative route to find a solution in order to obtain the smallest route so as to save transportation costs. The final result of this study obtained 8 paths to the final destination, 2 paths that have the shortest route, namely the A-C-F-I-T and A-C-E-G-T routes. So that the tests carried out can pass through 2 paths to be able to visit the city. |
|---|---|
| AbstractList | The Generate and Tesr algorithm is a very simple method in a heuristic search. The completion process of this algorithm is a combination of depth-first search with backtracking because the solution must be generated completely before testing. systematically and following procedures will find a solution. The problem in this study is that if the problem discussed in the Generate test algorithm is very broad, it takes a long time to solve it. The main purpose of this study is to find the shortest alternative route to find a solution in order to obtain the smallest route so as to save transportation costs. The final result of this study obtained 8 paths to the final destination, 2 paths that have the shortest route, namely the A-C-F-I-T and A-C-E-G-T routes. So that the tests carried out can pass through 2 paths to be able to visit the city. |
| Author | Maulana, Algifanri |
| Author_xml | – sequence: 1 givenname: Algifanri surname: Maulana fullname: Maulana, Algifanri |
| BookMark | eNqFkD1PwzAURS1UJErpzOo_kNZJHMceqwLloxKVyMAWvTgvlcFxKjst6r8npQxsTO_qSudK71yTkescEnIbs1nKpMjmH6Fzs0Nqklkq4vyCjBMhs0gp-T76k6_INARTMc5zrqQUY2I22IJrAHpwdGG3nTd9C3SFDj30SMHVtMDQ0zuw0NIXCPtACw8HtNa4LX0Di2FYoBvfVRZbukGnwZuheQa79wPsd-hq_Lwhlw3YgNPfOyHFw32xfIzWr6un5WIdaRnnUZYkmVIsESmyRlaC61pCXcdcVjlqzmuuxfCx5DHPBOpEqaGXrMplJpoMknRC2Hl273Zw_AJry503LfhjGbPyR1Z5klWeZJUnWQMyPyPadyF4bP4lvgHKonF4 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION ADTOC UNPAY |
| DOI | 10.30865/json.v3i2.3617 |
| DatabaseName | CrossRef Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| EISSN | 2685-998X |
| ExternalDocumentID | 10.30865/json.v3i2.3617 10_30865_json_v3i2_3617 |
| GroupedDBID | AAYXX CITATION M~E ADTOC UNPAY |
| ID | FETCH-LOGICAL-c817-5225990263e0f8b64cd8add148b7ec44d4c6308841456ec299b7e80b7856f5a23 |
| IEDL.DBID | UNPAY |
| ISSN | 2685-998X |
| IngestDate | Tue Aug 19 16:36:53 EDT 2025 Tue Jul 01 02:38:09 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Issue | 2 |
| Language | English |
| License | http://creativecommons.org/licenses/by/4.0 cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c817-5225990263e0f8b64cd8add148b7ec44d4c6308841456ec299b7e80b7856f5a23 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://ejurnal.stmik-budidarma.ac.id/index.php/JSON/article/download/3617/2341 |
| ParticipantIDs | unpaywall_primary_10_30865_json_v3i2_3617 crossref_primary_10_30865_json_v3i2_3617 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2021-12-31 |
| PublicationDateYYYYMMDD | 2021-12-31 |
| PublicationDate_xml | – month: 12 year: 2021 text: 2021-12-31 day: 31 |
| PublicationDecade | 2020 |
| PublicationTitle | Jurnal Sistem Komputer dan Informatika (JSON) |
| PublicationYear | 2021 |
| SSID | ssib044749886 |
| Score | 1.783882 |
| Snippet | The Generate and Tesr algorithm is a very simple method in a heuristic search. The completion process of this algorithm is a combination of depth-first search... |
| SourceID | unpaywall crossref |
| SourceType | Open Access Repository Index Database |
| StartPage | 128 |
| Title | Pemanfaatan Algoritma Generate and Test Dalam Kasus Travelling Salesman Problem Pencarian Jalur Terpendek |
| URI | https://ejurnal.stmik-budidarma.ac.id/index.php/JSON/article/download/3617/2341 |
| UnpaywallVersion | publishedVersion |
| Volume | 3 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2685-998X dateEnd: 99991231 omitProxy: true ssIdentifier: ssib044749886 issn: 2685-998X databaseCode: M~E dateStart: 20190101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PT8IwFG4QDp78ETVilPTgQQ9jsLZbORKFEAw_EiDB09J1nZmMQcYWowf_dl83MOrFmHhtXpvuvbbf95b2ewhdOy1LBipgRlOywKABbCnOZctwOFFNTRgU14-TB0O7N6P9OZuX0Gj3FkY95x6sb9JluDC8zA99_WtXDw7ByRUEtWyE2Z-MhubWuaavdeVXwjcJ4LFpEf2QvWIzIOdlVJkNx-1HXWLO5syA5GJeCPwQ4PLMfM5v7JDQquuu37BpP4vX4vVFRNEXwOkeovVuqsU9k0U9S726fPuh4viP33KEDrbkFLcLo2NUUvEJCsdqKeJACKCRuB09rZIwXQpc6FWnCovYx1PAFnwvYHXhB7HJNniqqxrlct94AhC0gRHwuKhdg8ewMSBDh5a-iLIEOid5Id7FKZp2O9O7nrEt0GBIDuAG1I0BmFk2UY2AezaVPofjEhIsz1GSUp9KG9zMaRNYmpIAfNDOG57DmR0wYZEzVI5XsTpHGPpRJokvnBYYe0RYTDrc9iiDA1koWkU3u8i460KGw4X0JQ-iq4Po6iC62mdVdPsZud9sL_5ge4nKaZKpK-AgqVdDe4P3Tm27uj4AZn7j-g |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFA5jO3jyBypOVHLwoIe2W5O02XGoY0zcCttgnkqapNL96MbWIvrX-9Juol5E8BpeQvpeku97JfkeQtd-y5WxjpnVlCy2aAxbinPZsnxOdNMQBs3N4-Snvtcd096ETSposHsLo6eFB-1NtkhmVpSrRJlfu2ZwCE6hIGhkI5zecNB3ts51lNGVXwrlEMBjxyXmIXvNY0DOq6g27gftZ1NizuPMguRiUgr8EODyzJkWN3ZI4tqm6zds2svTlXh7FfP5F8DpHKDVbqrlPZOZnWeRLd9_qDj-47ccov0tOcXt0ugIVXR6jJJAL0QaCwE0ErfnL8t1ki0ELvWqM41FqvAIsAXfC1hd-FFs8g0emapGhdw3HgIEbWAEHJS1a3AAGwMydGjpiXm-hs7rohDv7ASNOg-ju661LdBgSQ7gBtSNAZi5HtGNmEcelYrDcQkJVuRrSami0gM3c9oElqYlAB-080bkc-bFTLjkFFXTZarPEIZ-lEmihN8C44gIl0mfexFlcCALTevoZheZcFXKcISQvhRBDE0QQxPE0Pisjm4_I_eb7fkfbC9QNVvn-hI4SBZdbdfVBxMt4sk |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Pemanfaatan+Algoritma+Generate+and+Test+Dalam+Kasus+Travelling+Salesman+Problem+Pencarian+Jalur+Terpendek&rft.jtitle=Jurnal+Sistem+Komputer+dan+Informatika+%28JSON%29&rft.au=Maulana%2C+Algifanri&rft.date=2021-12-31&rft.issn=2685-998X&rft.eissn=2685-998X&rft.volume=3&rft.issue=2&rft.spage=128&rft_id=info:doi/10.30865%2Fjson.v3i2.3617&rft.externalDBID=n%2Fa&rft.externalDocID=10_30865_json_v3i2_3617 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2685-998X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2685-998X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2685-998X&client=summon |