Bangun, Putra Bahtera Jaya and Octarina, Sisca and Purba, Bran Valbert (2015) PENYELESAIAN TRAVELLING SALESMAN PROBLEM (TSP) DENGAN METODE BRANCH AND BOUND (Aplikasi Permasalahan Pengangkutan Barang Kantor Pos Palembang). In: Seminar Nasional Bidang Ilmu MIPA SEMIRATA 2015, 5-7 Mei 2015, Universitas Tanjungpura Pontianak.
Preview |
Text
Semirata 2015.pdf Download (989kB) | Preview |
Abstract
This study aims to applied the Branch and Bound method in solving Travelling Salesman Problem for determining the route of good transportation at Post Office in Palembang. The objective function is finding the shortest route from examiner post office to each branch post office and back to the examiner post office. Each branch post office can be passed just only once. The solutions are binary integer where 0 indicates the unoptimum solution and 1 indicates the optimum solution. The results are 2 routes, where the total of shortest distance for A region and B region is 24,3 km and 27,5 km, respectively.
| Item Type: | Conference or Workshop Item (Lecture) |
|---|---|
| Uncontrolled Keywords: | Travelling Salesman Problem, Branch and Bound, Biner |
| Subjects: | Q Science > QA Mathematics > QA1-939 Mathematics > QA37.3.1.64 Applied Mathematics |
| Divisions: | 08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1) |
| Depositing User: | Putra Bahtera Jaya Bangun |
| Date Deposited: | 08 Sep 2022 00:27 |
| Last Modified: | 08 Sep 2022 00:27 |
| URI: | http://repository.unsri.ac.id/id/eprint/74751 |
Actions (login required)
 |
View Item |