Algoritma Goal Programming untuk Driver Assignmentpada Simulasi Taksi Online
Keywords:
Virtual Walkthrough, daring, Mahasiswa baruAbstract
Taxi is one of the most common means of public transportation. Assignment of drivers to passengers in online taxi can be done by of ering passenger orders to all drivers closest to the pick-up location. This method has high time ef iciency. However, this causes an increase in the cancellation rate because drivers don't have enough time to view order details, just as long as they accept orders. This can lead to a decrease in the level of passenger satisfaction and online taxi revenue. Therefore, other factors such as driver rating, driver order cancellation rate, number of orderscompleted by drivers are important to consider in the assignment process to produce an ef icient assignment. The process of assigning drivers and passengers will be carriedout using the Goal Programming method because this methodissuitable for problems in decision making that involve morethanone goal (multi-objectives). The results showed that Goal Programming resultedinthehighest total calculation time. In addition, the average waitingtime for passengers and pick-up distance are the lowest. TheHungarian Algorithm method has a faster calculationtimecompared to the Goal Programming method, however, thenumber of assignment is lower. In addition, the average waitingtime for passengers and their pick-up distances is higher. TheRandom Assignment method has the fastest calculation timeandthe highest assignment success rate. However, the averagewaiting time for passengers and the distance to pick themupisfarabove the two comparison methods. The addition of factors otherthan time and pick-up distance in a low percentage can af ect theaverage value of these factors for the better. But, the averagepick-up time and distance is increasing.References
[1] Chowdary, B. V., & Jannes, S. 2002. Production planning
under dynamic product environment: a multi-objective goal
programming approach. The Annual Research Report.
[2] Connor, A.M. & Shea, K. 2000. A comparison of semi- deterministic and stochastic search techniques. I.C. Parmee[Ed.] Evolutionary Design & Manufacture (Selected Papersfrom ACDM’00), 287-298. Springer-Verlag: London.
[3] Eryn. 2020. Perbandingan metode Tabu Search dan metodeHungarian Algorithm untuk penentuan Driver Assignment
pada simulasi taksi online. URI=https://dewey.petra.ac.id/catalog/digital/detail?id=46347
[4] Hassan, N. 2016. A Preemptive Goal Programming for Allocating Students into Academic Departments of a Faculty. International Journal of Mathematical Models and MethodApplied Sciences, 10, 166-170.
[5] Jiang, et al. 2020. A Mutual Selection Mechanismof Ride- Hailing Based on Hidden Points, Wireless Communicationsand Mobile Computing, vol. 2020. DOI=https://doi.org/10.1155/2020/9520384.
[6] Kuhn, H. W. 1955. The Hungarian method for the
assignment problem. Naval Research Logistics Quarterly, 2(1-2), 83–97. DOI:10.1002/nav.3800020109.
[7] Liadi. 2020. Algoritma branch and bound untuk driver assignment pada aplikasi simulasi taksi online. URI=https://dewey.petra.ac.id/catalog/digital/detail?id=46372.
[8] Liang, F. 2020. Optimization Techniques —Tabu Search. Towardsdatascience. URI=https://towardsdatascience.com/optimizationtechniques-tabu-search-36f197ef8e25
[9] Python. (n.d.). random — Generate pseudo-randomnumbers. URI=https://docs.python.org/3/library/random.html.
[10] Singh, S., Dubey, G. C., & Shrivastava, R. 2012. Avariousmethod to solve the optimality for the transportation problem. International Journal of Mathematical Engineering andScience, 1(4), 21-28.
[11] Spliet, R., & Dekker, R. 2016. The driver assignment vehiclerouting problem. Networks, 68(3), 212–223. DOI:10.1002/net.21694.
[12] Spronk J. 1981. International Series in Management
Science/Operations Research book series. Springer, Dordrecht. DOI=https://doi.org/10.1007/978-94-009-8165- 2_4
[13] Zhang, et al. 2017. A Taxi Order Dispatch Model basedOnCombinatorial Optimization. In Proceedings of the 23rdACM SIGKDD International Conference on KnowledgeDiscovery and Data Mining (pp. 2151-2159). KDD17. DOI:10.1145/3097983.3098138.
