关于客车雨刷器执行机构失效问题的分析与解决

文章针对客车前挡风玻璃上的雨刷器各部件由于安装精度不够,造成雨刷器的执行机构失效,表现形式为烧保险、烧继电器、烧电机、烧电线等现象,造成车辆在下雨天不能正常使用,或根本不能使用,直接导致汽车客车晚点、停运、甚至引发交通事故,给运输企业、承包单位、乘客、社会带来较大的经济损失和社会问题,进行了分析与研究,并从汽车生产过程...     

抚通高速公路路基施工技术探讨

针对旺南高速公路的路基特点,对路基施工所采用的技术要求予以探讨,为我省及东北其他省份高速公路路基施工提供参考。     

平定高速公路路基强夯施工工艺

结合平定高速公路K128+700~K136+298.442段高填路基基底强夯施工的工程实践,对强夯施工的方法、工艺过程、检测方法及施工效果进行了介绍,供类似工程施工参考。     

Time-dependent congestion pricing system for large networks: Integrating departure time choice,dynamic traffic assignment and regional travel surveys in the Greater Toronto Area

Congestion pricing is one of the widely contemplated methods to manage traffic congestion. The purpose of congestion pricing is to manage traffic demand generation and supply allocation by charging fees (i.e., tolling) for the use of certain roads in order to distribute traffic demand more evenly over time and space. This study presents a framework for large-scale variable congestion pricing policy determination and evaluation. The proposed framework integrates departure time choice and route choice models within a regional dynamic traffic assignment (DTA) simulation environment. The framework addresses the impact of tolling on: (1) road traffic congestion (supply side), and (2) travelers’ choice dimensions including departure time and route choices (demand side). The framework is applied to a simulation-based case study of tolling a major freeway in Toronto while capturing the regional effects across the Greater Toronto Area (GTA). The models are developed and calibrated using regional household travel survey data that reflect the heterogeneity of travelers’ attributes. The DTA model is calibrated using actual traffic counts from the Ontario Ministry of Transportation and the City of Toronto. The case study examined two tolling scenarios: flat and variable tolling. The results indicate that: (1) more benefits are attained from variable pricing, that mirrors temporal congestion patterns, due to departure time rescheduling as opposed to predominantly re-routing only in the case of flat tolling, (2) widespread spatial and temporal re-distributions of traffic demand are observed across the regional network in response to tolling a significant, yet relatively short, expressway serving Downtown Toronto, and (3) flat tolling causes major and counterproductive rerouting patterns during peak hours, which was observed to block access to the tolled facility itself.     

Meeting points in ridesharing: A privacy-preserving approach

Nowadays, problems of congestion in urban areas due to the massive usage of cars, last-minute travel needs and progress in information and communication technologies have fostered the rise of new transportation modes such as ridesharing. In a ridesharing service, a car owner shares empty seats of his car with other travelers. Recent ridesharing approaches help to identify interesting meeting points to improve the efficiency of the ridesharing service (i.e., the best pick-up and drop-off points so that the travel cost is competitive for both driver and rider). In particular, ridesharing services, such as Blablacar or Carma, have become a good mobility alternative for users in their daily life. However, this success has come at the cost of user privacy. Indeed in current’s ridesharing services, users are not in control of their own data and have to trust the ridesharing operators with the management of their data.In this paper, we aim at developing a privacy-preserving service to compute meeting points in ridesharing, such that each user remains in control of his location data. More precisely, we propose a decentralized architecture that provides strong security and privacy guarantees without sacrificing the usability of ridesharing services. In particular, our approach protects the privacy of location data of users. Following the privacy-by-design principle, we have integrated existing privacy enhancing technologies and multimodal shortest path algorithms to privately compute mutually interesting meeting points for both drivers and riders in ridesharing. In addition, we have built a prototype implementation of the proposed approach. The experiments, conducted on a real transportation network, have demonstrated that it is possible to reach a trade-off in which both the privacy and utility levels are satisfactory.     

Formulating the within-day dynamic stochastic traffic assignment problem from a Bayesian perspective

This study proposes a formulation of the within-day dynamic stochastic traffic assignment problem. Considering the stochastic nature of route choice behavior, we treat the solution to the assignment problem as the conditional joint distribution of route traffic, given that the network is in dynamic stochastic user equilibrium. We acquire the conditional joint probability distribution using Bayes’ theorem. A Metropolis–Hastings sampling scheme is developed to estimate the characteristics (e.g., mean and variance) of the route traffic. The proposed formulation has no special requirements for the traffic flow models and user behavior models, and so is easily implemented.     

