Document Type : Original Article
Authors
1 Professor, University of Tehran.
2 Ph.D. Candidate, Alborz Campus, University of Tehran
3 Ph.D, University of Tehran.
Abstract
Roadside units is one of the main components of intelligent transportation systems that provide both vehicle–vehicle and vehicle–equipment information communication. Due to the high cost of installation, the deployment of roadside units is the most critical. The aim of this study is to develop a model to optimize of roadside units placement to achieve maximum coverage. A multi–objective mathematical model presented, based on the three main parameters. These parameters are traffic volume, incident rate and as proximity to important centers, that determine for alternative points. The maximum coverage problem is an NP–hard problem. Consequently, conventional mathematical methods are not accurate and efficient enough for large scale problem. A meta–heuristic method based on the greedy algorithm was developed that allows marking points as definitive–select or non–selectable priority. The performance of the proposed model were evaluated through testing of three scenarios with different coverage radius (200, 500 and 1000 meter) in District 5 of Tehran Municipality by using MATLAB software and the 1000 meter scenario was selected with a 71% score coverage. Observations showed the effect of various parameters such as equipment coverage radius, number of equipment and budget on the results of distribution. The presented algorithm in this research makes it possible to solve the problem on a large scale by using the geographical location of the candidate points.
Keywords
Main Subjects
)