Penerapan Algoritma Kunang-Kunang pada Open Vehicle Routing Problem (OVRP)

Ihda Septiyafi, Herry Suprajitno, Asri Bekti Pratiwi

Abstract


This paper aims to solve Open Vehicle Routing Problem using Firefly Algorithm. Open Vehicle Routing Problem (OVRP) is a variant of Vehicle Routing Problem (VRP)  where vehicles used to serve customers do not return to the depot after serving the last customer on each route. The steps of the Firefly Algorithm to handle OVRP are data input and initialization parameters, generating the initial population for each firefly, sorting population sources, calculating the value of the objective function and light intensity, comparing the intensity of light, performing movement, setting the best fireflies as g-best, doing random movement in the best fireflies as long as the maximum number of iterations has not been met. The program used to complete OVRP using the Firefly Algorithm is Borland C ++ and implemented in 3 case examples, namely small data with 18 customers, moderate data with 50 customers, and large data with 100 customers with the best total mileage of 211, 344 , 970.62, and 2531.83. The results obtained from the program output indicate that the more the number of iterations and the number of fireflies, then the results of the objective function (total mileage) obtained tend to be better so that these parameters affect the value of the objective function. While the absorption coefficient value (g) does not give effect to the value of the objective function.

Keywords


Vehicle Routing Problem (VRP), Open Vehicle Routing Problem (OVRP), Firefly Algorithm (FA).

Full Text:

PDF

References


Siswanto, Arie. 2002. Hukum Persaingan Usaha. Bogor: Ghalia Indonesia.

Li, F., Golden, B., dan Wasil, E. 2007. The Open Vehicle Routing Problem: Algorithms, Large-Scale Test Problems, and Computational Results. Journal of Computers & Operations Research 34: 2918-2930.

Mirhassani, S.A. dan Abolghasemi, N. 2011. A Particle Swarm Optimization Algorithm for Open Vehicle Routing Problem. Journal of Expert Systems with Applications 38: 11547-11551.

Aksen, D., Ozyurt, Z., dan Aras, N. 2007. Open Vehicle Routing Problem with Driver Nodes with Time Deadlines. Journal of The Operational Research Society, Vol. 58 (9): 1223-1234.

Hosseinabadi, A. A. R., Vahidi, J., dan Balas, V. E. 2018. OVRP_GELS: Solving Open Vehicle Routing Problem using The Gravitational Emulation Local Search Algorithm. Journal of Neural Comput & Applic 29: 955-968.

Brandao, J. 2004. A Tabu Search Algorithm for The Open Vehicle Routing Problem. European Journal of Operational Research 157: 552-564.

Gurpreetsingh, Er. dan Dhir, Dr. Vijay. 2014. Open Vehicle RoutingProblem by Ant Colony Optimization. International Journal of Advanced Computer Science and Applications (IJACSA), Vol. 5, No. 3.

Sariklis, D. dan Powell, S. 2000. A Heuristic Method for Open Vehicle Routing Problem. The Journal of the Operational Research Society, Vol. 51, No. 5: 564-573.

Yu, Sh., Ding, Ch., dan Zhu, K. 2011. A Hybrid GA-TS Algorithm for Open Vehicle Routing Optimization of Coal Mines Material. Journal of Expert Systems with Applications 38: 10568-10573.

Yousefi, K. M., Didaver, F., Rahmati, F., dan Sedighpour, M. 2012. An Effective Imperialist Competitive Algorithm for Solving The Open Vehicle Routing Problem. Journal of Transportation Research, Vol. 9, No. 1 (30): 83-95.

Yang, X. S. 2009. Firefly Algorithm for Multimodal Optimization, in Stochastic Algorithms: Foundations and Application, Vol. 5792: 169-178.

Sayadi, M. K., Ramezanian, R., dan Ghafari-Nasab, Nader. 2010. A Discrete Firefly Meta-Heuristic with Local Search for Makespan Minimazation in Permutation Flow Shop Scheduling Problems. International Journal of Industrial Engineering Computations 1: 1-10.

Sadjadi, S. J., Ashtiani, M. G., Ramezanian, R., & Makui, A. 2016. A Firefly Algorithm for Solving Competitive Location-Design Problem: A Case Study. Journal of Industrial Engineering International 12: 517-527.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.