首页> 外文期刊>Transportation research >Transit signal priority accommodating conflicting requests under Connected Vehicles technology
【24h】

Transit signal priority accommodating conflicting requests under Connected Vehicles technology

机译:互联车辆技术下的交通信号优先权可满足冲突的要求

获取原文
获取原文并翻译 | 示例
           

摘要

In this research, a person-delay-based optimization method is proposed for an intelligent Transit Signal Priority (TSP) logic that resolves multiple conflicting TSP requests at an isolated intersection. This TSP with Connected Vehicles accommodating Conflicting Requests (TSPCV-CR) overcomes the challenge bore by the conventional "first come first serve" strategy and presents significant improvement on bus service performance. The feature of TSPCV-CR includes green time re-allocation, simultaneous multiple buses accommodation, and signal-transit coordination. These features help maximize the transit TSP service rate and minimize adverse effect on competing travel directions. The TSPCV-CR is also designed to be conditional. That is, TSP is granted only when the bus is behind schedule and the grant of TSP causes no extra total person delay. The optimization is formulated as a Binary Mixed Integer Linear Program (BMILP) which is solved by standard branch-and-bound routine. Minimizing per person delay is the objective of the optimization model.
机译:在这项研究中,为智能交通信号优先级(TSP)逻辑提出了一种基于人员延迟的优化方法,该逻辑可解决孤立路口处的多个冲突TSP请求。该TSP具有可解决冲突请求的联网车辆(TSPCV-CR),克服了传统的“先到先得”策略所带来的挑战,并显着改善了公交服务性能。 TSPCV-CR的功能包括重新分配绿色时间,同时容纳多个总线以及信号传输协调。这些功能有助于最大程度地提高过境TSP服务费率,并最大程度减少对竞争行进路线的不利影响。 TSPCV-CR也被设计为有条件的。也就是说,仅当公交车落后于时间表且TSP的授予不会引起额外的总人员延迟时,才授予TSP。该优化公式化为二进制混合整数线性程序(BMILP),该程序通过标准分支定界例程进行求解。使人均延迟最小化是优化模型的目标。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号