VANETs are so-called vehicular ad hoc networks, they enable cost-effective, scalable solutions, and hence, they can be applicable in entertainment and transportation platforms with the assistance of multi-hop wireless communications from vehicle-to-vehicle. Conversely, in VANET circumstance, the multi-hop communication development is still a challenging one because of the quick change in topology and regular disconnection of a network. This directs to inefficiency or routing failure in existing mobile ad hoc routing protocols. To resolve routing issues, the number of research studies is going on to attain the multi-constrained Quality of Service (QoS) metrics in VANET. This study intends to propose a cost model as the solution for vehicle routing problem by considering the network quality metrics, including congestion, travel, collision, and QoS awareness cost. Fuzzification of the QoS factor is also included in this entire routing cost. Further, the primary objective of this work focuses on the minimisation of the routing cost model by finding the optimal route. To find an optimal route, this study introduces a new algorithm, namely Mean Computing Jaya Algorithm. At last, the performance of the proposed model is compared with existing work in the literature in terms of cost analysis and convergence analysis, and proves the betterment of the proposed model with reduced routing cost.

中文翻译：

---

使用改进的元启发式方法的VANET中的最佳路由：Jaya的一种变体

VANET是所谓的车辆 特别指定通过网络，它们可以实现经济高效，可扩展的解决方案，因此，借助从车辆到车辆的多跳无线通信，它们可以应用于娱乐和运输平台。相反，在VANET情况下，由于拓扑结构的快速变化和网络的定期断开，多跳通信的发展仍然是一个挑战。这会导致现有移动设备的效率低下或路由失败特别指定路由协议。为了解决路由问题，正在进行大量研究以实现VANET中的多约束服务质量（QoS）指标。这项研究旨在通过考虑网络质量指标（包括拥塞，行驶，碰撞和QoS感知成本），提出一种成本模型作为车辆路由问题的解决方案。QoS因子的模糊化也包含在整个路由成本中。此外，这项工作的主要目标集中在通过找到最佳路线来最小化路线成本模型。为了找到一条最佳路线，本研究引入了一种新算法，即均值计算Jaya算法。最后，在成本分析和收敛性分析方面，将提出的模型的性能与文献中的现有工作进行了比较，