Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Jurnal Infra
Arlynston Liadi
Program Studi Informatika
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Algoritma Branch and Bound untuk Driver Assignment pada Aplikasi Simulasi Taksi Online Arlynston Liadi; Andreas Handojo; Tanti Octavia
Jurnal Infra Vol 8, No 1 (2020)
Publisher : Jurnal Infra

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Online taxi is one of the developments in technology that is currently being used by the wider community. Online taxis also have positive impacts such as drivers and passengers can know each other's location accurately, passengers can see drivers and vehicle information accurately, and passengers can easily find transportation to travel to other places. However, in reality requests from passengers appear randomly in different locations, so we need an application that can optimize the assignment between drivers and passengers..Applications are made with the python, html, and javascript programming languages, with django as a framework, bootstrap 3 for the front end menu, the Google maps API to get time and distance, as well as the front end in the online map section, and mySQL as the database used.The end result of this application is an assignment for drivers and passengers using a web-based branch and bound algorithm that can minimize pickup costs and waiting times by calculating the total combination of mileage, travel time, and the number of trip drivers on an online taxi.
Co-Authors Andreas Handojo Tanti Octavia