List of Articles shuffled frog leaping algorithm

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - Improving Energy Consumption in Wireless Sensor Networks Using Shuffled Frog Leaping Algorithm and Fuzzy Logic
  Shayesteh Tabatabaey
  Wireless sensor networks consist of thousands of sensor nodes with limited energy. Energy efficiency is a fundamental challenge issue for wireless sensor networks. Clustering sensor nodes in separate categories and exchanging information through clusters is one of the w More

  Wireless sensor networks consist of thousands of sensor nodes with limited energy. Energy efficiency is a fundamental challenge issue for wireless sensor networks. Clustering sensor nodes in separate categories and exchanging information through clusters is one of the ways to improve energy consumption. This paper presents a new cluster-based routing protocol called SFLCFBA. The proposed protocol biologically uses fast and effective search features inspired by the Shuffled Frog Leaping algorithm, which acts based on the Frog food behavior to cluster sensor nodes. The proposed protocol also uses fuzzy logic to calculate the node fitness, based on the two criteria of distance to the sink and the remaining energy of the sensor node or power of battery level. IEEE 802.15.4 Protocol and NODIC Protocol with the proposed methodology and OPNET Simulator were simulation and the results in terms of energy consumption, end to end delay, signal to noise ratio, the success property data and throughput were compared with each other. The results of the simulation showed that the proposed method outperforms the IEEE 802.15.4 Protocol and NODIC Protocol due to the use of the criteria listed. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - An Individual-Oriented Shuffled Frog Leaping Algorithm for Solving Vehicle Routing Problem
  Soheila Shafiezadeh Zahra Beheshti
  The Vehicle Routing Problem (VRP) is one of the most important problems in supply chain management because the optimal allocation of vehicles has a significant impact on reducing costs. VRP is in the class of NP-hard problems and exact algorithms cannot find the best so More

  The Vehicle Routing Problem (VRP) is one of the most important problems in supply chain management because the optimal allocation of vehicles has a significant impact on reducing costs. VRP is in the class of NP-hard problems and exact algorithms cannot find the best solution in an acceptable time. Hence, meta-heuristic algorithms can be employed to solve it. Shuffled Frog Leaping Algorithm (SFLA) is one of the meta-heuristic algorithms, which is efficient, but in some cases, its population diversity rapidly reduces, and the algorithm falls in local optima. In this study, an Individual-Oriented Shuffled Frog Leaping Algorithm (IO-SFLA) is proposed to enhance the exploration and exploitation of SFLA by exchanging the global and local information. Several VRPs in different dimensions are applied to evaluate the performance of IO-SFLA. The efficiency of IO-SFLA is compared with several improved shuffled frog leaping algorithms, Simulated Annealing (SA) and Genetic Algorithm (GA). The results show that IO-SFLA provides significant results compared with the other competitor algorithms. IO-SFLA achieves an average of 1130.442 for the best path cost. The next rank belongs to SA with an average of 1228.725. Other compared algorithms are in the lower ranks with high differences in results. Manuscript profile