Self-organizing traffic signals using secondary extension and dynamic coordination

Actuated traffic signal control logic has many advantages because of its responsiveness to traffic demands, short cycles, effective use of capacity leading to and recovering from oversaturation, and amenability to aggressive transit priority. Its main drawback has been its inability to provide good progression along arterials. However, the traditional way of providing progression along arterials, coordinated–actuated control with a common, fixed cycle length, has many drawbacks stemming from its long cycle lengths, inflexibility in recovering from priority interruptions, and ineffective use of capacity during periods of oversaturation. This research explores a new paradigm for traffic signal control, “self-organizing signals,” based on local actuated control but with some additional rules that create coordination mechanisms. The primary new rules proposed are for secondary extensions, in which the green may be held to serve an imminently arriving platoon, and dynamic coordination, in which small groups of closely spaced signals communicate with one another to cycle synchronously with the group’s critical intersection. Simulation tests in VISSIM performed on arterial corridors in Massachusetts and Arizona show overall delay reductions of up to 14% compared to an optimized coordinated–actuated scheme where there is no transit priority, and more than 30% in scenarios with temporary oversaturation. Tests also show that with self-organizing control, transit signal priority can be more effective than with coordinated–actuated control, reducing transit delay by about 60%, or 12 to 14 s per intersection with little impact on traffic delay.     

Accounting for dynamic speed limit control in a stochastic traffic environment: A reinforcement learning approach

This paper proposes a novel dynamic speed limit control model accounting for uncertain traffic demand and supply in a stochastic traffic network. First, a link based dynamic network loading model is developed to simulate the traffic flow propagation allowing the change of speed limits. Shockwave propagation is well defined and captured by checking the difference between the queue forming end and the dissipation end. Second, the dynamic speed limit problem is formulated as a Markov Decision Process (MDP) problem and solved by a real time control mechanism. The speed limit controller is modeled as an intelligent agent interacting with the stochastic network environment stochastic network environment to assign time dependent link based speed limits. Based on different metrics, e.g. total network throughput, delay time, vehicular emissions are optimized in the modeling framework, the optimal speed limit scheme is obtained by applying the R-Markov Average Reward Technique (R-MART) based reinforcement learning algorithm. A case study of the Sioux Falls network is constructed to test the performance of the model. Results show that the total travel time and emissions (in terms of CO) are reduced by around 18% and 20% compared with the base case of non-speed limit control.     

A dynamic station strategy to improve the performance of flex-route transit services

As an innovative combination of conventional fixed-route transit and demand responsive service, flex-route transit is currently the most popular type of flexible transit services. This paper proposes a dynamic station strategy to improve the performance of flex-route transit in operating environments with uncertain travel demand. In this strategy, accepted curb-to-curb stops are labeled as temporary stations, which can be utilized by rejected requests for their pick-up and drop-off. The user cost function is defined as the performance measure of transit systems. Analytical models and simulations are constructed to test the feasibility of implementing the dynamic station strategy in flex-route transit services. The study over a real-life flex-route service indicates that the proposed dynamic station strategy could reduce the user cost by up to 30% without any additional operating cost, when an unexpectedly high travel demand surpasses the designed service capacity of deviation services.     

A scalable non-myopic dynamic dial-a-ride and pricing problem for competitive on-demand mobility systems

We propose a competitive on-demand mobility model using a multi-server queue system under infinite-horizon look-ahead. The proposed approach includes a novel dynamic optimization algorithm which employs a Markov decision process (MDP) and provides opportunities to revolutionize conventional transit services that are plagued by high cost, low ridership, and general inefficiency, particularly in disadvantaged communities and low-income areas. We use this model to study the implications it has for such services and investigate whether it has a distinct cost advantage and operational improvement. We develop a dynamic pricing scheme that utilizes a balking rule that incorporates socially efficient level and the revenue-maximizing price, and an equilibrium-joining threshold obtained by imposing a toll on the customers who join the system. Results of numerical simulations based on actual New York City taxicab data indicate that a competitive on-demand mobility system supported by the proposed model increases the social welfare by up to 37% on average compared to the single-server queuing system. The study offers a novel design scheme and supporting tools for more effective budget/resource allocation, planning, and operation management of flexible transit systems.