الفهرس 
ACKNOWLEDGMENTSOnly 14 pages are availabe for public view
 |  | from | 109 |  |  |
| | | from | 109 | | |
Abstract
Maintaining traffic speed below the operational speed is a commitment to achieve the best standards of road safety. That can be
achieved through the use of the latest advanced technologies like traffic sensors, which play a crucial role in traffic control and management regarding the information they provide. However, placing these
devices in a network constitutes a significant problem due to its multidisciplinary nature. The traffic sensors’ location problem always suffers from a combinatorial property with the size of the network.
This thesis presents a new formulation to one of those traffic
sensors problems, namely; the portable excess speed detectors location problem. These detectors are studied to be located in a network in
order to separate most of the demand node pairs in the network resembling the well-known traffic sensor surveillance problem. However, newly, the locations are permitted to be changed introducing the
dynamic form of the sensor location problem.
The problem is formulated mathematically as a set covering
problem, which is proven to be an NP-hard problem then heuristics
are called for the solution. The aim is to find the optimal number of
sensors to intercept most of the daily traffic besides how to redistribute these sensors maintaining their coverage efficiency.
The methodology is applied to AL Riyadh city as a real case
study network. The methodology results show the capability of
providing satisfactory solutions with reasonable computing burden.