比较连接自行车道的不同方法,以生成完整的自行车网络并确定亚特兰大潜在的完整街道

Uijeong Hwang , Ilsu Kim , Subhrajit Guhathakurta , Pascal Van Hentenryck
{"title":"比较连接自行车道的不同方法,以生成完整的自行车网络并确定亚特兰大潜在的完整街道","authors":"Uijeong Hwang ,&nbsp;Ilsu Kim ,&nbsp;Subhrajit Guhathakurta ,&nbsp;Pascal Van Hentenryck","doi":"10.1016/j.jcmr.2024.100015","DOIUrl":null,"url":null,"abstract":"<div><p>This study compares two different strategies for connecting bike networks – traditional design-based and algorithm-supported – to investigate how their results differ along metrics such as proportion of bike lanes along simulated routes and the resulting cycling stress. The objective is to find optimal strategies for connecting isolated existing cycling infrastructure to form complete networks that improve both active mobility and public transit ridership. By aligning the bike network with transit and activity locations, this research develops an algorithmic framework for generating a skeleton of multimodal networks best suited to become \"complete streets.\" The network generated through an algorithm is compared with a proposed traditionally designed network to determine their relative network performance. The findings suggest that a judicious combination of traditionally designed, and algorithm-supported networks offer better cycling infrastructure than either strategy alone. In addition, algorithms can also be developed to indicate the potential for street segments to be complete streets.</p></div>","PeriodicalId":100771,"journal":{"name":"Journal of Cycling and Micromobility Research","volume":"2 ","pages":"Article 100015"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2950105924000068/pdfft?md5=5ed9f37b15fb481b6f7e53b621527121&pid=1-s2.0-S2950105924000068-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Comparing different methods for connecting bike lanes to generate a complete bike network and identify potential complete streets in Atlanta\",\"authors\":\"Uijeong Hwang ,&nbsp;Ilsu Kim ,&nbsp;Subhrajit Guhathakurta ,&nbsp;Pascal Van Hentenryck\",\"doi\":\"10.1016/j.jcmr.2024.100015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This study compares two different strategies for connecting bike networks – traditional design-based and algorithm-supported – to investigate how their results differ along metrics such as proportion of bike lanes along simulated routes and the resulting cycling stress. The objective is to find optimal strategies for connecting isolated existing cycling infrastructure to form complete networks that improve both active mobility and public transit ridership. By aligning the bike network with transit and activity locations, this research develops an algorithmic framework for generating a skeleton of multimodal networks best suited to become \\\"complete streets.\\\" The network generated through an algorithm is compared with a proposed traditionally designed network to determine their relative network performance. The findings suggest that a judicious combination of traditionally designed, and algorithm-supported networks offer better cycling infrastructure than either strategy alone. In addition, algorithms can also be developed to indicate the potential for street segments to be complete streets.</p></div>\",\"PeriodicalId\":100771,\"journal\":{\"name\":\"Journal of Cycling and Micromobility Research\",\"volume\":\"2 \",\"pages\":\"Article 100015\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2950105924000068/pdfft?md5=5ed9f37b15fb481b6f7e53b621527121&pid=1-s2.0-S2950105924000068-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Cycling and Micromobility Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2950105924000068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Cycling and Micromobility Research","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2950105924000068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本研究比较了两种不同的自行车网络连接策略--基于传统设计的策略和算法支持的策略,以研究它们在模拟路线上的自行车道比例和由此产生的骑行压力等指标上的结果有何不同。研究的目的是找到最佳策略,将孤立的现有自行车基础设施连接起来,形成完整的网络,从而提高主动流动性和公共交通的客流量。通过将自行车网络与公交和活动地点相结合,本研究开发了一种算法框架,用于生成最适合成为 "完整街道 "的多式联运网络骨架。通过算法生成的网络与建议的传统设计网络进行比较,以确定它们的相对网络性能。研究结果表明,将传统设计的网络和算法支持的网络明智地结合起来,能提供比单独使用其中一种策略更好的自行车基础设施。此外,还可以开发算法来显示街道路段成为完整街道的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparing different methods for connecting bike lanes to generate a complete bike network and identify potential complete streets in Atlanta

This study compares two different strategies for connecting bike networks – traditional design-based and algorithm-supported – to investigate how their results differ along metrics such as proportion of bike lanes along simulated routes and the resulting cycling stress. The objective is to find optimal strategies for connecting isolated existing cycling infrastructure to form complete networks that improve both active mobility and public transit ridership. By aligning the bike network with transit and activity locations, this research develops an algorithmic framework for generating a skeleton of multimodal networks best suited to become "complete streets." The network generated through an algorithm is compared with a proposed traditionally designed network to determine their relative network performance. The findings suggest that a judicious combination of traditionally designed, and algorithm-supported networks offer better cycling infrastructure than either strategy alone. In addition, algorithms can also be developed to indicate the potential for street segments to be complete streets.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信