TY - JOUR T1 - A New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks TT - ارائه یک الگوریتم مسیریابی جدید مبتنی بر الگوریتم‌های ژنتیک و تبرید شبیه‌سازی‌شده برای شبکه‌های موردی بین‌خودرویی JF - jsdp JO - jsdp VL - 19 IS - 2 UR - http://jsdp.rcisp.ac.ir/article-1-1133-en.html Y1 - 2022 SP - 61 EP - 72 KW - Vehicular Ad-hoc Networks (VANET) KW - Routing KW - Clustering KW - Genetic Algorithm KW - Simulated annealing N2 - In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is a necessary requirement to maintain the Quality of Service (QoS) parameters of VANETs. In this paper, a new routing algorithm based on the clustering technique is proposed, which is called GCAR. In the proposed algorithm, the appropriate cluster heads are selected based on the genetic algorithm then two vehicles are selected between the neighboring clusters as the gateways and a vehicle chain is formed by these vehicles. Moreover, a combination of genetic algorithm and simulated annealing is applied to identify the suitable clusters. The conducted simulations in MATLAB tool indicate that, respectively, path discovery ratio, the number of clusters, throughput, and packet delivery ratio of the proposed algorithm have been improved by 18.4%, 2.55%, 3.45%, and 14.18% in comparison to the PassCAR approach. Furthermore, evaluation of the convergence, standard deviation, and standard error of the proposed algorithm prove its high convergence speed and stability. M3 10.52547/jsdp.19.2.61 ER -