Irmeilyana, Irmeilyana and Indrawati, Indrawati and Utari, Amelia (2020) Timetable Creation of BRT Trans Musi by Using Branch and Bound Method. Journal of Computer Science and Computational Mathematics, 10 (3). pp. 41-47. ISSN eISSN: 2231-8879
Preview |
Text
Paper JCSCM-2020.pdf Download (384kB) | Preview |
Abstract
Timetable problem of public transportation is a problem in scheduling the optimal departure time to minimize the density of passengers. Timetable problem is an integer programming, so it can be solved by using Branch and Bound Method. This study used travel route of BRT Trans Musi Kota Palembang in July 2016 for Sako - Pasar Gubah route and vice versa. The secondary data used are the departure schedule, the number of buses operated, and also primary data of passengers and the time taken. Based on the calculation result of Branch and Bound Method, it can be concluded that the total minimum number of passengers jostled in both routes is 145 passengers with 10 buses operated in 2 hours. Based on the timetable obtained, in the first period the number of buses needed on Sako-Pasar Gubah route are 5 buses with headway for 12 minutes, whereas Pasar Gubah-Sako route needs 6 buses with 10 minutes. In the second period, Sako-Pasar Gubah route needs 6 buses with headway for 10 minutes, whereas Pasar Gubah-Sako route needs 5 buses with headway for 12 minutes. Keywords: timetable, travel route, headway, BRT trans musi, branch and bound method.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA1-43 General |
| Divisions: | 08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1) |
| Depositing User: | Mrs Irmeiliana Irmeiliana |
| Date Deposited: | 13 Dec 2020 16:11 |
| Last Modified: | 13 Dec 2020 16:11 |
| URI: | http://repository.unsri.ac.id/id/eprint/38436 |
Actions (login required)
 |
View Item |