Variable message signs (VMSs) provide important traffic information to help drivers travel better on a transportation network. The effectiveness of VMSs largely depends on the numbers and locations of VMSs in a transportation network. Although a few optimization models have been proposed to find candidate roads for locating VMSs, few have been devoted to developing algorithms that can be used in a real transportation network. A large amount of traffic data, such as traffic flow data, is widely available, collected by various means. Based on those traffic data, a sorting algorithm for a VMS location problem is presented in this paper. The algorithm gave a VMS location order rather than a location set. The proposed method divided roads into categories according to multilevel attributes and preferentially selected roads of a higher class with larger flows and more information and the minimal effect of existing VMS in a certain order to locate VMS. The proposed algorithm was analyzed and verified through a practical case on the Beijing, China, urban road network.
Data-Based Sorting Algorithm for Variable Message Sign Location: Case Study of Beijing
Transportation Research Record: Journal of the Transportation Research Board
Transportation Research Record: Journal of the Transportation Research Board ; 2645 , 1 ; 86-93
2017-01-01
Article (Journal)
Electronic Resource
English
An Agent-Based Simulation Model for Parking Variable Message Sign Location Problem
Transportation Research Record | 2018
|Intelligent variable message sign - IVMS
Tema Archive | 1992
|Intelligent variable message sign - IVMS
Automotive engineering | 1992
|An improved incremental assignment model for parking variable message sign location problem
Online Contents | 2015
|