Using a new algorithm in Machine learning Approaches to estimate level-of-service in hourly traffic flow data in vehicular ad hoc networks

Authors

  • Ahmed Ibrahim Turki
  • Saad Talib Hasson

DOI:

https://doi.org/10.25130/tjps.v28i3.1428

Keywords:

Traffic flow data; Level-of-Service; Random Forest; SVM, KNN, VANET

Abstract

The primary goals of transportation agencies and researchers studying traffic operations are to ease traffic and increase road safety through the use of vehicular ad hoc networks. Agencies can't achieve their goals without reliable and consistent data on the current traffic situation. The Level-of-Service (LOS) index is a helpful measure of freeway traffic operations. Conventional fixed-location cameras and sensors are impractical and expensive for gathering reliable traffic density data on every road in large networks. Flow data is a new, low-cost option that has the potential to boost safety and operations. This study proposes an algorithm for hourly LOS assessment by incorporating flow data provided by the MIDAS (Motorway Incident Detection and Automatic Signaling) system. The proposed algorithm uses machine learning techniques to classify LOS data based on the flow of traffic. The input features that are subject to prediction are a group of technical indicators. The real-world LOS was determined by analyzing data from stationary sensors. The outcomes demonstrate that technical indicators can be utilized to enhance the accuracy of LOS estimation (Random Forest= 93.1, k-nearest neighbors = 92.5, and Support Vector Machine = 91.4). The current work introduces a novel approach to the selection of technical indicators and their use as features, which allows for highly accurate short-term prediction of LOS estimation.

Downloads

Published

2023-06-25

How to Cite

Ahmed Ibrahim Turki, & Saad Talib Hasson. (2023). Using a new algorithm in Machine learning Approaches to estimate level-of-service in hourly traffic flow data in vehicular ad hoc networks. Tikrit Journal of Pure Science, 28(3), 74–83. https://doi.org/10.25130/tjps.v28i3.1428