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.
Penerapan Algoritma Kunang-Kunang pada Open Vehicle Routing Problem (OVRP)
2019-08-09
doi:10.20473/conmatha.v1i1.14774
Contemporary Mathematics and Applications (ConMathA); Vol 1, No 1 (2019); 46-55 ; 2686-5564
Article (Journal)
Electronic Resource
English
DDC: | 629 |
Penerapan Algoritma Tripod Gait pada Robot Hexapod Menggunakan Arduino Mega128
BASE | 2017
|Penerapan Algoritma ORB SLAM-2 Pada Sistem Pemetaan Lingkungan Multi Robot
DOAJ | 2020
|Penerapan Algoritma Dynamic Programing pada Pergerakan Lawan dalam Permainan Police and Thief
BASE | 2019
|Penerapan Pathfinding Menggunakan Algoritma A* Pada Non Player Character (NPC) Di Game
BASE | 2019
|