TY  - JOUR
T1  - Reducing Traffic and Pollution in Cities Using Optimal Vehicular Network Routing Algorithms
AU - Heydarian, Mohsen AU - Farahbakhsh, Arman 
JO  - International Business Management
VL  - 10
IS  - 16
SP  - 3546
EP  - 3557
PY  - 2016
DA  - 2001/08/19
SN  - 1993-5250
DO  - ibm.2016.3546.3557
UR  - https://makhillpublications.co/view-article.php?doi=ibm.2016.3546.3557
KW  - air pollution
KW  -routing
KW  -linear programming
KW  -VANET
KW  -traffic delay reduction
AB  - There is a great requirement to reduce air pollution and transportation delay in cities roads. This paper presents a new routing algorithm, Optimal Traffic and Pollution Control Routing algorithm (OTPCR), based on the mathematical modeling and Infrastructure communication (V2I) strategy to minimize vehicle traveling delay and air pollution in city roads. Our new routing algorithm (OTPCR) at first will construct a mathematical model which formulate: vehicles traffic, roads topology and air pollution parameters and next it solves the obtained mathematical model in order to compute and find the best path (π) between source and destination for traveling vehicle. The Mathematical model which is called Vehicular Network Linear Programming Model (VLPM) is based on the Linear Integer Programming Formulation (LIPF) and Simplex optimization rules. Note that the best path is an optimal path and can minimize air pollution in city roads and transportation delay of vehicles. V2I communication strategy uses a Mobile Ad Hoc Networks (MANET) system to transfer vehicle traffic information. Our simulation results show that our new algorithm is more efficient than other available routing algorithms. Time complexity of our algorithm is acceptable and can reduce message distribution across the network.
ER  -