基于最佳滑移率的防抱死制动系统的滑模变结构控制

本文介绍了滑模变结构控制理论及方法，针对汽车防抱死制动系统设计了控制器，并在Matlab／Simulinlc环境下进行了仿真分析。     

基于可变模糊集的铁路应急救援决策方法研究

目前的铁路应急救援决策方法存在无法适应不同的决策需求、灵活性较差等问题。为此,引入以对立模糊集概念为基础的可变模糊决策模型与方法,提出铁路应急救援决策方案的可变模糊集优选方法,通过参数向量的变化来提高系统决策的可靠性。根据评价指标的特征值矩阵和指标权重向量,计算各方案在不同模型下的相对优属度向量,选择相对优属度最大的方案为决策方案。将可变模糊优选方法应用在铁路应急救援决策案例中,结果表明,铁路应急救援的可变模糊决策方法具有可行性和有效性,为铁路应急决策实践提供了新的解决思路。     

本田HG7230轿车可变气门机构故障诊断与排除

根据由可变气门（VTEC）控制机构的控制线路断路引发的低速工作时动力不足、高速工作时油耗增加的现象,阐述本田轿车VTEC控制机构的结构原理和故障检修方法,从而排除故障。     

The Calculation of Collision Risk on Air-Routes Based on Variable Nominal Separation

In this paper, a new method to calculate collision risk of air-routes, based on variable nominal separation, is proposed. The collision risk model of air-routes, based on the time variable and initial time interval variable, is given. Because the distance and the collision probability vary with time when the nominal relative speed between aircraft is not zero for a fixed initial time interval, the distance, the variable nominal separation, and the collision probability at any time can be expressed as functions of time and initial time interval. By the probabilistic theory, a model for calculating collision risk is acquired based on initial time interval distribution, flow rates, and the proportion of aircraft type. From the results of calculations, the collision risk can be characterized by the model when the nominal separation changes with time. As well the roles of parameters can be shown more readily.     

宽幅变截面现浇箱梁支架设计及荷载校验

大窑湾港疏港高速公路主线特大桥工程一标段K3+147.00-K4+137.00段,上部为宽幅、多跨连续预应力混凝土箱梁,采取了等截面、变截面单箱多室断面形式,施工时采用满堂支架整体现浇和满堂支架分段施工、分段浇注一次落架两种施工方法施工。本文论述了本桥右半幅第四联4×30m箱梁满堂支架设计及荷载校验。     

A Variable Time-Discretization Strategies-Based,Time-Dependent Shortest Path Algorithm for Dynamic Traffic Assignment

Within the simulation-based dynamic traffic assignment (SBDTA) model, the time-dependent shortest path (TDSP) algorithm plays a crucial role in the path-set update procedure by solving for the current optimal auxiliary solution (shortest path). Common types of TDSP algorithms require temporal discretization of link/node time/cost data, and the discretization could affect the solution quality of TDSP and of the overall SBDTA as well. This article introduces two variable time-discretization strategies applicable to TDSP algorithms. The strategies are aimed at determining the optimal time discretization for time-dependent links/nodes travel time data. The first proposed strategy produces a specific discretization interval for each link. The second proposed strategy generates time-varying intervals for the same link over the analysis period. The proposed strategies are implemented in a link-based time-dependent A* algorithm in a SBDTA model DynusT and tested with two numerical experiments on two traffic networks. The results show that the proposed discretization methods achieve the research goal—to flexibly and scalably balance the memory usage and run time for SBDTA without degrading the convergence. This property is rather important when dealing with a large real-world network with a long analysis period.     

Leave the expressway or not？ Impact of dynamic information

This study investigates drivers＇ diversion decision behavior under expressway variable message signs that provide travel time of both an expressway route and a local street route. Both a conventional cross-sectional logit model and a mixed logit model are developed to model drivers＇ response to travel time information. It is based on the data collected from a stated preference survey in Shanghai, China. The mixed logit model captures the heterogeneity in the value of ＂travel time＂ and ＂number of traffic lights＂ and accounts for correlations among repeated choices of the same respondent. Results show that travel time saving and driving experience serve as positive factors, while the number of traffic lights on the arterial road, expressway use frequency, being a middle-aged driver, and being a driver of an employer-provided car serve as negative factors in diversion. The mixed logit model obviously outperforms the cross-sectional model in dealing with repeated choices and capturing heterogeneity regarding the goodness-of-fit criterion. The significance of standard deviations of random coefficients for travel time and number of traffic lights evidences the existence of hetero- geneity in the driver population. The findings of this study have implications for future efforts in driver behaviormodeling and advanced traveler information system assessment.     

电喷发动机闭缸循环工作排放与经济性试验研究

介绍了电喷发动机闭缸循环工作节油的理论基础,给出了闭缸循环工作的控制电路和工作模式,并进行了怠速和等速行驶燃油消耗和排放性能的对比试验。试验结果表明,两缸闭缸循环工作能够有效地降低燃油消耗量。     

A distributed VNS algorithm for optimizing dial-a-ride problems in large-scale scenarios

These days, transportation and logistic problems in large cities are demanding smarter transportation services that provide flexibility and adaptability. A possible solution to this arising problem is to compute the best routes for each new scenario. In this problem, known in the literature as the dial-a-ride problem, a number of passengers are transported between pickup and delivery locations trying to minimize the routing costs while respecting a set of prespecified constraints. This problem has been solved in the literature with several approaches from small to medium sized problems. However, few efforts have dealt with large scale problems very common in massive scenarios (big cities or highly-populated regions). In this study, a new distributed algorithm based on the partition of the requests space and the combination of the routes is presented and tested on a set of 24 different scenarios of a large-scale problem (up to 16,000 requests or 32,000 locations) in the city of San Francisco. The results show that, not only the distributed algorithm is able to solve large problem instances that the corresponding sequential algorithm is unable to solve in a reasonable time, but also to have an average improvement of 9% in the smaller problems. The results have been validated by means of statistical procedures proving that the distributed algorithm can be an effective way to solve high dimensional dial-a-ride problems.     

Optimisation of dynamic motorway traffic via a parsimonious and decentralised approach

This paper presents an optimisation framework for motorway management via ramp metering and variable speed limit. We start with presenting a centralised global optimal control problem aiming to minimise the total travel delay in a motorway system. Given the centralised global optimal control solutions, we propose a set of decentralised ramp metering and speed control strategies which operate on a novel parsimonious dynamic platform without needing an underlying traffic model. The control strategies are applied to a case on UK M25 motorway. The results show that the proposed set of decentralised control is able to deliver a performance that is close to the global optimal ones with significantly less computational and implementation effort. This study provides new insights to motorway management.