Methods to reduce dimensionality and identify candidate solutions in multi-objective signal timing problems

Adjusting traffic signal timings is a practical way for agencies to manage urban traffic without the need for significant infrastructure investments. Signal timings are generally selected to minimize the total control delay vehicles experience at an intersection, particularly when the intersection is isolated or undersaturated. However, in practice, there are many other potential objectives that might be considered in signal timing design, including: total passenger delay, pedestrian delays, delay inequity among competing movements, total number of stopping maneuvers, among others. These objectives do not tend to share the same relationships with signal timing plans and some of these objectives may be in direct conflict. The research proposes the use of a new multi-objective optimization (MOO) visualization technique—the mosaic plot—to easily quantify and identify significant tradeoffs between competing objectives using the set of Pareto optimal solutions that are normally provided by MOO algorithms. Using this tool, methods are also proposed to identify and remove potentially redundant or unnecessary objectives that do not have any significant tradeoffs with others in an effort to reduce problem dimensionality. Since MOO procedures will still be needed if more than one objective remains and MOO algorithms generally provide a set of candidate solutions instead of a single final solution, two methods are proposed to rank the set of Pareto optimal solutions based on how well they balance between the competing objectives to provide a final recommendation. These methods rely on converting the objectives to dimensionless values based on the optimal value for each specific objectives, which allows for direct comparison between and weighting of each. The proposed methods are demonstrated using a simple numerical example of an undersaturated intersection where all objectives can be analytically obtained. However, they can be readily applied to other signal timing problems where objectives can be obtained using simulation outputs to help identify the signal timing plan that provides the most reasonable tradeoff between competing objectives.     

Nonlinear pricing in linear cities with elastic demands

Nonlinear road pricing charges each traveler based on his/her trip’s corresponding particular attribute level. In order to help authorities in designing road pricing systems at a strategic level, this paper attempts to address two fundamental questions: (i) what is the value of pricing’s nonlinearity for mitigating traffic congestion? (ii) if a nonlinear toll function is implemented, should it be convex, concave or other shape? Specifically, we consider distance-based pricing in linear cities. For linear monocentric cities with heterogeneous travelers, we show that the system optimal distance-based pricing indeed exhibits nonlinearity. It is proved that: (i) the cost-based system optimal toll function is monotonically increasing and concave with respect to the traveled distance; (ii) the time-based system optimal toll function always exists and is unique. If the initial proportion of each traveler group is invariant along a corridor and the demand function is of exponential type, then the time-based system optimal toll function enables the travelers, living further away from a city center, to face a lower toll level per unit distance. For a linear polycentric city, we demonstrate: (i) there always exists the system optimal differentiated (in terms of city centers) toll functions; (ii) it is highly possible that the system optimal non-differentiated toll function does not exist. Hence, we further propose an optimal toll design model, prove the Lipschitz continuity of its objective and adopt a global-optimization algorithm to solve it.     

Distributed MPC for cooperative highway driving and energy-economy validation via microscopic simulations

Traffic congestion and energy issues have set a high bar for current ground transportation systems. With advances in vehicular communication technologies, collaborations of connected vehicles have becoming a fundamental block to build automated highway transportation systems of high efficiency. This paper presents a distributed optimal control scheme that takes into account macroscopic traffic management and microscopic vehicle dynamics to achieve efficiently cooperative highway driving. Critical traffic information beyond the scope of human perception is obtained from connected vehicles downstream to establish necessary traffic management mitigating congestion. With backpropagating traffic management advice, a connected vehicle having an adjustment intention exchanges control-oriented information with immediately connected neighbors to establish potential cooperation consensus, and to generate cooperative control actions. To achieve this goal, a distributed model predictive control (DMPC) scheme is developed accounting for driving safety and efficiency. By coupling the states of collaborators in the optimization index, connected vehicles achieve fundamental highway maneuvers cooperatively and optimally. The performance of the distributed control scheme and the energy-saving potential of conducting such cooperation are tested in a mixed highway traffic environment by the means of microscopic simulations.     

一种商用车铅酸蓄电池状态监控系统的开发

本文介绍一种商用车铅酸蓄电池状态监控系统的开发,系统实现蓄电池传感器实时采集蓄电池状态参数信息,并通过TBOX将数据上传至后台服务器,进行数据存储分析及报警判断,并将亏电报警信息推送给手机客户端,提醒用户注意。同时,系统根据蓄电池SOC值的限值判断,进行电磁开关的切断控制,以保证车辆的正常起动。     

A traffic-condition-based route guidance strategy for a single destination road network

