Data-based sorting algorithm for variable message sign location: Case study of beijing

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.