Algoritma Branch and Bound untuk Driver Assignment pada Aplikasi Simulasi Taksi Online

Arlynston Liadi, Andreas Handojo, Tanti Octavia

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.


Keywords


Branch and bound; google maps api; static; dynamic; online taxi

Full Text:

PDF

References


Çal, M., & Ekici, A. 2018. Solving a Modified TSP Problem by a Greedy Heuristic for Cost Minimization. International Journal of Modeling and Optimization, 8(3), 138–144. https://doi.org/10.7763/ijmo.2018.v8.638

Constantino, A. A., de Mendonça Neto, C. F. X., de Araujo, S. A., Landa-Silva, D., Calvi, R., & dos Santos, A. F. 2017. Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm. Journal of Universal Computer Science, 23(5), 479–504.

Costa, L. H. M., de Athayde Prata, B., Ramos, H. M., & de Castro, M. A. H. 2016. A Branch-and-Bound Algorithm for Optimal Pump Scheduling in Water Distribution Networks. Water Resources Management, 30(3), 1037–1052. https://doi.org/10.1007/s11269-015-1209-2

Ding, S., & Zeng, X. J. 2018. Uncertain random assignment problem. Applied Mathematical Modelling, 56, 96–104. https://doi.org/10.1016/j.apm.2017.11.026

Silalahi, S. L. B., Handayani, P. W., & Munajat, Q. 2017. Service Quality Analysis for Online Transportation Services: Case Study of GO-JEK. In Procedia Computer Science (Vol. 124, pp. 487–495). Elsevier B.V. https://doi.org/10.1016/j.procs.2017.12.181

Toumi, S., Jarboui, B., Eddaly, M., & Rebaï, A. 2017. Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion. In International Journal of Mathematics in Operational Research (Vol. 10, pp. 34–48). Inderscience Enterprises Ltd. https://doi.org/10.1504/IJMOR.2017.080743


Refbacks

  • There are currently no refbacks.


Jurnal telah terindeks oleh :