scholarly journals A Hybrid Algorithm Based on Firefly Algorithm and Differential Evolution for Global Optimization

Author(s):  
S. Sarbazfard ◽  
A. Jafarian
Entropy ◽  
2019 ◽  
Vol 21 (5) ◽  
pp. 494 ◽  
Author(s):  
Guocheng Li ◽  
Pei Liu ◽  
Chengyi Le ◽  
Benda Zhou

Global optimization, especially on a large scale, is challenging to solve due to its nonlinearity and multimodality. In this paper, in order to enhance the global searching ability of the firefly algorithm (FA) inspired by bionics, a novel hybrid meta-heuristic algorithm is proposed by embedding the cross-entropy (CE) method into the firefly algorithm. With adaptive smoothing and co-evolution, the proposed method fully absorbs the ergodicity, adaptability and robustness of the cross-entropy method. The new hybrid algorithm achieves an effective balance between exploration and exploitation to avoid falling into a local optimum, enhance its global searching ability, and improve its convergence rate. The results of numeral experiments show that the new hybrid algorithm possesses more powerful global search capacity, higher optimization precision, and stronger robustness.


2018 ◽  
Vol 24 (1) ◽  
pp. 71-77 ◽  
Author(s):  
Mariam Elkhechafi ◽  
Hanaa Hachimi ◽  
Youssfi Elkettani

Abstract In this paper, we present a new hybrid algorithm which is a combination of a hybrid Cuckoo search algorithm and Firefly optimization. We focus in this research on a hybrid method combining two heuristic optimization techniques, Cuckoo Search (CS) and Firefly Algorithm (FA) for the global optimization. Denoted as CS-FA. The hybrid CS-FA technique incorporates concepts from CS and FA and creates individuals in a new generation not only by random walk as found in CS but also by mechanisms of FA. To analyze the benefits of hybridization, we have comparatively evaluated the classical Cuckoo Search and Firefly Algorithms versus the proposed hybridized algorithms (CS-FA).


2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.


Mathematics ◽  
2021 ◽  
Vol 9 (14) ◽  
pp. 1661
Author(s):  
Mohamed Abdel-Basset ◽  
Reda Mohamed ◽  
Safaa Saber ◽  
S. S. Askar ◽  
Mohamed Abouhawwash

In this paper, a modified flower pollination algorithm (MFPA) is proposed to improve the performance of the classical algorithm and to tackle the nonlinear equation systems widely used in engineering and science fields. In addition, the differential evolution (DE) is integrated with MFPA to strengthen its exploration operator in a new variant called HFPA. Those two algorithms were assessed using 23 well-known mathematical unimodal and multimodal test functions and 27 well-known nonlinear equation systems, and the obtained outcomes were extensively compared with those of eight well-known metaheuristic algorithms under various statistical analyses and the convergence curve. The experimental findings show that both MFPA and HFPA are competitive together and, compared to the others, they could be superior and competitive for most test cases.


Sign in / Sign up

Export Citation Format

Share Document