Simulasi online taxi`s dispatch system dengan metode combinatorial optimization

Vincent Christian Andoko, Andreas Handojo, Henry Novianus Palit


Taxis are an important part of people's lives today. Taxis function as one of the means of public transportation that plays a role in serving the community in reaching the desired destination and is easily found because taxi services are available in most cities throughout the world. Following the development of technology, online taxis emerged. Online taxis are a means of public transportation using web or mobile based applications to connect passengers with taxis. Online taxis make it easy for passengers and taxis to find out the destination via an online map with GPS or the name of the desired destination and display important factors such as distance and duration quickly.

Behind the features presented by online taxis, an optimal taxi dispatch method is needed. The road conditions in each area are different, for example traffic jams in the middle of the city are different from the traffic jams on the edge of the city. From these conditions it is not possible to use only one type of method for the taxi dispatch process in the entire area. By using simulations that have several methods, it can be determined which method is optimal for the area determined by giving an overview of the dispatch process by taxi along with the comparison of the results of the methods used in the simulation.

The final result of this program is a simulation that can run 3 types of algorithms to pair taxis and passengers based on 3 factors, namely the duration, distance, and total passengers that each taxi has served. This simulation can provide a comparison of the results of the three algorithms and the calculation of the factors used in the same scenario to make it easier for users to determine the algorithm and calculation`s formula for the appropriate factors in a particular region and time.


hungarian algorithm; first come first served; random; haversine formula; google maps api; static; dynamic; simulation

Full Text:



Ahmed, B. 2015. Test case minimization approach using fault detection and combinatorial optimization techniques for configuration-aware structural testing. Engineering Science and Technology, an International Journal. Manno, Switzerland : Elsevier B.V., pp. 737-753.

Google LLC. 2018. GoogleMaps Platform Documentation. Retrieved May 8, 2018 from

Grau, J., Estrada, M., Tzenos, P., & Aifandopoulou, P. 2018. Agent-based Simulation Framework For The Taxi Sector Modeling. 9th International Conference on Ambient Systems, Networks and Technologies, ANT-2018 and the 8th International Conference on Sustainable Energy Information Technology. Porto, Portugal : Elsevier B.V., pp. 294-301.

Ingole P., Nichat M. 2013. Landmark Based Shortest Path Detection by Using Dijkestra Algorithm and Haversine Formula. International Journal of Engineering Research and Applications (IJERA). Amravati, India : Raisoni College of Engineering and Management, pp. 162-165.

Pi-xu, Z., Hang-yu, W., Zhang-song, Z., Wen-kai, X., and Zhong-hong, W. 2011. Plot Association for Multi-sensor Based on Hungary Algorithm. 2011 International Conference on Advances in Engineering. Wu Han,China : Elsevier Ltd., pp. 17-21.

Prokofyeva, N., & Boltunova, V. 2016. Analysis and Practical Application of PHP Frameworks in Development of Web Information Systems. Latvia : Elsevier B.V., pp. 52.

The PHP Development Team. (2018). mt_rand Documentation. Retrieved May 10, 2018 from

Xoxa, N., Zotaj, M., Tafa, I., Fejazj, J. 2014. Simulation of First Come First Served (FCFS) and Shortest Job First (SJF) Algorithms. Tirana, Albania : IJCSN - International Journal of Computer Science and Network, Volume 3, Issue 6, December 2014, pp. 444-449.

Zend Technologies. 2018. Zend Engine Explained. Retrieved May 5, 2018 from


  • There are currently no refbacks.

Jurnal telah terindeks oleh :