Neural Network (NN) Based Route Weight Computation for Bi-Directional Traffic Management System

Neural Network (NN) Based Route Weight Computation for Bi-Directional Traffic Management System

Shamim Akhter, Rahatur Rahman, Ashfaqul Islam
Copyright: © 2016 |Pages: 15
DOI: 10.4018/IJAEC.2016100103
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Low-cost, flexible, easily maintainable and secure traffic management support systems are in demand. Internet-based real time bi-directional communication provides significant benefits to monitor road traffic conditions. Dynamic route computation is a vital requirement to make the traffic management system more realistic and reliable. Therefore, an integrated approach with multiple data feeds and Backpropagation (BP) Neural Network (NN) with Levenberg-Marquardt (LM) optimization is applied to predict the road weights. The results indicate that the proposed traffic system/tool with NN based dynamic weights computation is much more effective to find the optimal routes. The BP NN with LM optimization achieves 96.67% accuracy.
Article Preview
Top

Introduction

Traffic jam is an on-going challenge, and is not showing any signs of improvement. It results losing valuable time being stuck in traffic jams and increases CO2 emissions due to the present traffic situation. As a result, an up-to-date technological based traffic management support system/tool has become a need for metro cities.

A new internet-based (WebSocket (HTML5 Web Sockets, 2015) over HTTP) traffic management support system with real time bi-directional communication is implemented in Rahman et al., (2015a; 2015b; 2015c) to assist the traffic system to reduce the traffic and create a more sustainable environment. It also supports low cost implementation, flexibility, maintainability and infrastructure security. Thus, provides significant benefits over the existing surveillance technologies in use to monitor road traffic condition. However, this work is based on static or manual weight updates. Optimal paths/routes are calculated from the given static weights.

Weights are calculated from current road situations including-construction status, damaged status, accident status, traffic status, environmental disaster status etc. The value of the statuses are intelligently crawled by search engine, with metadata indexing (title, description, keyword etc.), directly from the multiple data feeds (like web site, RSS feeds, web service etc.). Crawled data are simplified (structured) and stored in a historic table. The decision to update the weights is decided by the DT (Rahman & Akhter, 2015a; 2015b; 2015c) and Dijkstra algorithm (Dijkstra’s Algorithm, 2015) is applied to calculate the optimal path/route using the dynamic route weights. However, DT takes long time to be trained for large data sets. It is also not good for online learning as continuous data needs frequent updating/changing in the model. Since any data includes some exceptional situation will force the DT model to be fall apart and needs to be constructed again. In addition, ID3 (Rahman, 2012) does not apply any pruning procedures nor does it handle numeric attributes or missing values (Rokach, & Maimon, 2011).

Evolutionary searching techniques e.g., genetic algorithm (Goldberg, 1989) can perform a directed search of the solution space and takes a long time to find an acceptable solution for each testing. However, when we have a number of items in different classes, NN can learn to classify items it has not seen before. In addition, NN takes some time to learn, but then it can almost instantly classify new inputs. In addition, NN is capable of reflecting the information of new instance on a model very efficiently by just changing the weight values. Thus, the DT model is replaced by the Backpropagation (BP) Neural Network (NN) and is implemented over the simplified data to adjust the route weights in database. Moreover, the Levenberg-Marquardt (LM) optimization is applied on BP to reduce the number of hidden layers as well as the training iterations. In addition k-fold cross validation and confidence interval is used to trace the NN overall performance.

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing