<p><em>Bidirectional Search</em> dan <em>Held-Karp</em> merupakan salah satu metode pencarian jalur terdekat atau sering disebut dengan metode shortes path. <em>Bidirectional Search</em> mencari jalur terdekat dengan melakukan pencarian dwi arah, proses pertama dimulai dari <em>level</em> awal <em>graph matrix</em> menuju <em>level</em> selanjutnya dan proses kedua dimulai dari <em>level</em> akhir menuju <em>level</em> sebelumnya. Proses tersebut akan menghasilkan rute awal dan rute akhir, kemudian kedua rute tersebut dirangkai menjadi rute gabungan. Tidak seperti pada metode <em>Bidirectional Search</em>, pada metode <em>Held-Karp</em> hanya dilakukan satu proses pencarian, dan pada metode <em>Held-Karp</em> proses pencarian sudah memperhitungkan mengenai jarak yang ditempuh sampai dengan kembali ke titik awal. Pada penelitian ini metode <em>Bidirectional Search</em> dan <em>Held-Karp</em> <span style="text-decoration: underline;">akan</span> dikembangkan dalam bentuk program menggunakan bahasa pemrograman <em>visual basic</em>. Program tersebut diterapkan untuk menentukan jalur terbaik pada kasus pengiriman produk. <em>Bidirectional Search</em> juga akan dibandingkan dengan metode <em>Held-Karp</em>. Percobaan yang dilakukan pada beberapa data tes berupa paket pengiriman produk, didapatkan bahwa metode <em>Held-Karp</em> mendapatkan rata-rata hasil rute pengiriman yang lebih baik sekitar 5 % dibandingkan dengan metode <em>Bidirectional Search</em></p><p><em><br /></em></p><p><strong><em>Abstract </em></strong></p><p><em>Bidirectional Search and Held-Karp is one type of the shortes path methods. Bidirectional Search looks for the nearest path by doing a two way search, the first process starts from the initial level of the graph matrix to the next level and the second process starts from the end level to the previous level. The process will generate the initial route and the final route, then the two routes are assembled into a combined route. Bidirectional Search does not count the process of returning from the final destination to the starting point or appropriate for non circular paths.Unlike Bidirectional Search method, Held-Karp method only performs one way search process, and in the Held-Karp method the search process has calculated the distance traveled up to the return point or appropriate for circular paths. In this research, Bidirectional Search and Held-Karp method will be developed into desktop program using visual basic programming language. The program is implemented to determine the best path in case of product delivery. Bidirectional Search will also be compared to the Held-Karp method. Experiments performed on some tes data in the form of product delivery package, it is found that the Held-Karp method gets the average result of better delivery route about 5% compared to Bidirectional Search method.</em></p><p><em><br /></em></p>
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.