Most of existing route guidance strategies achieves user optimal equilibrium by comparing travel time. Measuring travel time, however, might be uneasy on an urban road network. To contend with the issue, the paper mainly considers easily obtained inflow and outflow of a link and road capacity as input, and proposes a route guidance strategy for a single destination road network based on the determination of free-flow or congested conditions on alternative routes. An extended strategy for a complex network and a feedback approximation for avoiding forecast are further explored. Weaknesses of the strategy are also explicitly analyzed. To test the strategy, simulation investigations are conducted on two networks with multiple parallel routes. The results indicate that the strategy is able to provide stable splitting rates and to approximate user optimal equilibrium in different conditions, in particular when traffic demand is high. This strategy has potential to be applied in an urban road network due to its simplicity and easily obtained input data. The strategy is also applicable for single destination if some alternatives and similar routes are available.     

Optimal placement of omnidirectional sensors in a transportation network for effective emergency response and crash characterization

Rapid motor vehicle crash detection and characterization is possible through the use of Intelligent Transportation Systems (ITS) and sensors are an integral part of any ITS system. The major focus of this paper is on developing optimal placement of accident detecting omnidirectional sensors to maximize incident detection capabilities and provide ample opportunities for data fusion and crash characterization. Both omnidirectional sensors (placed in suitable infrastructure locations) and mobile sensors are part of our analysis. The surrogates used are acoustic sensors (omnidirectional) and Advanced Automated Crash Notification (AACN) sensors (mobile). This data fusion rich placement is achieved through a hybrid optimization model comprising of an explicit–implicit coverage model followed by an evaluation and local search optimization using simulation. The compound explicit–implicit model delivers good initial solutions and improves the detection and data fusion capabilities compared to the explicit model alone. The results of the studies conducted quantify the use of a data fusion capable environment in crash detection scenarios, and the simulation tool developed helps a decision maker evaluate sensor placement strategy.     

Plate scanning tools to obtain travel times in traffic networks

The management of vehicle travel times has been shown to be fundamental to traffic network analysis. To collect travel time measurement, some methods focus solely on isolated links or highway segments, and where two measurement points, at the beginning and at the end of a section, are deemed sufficient to evaluate users' travel time. However, in many cases, transport studies involve networks in which the problem is more complex. This article takes advantage of the plate scanning technique to propose an algorithm that minimizes the required number of registering devices and their location in order to identify vehicles candidates to compute the travel times of a given set of routes (or subroutes). The merits of the proposed method are explained using simple examples and are illustrated by its application to the real network of Ciudad Real.     

Travel time estimation oriented freeway sensor placement problem considering sensor failure

Optimal sensor placement on freeway corridor is of great interest to transportation authorities. However, current traffic sensors are easily subject to various failures. Therefore, it is necessary to incorporate sensor failure into the optimal sensor placement model. In this article, a two-stage stochastic model is proposed for the purpose of travel time estimation on freeway corridor. To balance the effectiveness and reliability, a stochastic conditional value at risk (CVaR) model is also proposed. Since both models are too complicated, a customized genetic algorithm is developed. Numerical experiments show that considering sensor failure makes a significant performance improvement in the sensor placement pattern. Sensitivity analysis is also applied to investigate the impact of a number of allowable sensors and different traffic sensor failure probability.     

湖北城际铁路动车组选型与交路优化研究

以湖北城际铁路为例,通过比照区间运行速度、参考我国高级动车的技术配置合理选择车型,并优化原交路,最终对原、现两种方案的成本效益对比分析,实证表明,该方案有助于减少动车购置成本,降低亏损,并简化原有运输组织工作.     

考虑多人相互影响的舰船通道最短路径规划

将时间维引入既定舰船通道网络,把考虑多人相互影响的动态最优路径规划问题转化为时间依赖网络中的最优路径搜索问题。首先,论文的算法为所有人员随机生成走行路径,为了预测网络中的弧(路段)的走行时间,按人员速度从慢到快的顺序依次计算并记录人员到达路径中的各路段首节点的时刻,先记录到的人员将成为后记录到的人员的动态障碍。然后,将遗传算法与网络中弧的走行时间预测方法相结合,借助遗传算法的个体多样性天然地解决了人员走行任意性问题,因而获得了全局动态最优路径算法,并仿真计算了两人以及三人的最短时间路径;经与不考虑人员间相互影响时获得的最优路径相比较,论文的算法获得了人员遇到障碍时(或跟行或绕行)的最优走行路径。最后,借助时间依赖网络中的最优路径充要条件定理,说明了算法的有效性。