Determination of Optimal Public Transportation Routes Using Firefly and Tabu Search Algorithms

  • Salwa Salsabila Mansur Telkom University
  • Sri Widowati Universitas Telkom
  • Mahmud Imrona Telkom University
Keywords: Kata kunci: algoritma firefly, tabu search, rute, angkutan umum, optimasi


Traffic congestion problems generally caused by the increasing use of private vehicles and public transportations. In order to overcome the situation, the optimization of public transportation’s route is required particularly the urban transportation. In this research, the performance analysis of Firefly and Tabu Search algorithm is conducted to optimize eleven public transportation’s routes in Bandung. This optimization aims to increase the dispersion of public transportation’s route by expanding the scope of route that are crossed by public transportation so that it can reach the entire Bandung city and increase the driver’s income by providing the passengers easier access to public transportations in order to get to their destinations. The optimal route is represented by the route with most roads and highest number of incomes. In this research, the comparison results between the reference route and the public transportation’s optimized route increasing the dispersion of public transportation’s route to 60,58% and increasing the driver’s income to 20,03%.


Download data is not yet available.


Prasetiyowati, S. S., Sibaroni, Y., & Prabangkara, D. (2018). The Prediction of Optimal Route of City Transportation Based on Passenger Occupancy using Genetic Algorithm: A Case Study in The City of Bandung. Telkomnika, 16(3).

Yogaswara, Y., & Fatin, F. F. (2020). Tabu Search for Route Determination and Scheduling Waste Transportation Bandung City West Bandung Region (Case Study: PD. Kebersihan Kota Bandung). E&ES, 448(1), 012125.

L. Samudra and I. Mukhlash. Penentuan Rute Optimal Pada Kegiatan Penjemputan Penumpang Travel Menggunakan Ant Colony System. J. SAINS DAN SENI POMITS. 2013; 2(1): 1–6

X. Luo, J. Tu, and L. Huang. Optimization of Express Delivery Routing Problem. TELKOMNIKA (Telecommunication Computing Electronics and Control). 2016; 14(3A): 380-388.

Setiawan, M. H., Imrona, M., & Murdiansyah, D. T., 2017. Optimasi Rute Angkutan Kota Secara Simultan Menggunakan Algoritma Exhaustive Search (Studi Kasus Sepuluh Trayek Kota Bandung). Indonesia Journal on Computing (Indo-JC), 2(2), pp.47-54

Setiawan, A., Andriyanto, F., Putro, L. S., Prakisya, N. P. T., & Perdana, U., (2012). Perbandingan Algoritma Ant Colony Optimization, Disjktra, Tabu Search, Multiple Ant Colony System untuk Vehicle Routing Problem dengan Time Window. Surakarta.

Rahmat, B., Tjandrarini, A. B., & Budianto, D., 2011. Perbandingan Genetic Algorithm, Multiple Ant Colony System, dan Tabu Search untuk Penyelesaian Vehicle Routing Problem With Time Windows (VRPTW). Jawa Timur.

Altabeeb, A. M., Mohsen, A. M., & Ghallab, A. (2019). An improved hybrid firefly algorithm for capacitated vehicle routing problem. Applied Soft Computing, 84, 105728.

Yang, X. S., 2010. Nature-Inspired Metaheuristic Algorithm. 2nd ed. Bristol, U.K.: Luni1ver.

Wang, X., Peng, H., Deng, C., Li, L., & Zheng, L., 2019. An Improved Firefly Algorithm Hybrid with Fireworks. In Computational Intelligence and Intelligent Systems: 10th International Symposium, ISICA 2018, Jiujiang, China, October 13-14, 2018, Revised Selected Papers (Vol. 986, p. 27). Springer.

Lou, A., 2019. A Fusion Algorithm of Gravitational Search and Tabu Search. In Proceedings of the 2019 International Conference on Artificial Intelligence and Computer Science (pp. 150-157). ACM.

P.K. Bandung., 2008. SK Trayek MPU Kota Bandung. Pemerintah Kota Bandung: Bandung.

Raharjanto, A. A., Imrona, M., & Rohmawati, A.A., 2017. Analisis Prediksi Okupansi Penumpang Angkutan Kota Dengan Menggunakan Metode Indikator Kriging. Bandung.

Chandrawati, T. B., & Sari, R. F. (2018, October). A review of firefly algorithms for path planning, vehicle routing and traveling salesman problems. In 2018 2nd International Conference on Electrical Engineering and Informatics (ICon EEI) (pp. 30-35). IEEE.

Khan, M. U. R., & Asadujjaman, M. (2016). A Tabu Search Approximation for finding the Shortest distance using Traveling Salesman Problem. IOSR J. Math., 12(05), 80-84.

Marappan, R., & Sethumadhavan, G. (2018). Solution to graph coloring using genetic and tabu search procedures. Arabian Journal for Science and Engineering, 43(2), 525-542.

Li, X., & Gao, L. (2016). An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. International Journal of Production Economics, 174, 93-110.

Glover, E. 1977. Heuristics for integer programming using surrogate constraints.

Glover, E. 1989. Tabu search--part I. ORSA Journal of Computing, 1989, 1, 3 190-2

How to Cite
Mansur, S. S., Sri Widowati, & Mahmud Imrona. (2020). Determination of Optimal Public Transportation Routes Using Firefly and Tabu Search Algorithms. Jurnal RESTI (Rekayasa Sistem Dan Teknologi Informasi), 4(5), 884-891.
Artikel Teknologi Informasi