Aplikasi Hybrid Firefly Algorithm untuk Pemecahan Masalah Traveling Salesman: Studi Kasus pada PT Anugerah Mandiri Success

J. Sudirwan, Siti Nur Fadlilah, Teguh Teguh


Determining a good route is a major problem in a transport process in the company. This case study aims to overcome the problem of determining the route or often called the Traveling Salesman Problem (TSP) is optimal. This problem will be solved by the optimization method in determining the route, which is more systematic in PT Anugerah Mandiri Success. Metaheuristic methods, such as Hybrid Firefly Algorithm is used to assist the system in the process of determining the route. Hybrid Firefly Algorithm combines heuristic method of Nearest Neighbor Heuristic with metaheuristic method of Levy Flight Discrete Firefly Algorithm. The indicators used in this case study are the total distance traveled and total fuel used. Methods Object Oriented Analysis and
Design (OOAD) is used to develop an information system, which consists of determining system requirements, system architecture design, and design to the trials of the system were developed. The results of the constructed
system provide a solution in the form of route determination with a total distance of 165.1 kilometers with a fuel consumption of 11,793 liters. These results are much better when compared with historical data that has a total
distance of 260.8 kilometers with a fuel consumption of 18,628 liters.


determination of the route, mileage, Traveling Salesman Problem, Object Oriented Analysis and Design, Hybrid Firefly Algorithm

Full Text:



Gharan, S. O., Saberi, A., Singh, M. (2011). A Randomized Rounding Approach to the Traveling Salesman Problem. FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 550-559.

Jati, G. K., Suyanto. (2011). Evolutionary Discrete Firefly Algorithm for Travelling Salesman Problem. Adaptive and Intelligent Systems Second International Conference, ICAIS 2011, 393-403.

Kumbharana, S. N., Pandey, G. M. (2013). Solving Travelling Salesman Problem using Firefly Algorithm. International Journal for Research in Science & Advanced Technologies, 2(2), 53-57.

Marichelvam, M. K., Prabaharan, T., Yang, X. S. (2012). A Discrete Firefly Algorithm for the Multiobjective Hybrid Flowshop Scheduling Problems. IEEE Transcations on Evolutionary Computation TEVC-00124-2012, 3.

Naranjo-Gil, D. (2009). Management information systems and strategic performances: The role of top team composition. International Journal of Information Management, 29, 105.

Pimentel, F. G. (2011). Double-ended nearest and loneliest neighbour – a nearest neighbour heuristic variation for the traveling salesman problem. Revista de Ciencias da Computacao, 6, 17-30.

Rego, C., Gamboa, D., Glover, F., & Osterman, C. (2011). Traveling salesman problem heuristics: Leading methods, implementations and latest advances. European Journal of Operation Research, 211, 427-441.

Reinelt, G. (1994). The Traveling Salesman - Computational Solutions for TSP Applications. Heidelberg: Springer-Verlag.

Santosa, B., Willy, P. (2011). Metoda Metaheuristik Metoda dan Implementasi. Surabaya: Guna Widya.

Satzinger, J. W., Jackson, R. B., Burd, S. D. (2010). System Analysis and Design in a Changing World. Boston: Course Technology.

Sorensen, C. G., Fountas, S. (2010). Conceptual model of a future farm management information system. Computers and Electronics in Agriculture, 72, 38.

Tadei, R., Perboli, G., & Perfetti, F. (2013). The Multi-Path Traveling Salesman Problem with Stochastic Travel Costs. Cirrelt, 1, 1-12.

Yang, X.-S. (2009). Firefly Algorithms for Multimodal Optimization. Stochastic Algorithms: Foundations and Applications SAGA, 5792, 169-178.

Yang, X. S. (2010a). Engineering Optimization. New Jersey: John Wiley and Sons.

Yang, X.-S. (2010b). Firefly algorithm, Levy flights and global optimization. Research and Development in Intelligent Systems XXVI, 26, 209-218.

DOI: https://doi.org/10.21512/comtech.v5i2.2281


  • There are currently no refbacks.

Copyright (c)

Public Visitor Statistics:ComTech stats
Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.