| Abstrakt: |
This study introduces the Modified Firefly Algorithm (MFA). This refined version merges the conventional Firefly Algorithm with elements like Constraint Satisfaction Problem (CSP), Hamming Distance (HD), objective function filtration, and positional adjustments. By incorporating the Constraint Satisfaction Problem and Hamming Distance into the foundational Firefly Algorithm mechanism, the algorithm can more efficiently navigate and utilize the search space. The inclusion of objective function filtration and positional modifications further refines the performance of the MFA. The Modified Firefly Algorithm showcases significant enhancements in solution quality, success frequency, and performance metrics compared to other Firefly Algorithm iterations, such as the standard Firefly Algorithm, Firefly Algorithm - Tabu Search (FA-TS), and Firefly Algorithm-Variable Neighborhood Descent (FA-VND). Despite the increased computational time necessitated by these added procedures, the superior solution quality of the MFA validates this trade-off. In tests against other Firefly Algorithm versions, the MFA addresses the scheduling issue. Future studies should minimize computation time durations and investigate incorporating more methods to further elevate the MFA's efficiency. [ABSTRACT FROM AUTHOR] |
