Analytical geometric design of bicycle paths

被引:3
|
作者
Ul-Abdin, Zain [1 ]
Rajper, Sarmad Zaman [2 ]
Schotte, Ken [1 ]
De Winne, Pieter [1 ]
De Backer, Hans [1 ]
机构
[1] Univ Ghent, Dept Civil Engn, Ghent, Belgium
[2] Univ Ghent, Dept Gen Econ, Ghent, Belgium
关键词
design methods & aids; roads & highways; traffic engineering; SAFETY; RISK;
D O I
10.1680/jtran.17.00162
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
An advanced design classification system for bicycle paths, based on geometric features and force equilibrium, can pave the way for improved bicycle safety, accident prevention and the development of design guidelines. A design and classification system does exist for bicycle paths, but the number of accidents has led to ambivalence about its validity and effectiveness. In addition, a universally accepted classification system has not yet been approved or adopted. This paper presents a unique set of design parameters, analytically developed based on formulas that consider the physical characteristics and dimensions of individual bicycles. The proposed design system is based on theoretical trigonometric derivations. The model was validated with the real-world geometry of the transportation infrastructure of the city of Antwerp, Belgium. The conclusions of this study are useful for evaluating the effectiveness of bicycle paths during the design stage without the necessity for real-world experiments. The results will thus be valuable for stakeholders working on policy frameworks, bicycle safety and riding comfort.
引用
收藏
页码:361 / 379
页数:19
相关论文
共 50 条
  • [31] A note on the notion of geometric rough paths
    Friz, Peter
    Victoir, Nicolas
    PROBABILITY THEORY AND RELATED FIELDS, 2006, 136 (03) : 395 - 416
  • [32] Approximating geometric bottleneck shortest paths
    Bose, P
    Maheshwari, A
    Narasimhan, G
    Smid, M
    Zeh, N
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2004, 29 (03): : 233 - 249
  • [33] Approximating geometric bottleneck shortest paths
    Bose, P
    Maheshwari, A
    Narasimhan, G
    Smid, M
    Zeh, N
    STACS 2003, PROCEEDINGS, 2003, 2607 : 38 - 49
  • [34] Noncrossing Hamiltonian paths in geometric graphs
    Cerny, J
    Dvorák, Z
    Jelínek, V
    Kára, J
    GRAPH DRAWING, 2004, 2912 : 86 - 97
  • [35] On paths in a complete bipartite geometric graph
    Kaneko, A
    Kano, M
    DISCRETE AND COMPUTATIONAL GEOMETRY, 2001, 2098 : 187 - 191
  • [36] On the integration of weakly geometric rough paths
    Cass, Thomas
    Driver, Bruce K.
    Lim, Nengli
    Litterer, Christian
    JOURNAL OF THE MATHEMATICAL SOCIETY OF JAPAN, 2016, 68 (04) : 1505 - 1524
  • [37] Constrained disjoint paths in geometric network
    Giewali, Laxmi
    Selveraj, Henry
    Mazzella, Dan
    ICCIMA 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND MULTIMEDIA APPLICATIONS, VOL II, PROCEEDINGS, 2007, : XXIII - XXX
  • [38] Paths of subjects in the analytical course
    Pepin, Louise
    SANTE MENTALE AU QUEBEC, 2006, 31 (01): : 65 - 79
  • [39] Ride Quality for Bicycle Paths under Different Pavement Conditions
    Ul-Abdin, Zain
    De Backer, Hans
    De Winne, Pieter
    Rajper, Sarmad Zaman
    INTERNATIONAL CONFERENCE ON TRANSPORTATION AND DEVELOPMENT 2018: PLANNING, SUSTAINABILITY, AND INFRASTRUCTURE SYSTEMS, 2018, : 1 - 8
  • [40] Bicycle Commute: Bike Paths Unlikely Riskier Than Roadways
    Lohiya, Ghan-Shyam
    Tan-Figueroa, Lilia
    Polet-Humerez, Yajaira
    JOURNAL OF OCCUPATIONAL AND ENVIRONMENTAL MEDICINE, 2010, 52 (07) : 671 - 671