Volume 6 Issue 4
. 
Turn off MathJax
Article Contents
Article Navigation >  Journal of Traffic and Transportation Engineering  > 2006  >  6(4): 96-100
HUANG Min, YU Zhi, XIAO Guo-rong. Deploying model of city guide signs based on intersection functions[J]. Journal of Traffic and Transportation Engineering, 2006, 6(4): 96-100.
Citation: HUANG Min, YU Zhi, XIAO Guo-rong. Deploying model of city guide signs based on intersection functions[J]. Journal of Traffic and Transportation Engineering, 2006, 6(4): 96-100.
shu

Deploying model of city guide signs based on intersection functions

  • Research Center of Intelligent Transportation System, Sun Yat-Sen University, Guangzhou 510275, Guangdong, China

More Information
  • Author Bio:

    Huang Min(1975-), female, doctoral student, 86-20-84114212, hmsaralee@163.com

    Yu Zhi(1961-), male, professor, 86-20-84112638, stsyuz@zsu.edu.cn

  • Received Date: 2006-06-05
  • Publish Date: 2006-12-25
    Abstract
  • The modeling method of inter-town guide signs based on road network topology was discussed, the concepts of guide sign items were proposed, and the state functions of guide signs were given.Three intersection functions, such as adjacent node set, node-arc angle set and connected node set, were presented, and based on the shortest path method proposed by Dijkstra, a road guide sign model was built by using the intersection functions.The main idea of the model was as follows: destination city was taken as searching center, road guide signs were deployed by searching the adjacent node set of intersection in the influential region of the city, every path designated by road guide signs was an optimal one.Example analysed result shows that the road guide signs created by the model can effectually guide road users to aims.

     

    • FullText(HTML)
  • loading
    • References(12)
  • [1]
    GB 5768-1999, 道路交通标志和标线[S].
    [2]
    Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods[M]. NJ: Prentice Hall, 1985.
    [3]
    李友钦. 城镇指示标志布设之研究[D]. 台北: 淡江大学, 1997.
    [4]
    杨久龄, 刘会学. GB 5768-1999道路交通标志和标线应用指南[M]. 北京: 中国标准出版社, 1999.
    [5]
    齐华, 刘文熙. 建立结点上弧-弧拓扑关系的Qi算法[J]. 测绘学报, 1996, 25(3): 233-235. https://www.cnki.com.cn/Article/CJFDTOTAL-CHXB603.012.htm

    Qi Hua, Liu Wen-xi. Qi algorithm for arc-to-arc topological relationship on vertices[J]. Acta Geodaetica et Cartographica Sinica, 1996, 25(3): 233-235. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-CHXB603.012.htm
    [6]
    高云琼, 徐建刚, 唐文武. 同一结点上弧-弧拓扑关系生成的新算法[J]. 计算机应用研究, 2002, 19(4): 58-59. https://www.cnki.com.cn/Article/CJFDTOTAL-JSYJ200204019.htm

    Gao Yun-qiong, Xu Jian-gang, Tang Wen-wu. A new algorithm for generation of arc-to-arc topological relationship on the same vertices[J]. Application Research of Computers, 2002, 19(4): 58-59. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-JSYJ200204019.htm
    [7]
    罗跃军, 李霖, 朱敦尧, 等. 车辆导航系统中最短路径计算的数学模型[J]. 昆明理工大学学报: 理工版, 2004, 29(3): 106-109. https://www.cnki.com.cn/Article/CJFDTOTAL-KMLG200403027.htm

    Luo Yue-jun, Li Lin, Zhu Dun-yao, et al. Data model in the shortest-path algorithm of vehicle navigation system[J]. Journal of Kunming University of Science and Technology: Science and Technology, 2004, 29(3): 106-109. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-KMLG200403027.htm
    [8]
    Dijkstra E W. A note on two problems in connection with graphs[J]. Numeriche Mathematik, 1959, 1(1): 269-271. doi: 10.1007/BF01386390
    [9]
    张国强, 晏克非. 城市道路网络交通特性仿真模型及最短路径的算法[J]. 交通运输工程学报, 2002, 2(3): 60-62. http://transport.chd.edu.cn/article/id/200203013

    Zhang Guo-qiang, Yan Ke-fei. Simulation model based on characteristics of urban road network and its shortest path algorithm[J]. Journal of Traffic and Transportation Engineering, 2002, 2(3): 60-62. (in Chinese) http://transport.chd.edu.cn/article/id/200203013
    [10]
    张渭军, 王华. 城市道路最短路径的Dijkstra算法优化[J]. 长安大学学报: 自然科学版, 2005, 25(6): 62-65. https://www.cnki.com.cn/Article/CJFDTOTAL-XAGL200506014.htm

    Zhang Wei-jun, Wang Hua. Optimization Dijkstra algorithm for shortest path of urban traffic net[J]. Journal of Chang'an University: Natural Science Edition, 2005, 25(6): 62-65. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XAGL200506014.htm
    [11]
    胡大伟, 朱志强, 胡勇. 车辆路径问题的模拟退火算法[J]. 中国公路学报, 2006, 19(4): 123-126. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200604022.htm

    Hu Da-wei, Zhu Zhi-qiang, Hu Yong. Simulated annealing algorithm for vehicle routing problem[J]. China Journal of Highway and Transport, 2006, 19(4): 123-126. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200604022.htm
    [12]
    王丰元, 潘福全, 张丽霞, 等. 基于交通限制的路网最优路径算法[J]. 交通运输工程学报, 2005, 5(1): 92-95. http://transport.chd.edu.cn/article/id/200501022

    Wang Feng-yuan, Pan Fu-quan, Zhang Li-xia, et al. Optimal path algorithm of road network with traffic restriction[J]. Journal of Traffic and Transportation Engineering, 2005, 5(1): 92-95. (in Chinese) http://transport.chd.edu.cn/article/id/200501022
    • Relative Articles
    • Supplements(0)
    • Cited By
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views (339) PDF downloads(338) Cited by()
    Proportional views
    Related

    Copyright《Journal of Traffic and Transportation Engineering》编辑部陕ICP备05001904号-1

    Address ：Editorial Department of Journal of Traffic and Transportation Engineering, Chang 'an University, Middle Section of South Second Ring Road, Xi 'an, Shaanxi（710064） Tel：029-82334388 Email：jygc@chd.edu.cn

    All visit:Today's visit:

    Supported by: Beijing Renhe Information Technology Co. Ltd    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return