...
首页> 外文期刊>European Journal of Operational Research >A bi-objective turning restriction design problem in urban road networks
【24h】

A bi-objective turning restriction design problem in urban road networks

机译:城市道路网络中的双目标转弯限制设计问题

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

摘要

This paper introduces a bi-objective turning restriction design problem (BOTRDP), which aims to simultaneously improve network traffic efficiency and reduce environmental pollution by implementing turning restrictions at selected intersections. A bi-level programming model is proposed to formulate the BOTRDP. The upper level problem aims to minimize both the total system travel time (TSTT) and the cost of total vehicle emissions (CTVE) from the viewpoint of traffic managers, and the lower level problem depicts travelers’ route choice behavior based on stochastic user equilibrium (SUE) theory. The modified artificial bee colony (ABC) heuristic is developed to find Pareto optimal turning restriction strategies. Different from the traditional ABC heuristic, crossover operators are captured to enhance the performance of the heuristic. The computational experiments show that incorporating crossover operators into the ABC heuristic can indeed improve its performance and that the proposed heuristic significantly outperforms the non-dominated sorting genetic algorithm (NSGA) even if different operators are randomly chosen and used in the NSGA as in our proposed heuristic. The results also illustrate that a Pareto optimal turning restriction strategy can obviously reduce the TSTT and the CTVE when compared with those without implementing the strategy, and that the number of Pareto optimal turning restriction designs is smaller when the network is more congested but greater network efficiency and air quality improvement can be achieved. The results also demonstrate that traffic information provision does have an impact on the number of Pareto optimal turning restriction designs. These results should have important implications on traffic management.
机译:本文介绍了一种双目标转向限制设计问题(BOTRDP),该问题旨在通过在选定的交叉路口实施转向限制来同时提高网络流量效率和减少环境污染。提出了双层编程模型来制定BOTRDP。从交通管理者的角度来看,上层问题旨在使总系统行驶时间(TSTT)和总车辆排放成本(CTVE)最小化,下层问题则是基于随机用户均衡来描述旅行者的路线选择行为( SUE)理论。开发了改进的人工蜂群(ABC)启发式算法,以找到帕累托最优转向限制策略。与传统的ABC启发式算法不同,捕获了交叉运算符以增强启发式算法的性能。计算实验表明,将交叉算子结合到ABC启发式算法中确实可以改善其性能,并且即使像我们建议的那样在NSGA中随机选择和使用了不同的算子,该提议的启发式方法也明显优于非主导排序遗传算法(NSGA)。启发式。结果还表明,与没有实施该策略的策略相比,帕累托最优转弯限制策略可以明显减少TSTT和CTVE,并且当网络更加拥挤但网络效率更高时,帕累托最优转弯限制设计的数量会减少。并且可以改善空气质量。结果还表明,交通信息的提供确实会影响帕累托最优转弯限制设计的数量。这些结果将对流量管理产生重要影响。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号