汽车操纵稳定性的虚拟实验

虚拟实验是利用虚拟现实技术而进行的仿实验。本文设计了一套桌面虚拟现实系统（DesktopVR），利用该系统开发了汽车操纵稳定性虚拟实验平台，并在平台上进行了汽车双移线的虚拟实验。结果表明虚拟实验能虚拟再现实际实验的结果，与实际实验具有较好的一致性。     

基于案例推理的汽车维修专家系统

依据汽车维修行业领域的专家知识和实践经验，综合运用案例推理、模糊推理和缺省推理等方法，对汽车维修中的多种故障采取原因和症状相结合的维修思路进行推理机制的设置，建立基于案例推理、模糊推理和缺省推理相结合的、能迅速确定汽车维修方案的推理模型，建立了某企业汽车维修系统的原型系统。     

二甲醚汽车的研究现状及发展前景

二甲醚（DME）具有良好的燃烧性能,可以替代柴油用作清洁的汽车燃料。二甲醚汽车凭借其超低排放的优势,将得到更广泛的应用。文章介绍了二甲醚的物理化学性质、来源以及二甲醚在汽车发动机上的应用。同时指出二甲醚的蒸发压力过高、热值较低、粘度过低等一系列问题以及改进方法和发展方向。指出二甲醚作为替代燃料应用于汽车领域具有很大的优势,应该得到国家相关部门的技术及资金支持。     

Optimization of Wiedemann and Fritzsche car-following models for emission estimation

Recent studies have provided that the vehicle trajectories generated by car-following models may not represent the real driving characteristics, thus leading to significant emission estimation errors. In this paper, two of the most widely used car-following models, Wiedemann and Fritzsche models, were selected and analyzed based on the massive field car-following trajectories in Beijing. A numerical simulation method was designed to generate the following car’s trajectories by using the field trajectories as the input. By comparing the simulated and the filed data, the representativeness of the simulated regime fractions and VSP distributions were evaluated. Then, the mechanism of car-following models was investigated from the aspects of regime determination and the acceleration rule in each regime. Further, the regime threshold parameters and acceleration model were optimized for emission estimations. This study found that the “Following” regime threshold of SDX and the maximum acceleration in “Free Driving” regime are critical parameters for Wiedemann model. The differences between the Wiedemann simulated VSP distribution and the field one can be reduced separately by applying the optimized SDX and maximum acceleration model individually. However, a much sharper reduction was observed by optimizing both parameters simultaneously, and the emission estimation errors were further reduced, which were less than 4% in the case studies. Fritzsche model generated more realistic VSP distributions and emissions, while the maximum accelerations could be further optimized for high speed conditions.     

The vehicle platooning problem: Computational complexity and heuristics

We create a mathematical framework for modeling trucks traveling in road networks, and we define a routing problem called the platooning problem. We prove that this problem is NP-hard, even when the graph used to represent the road network is planar. We present integer linear programming formulations for instances of the platooning problem where deadlines are discarded, which we call the unlimited platooning problem. These allow us to calculate fuel-optimal solutions to the platooning problem for large-scale, real-world examples. The problems solved are orders of magnitude larger than problems previously solved exactly in the literature. We present several heuristics and compare their performance with the optimal solutions on the German Autobahn road network. The proposed heuristics find optimal or near-optimal solutions in most of the problem instances considered, especially when a final local search is applied. Assuming a fuel reduction factor of 10% from platooning, we find fuel savings from platooning of 1–2% for as few as 10 trucks in the road network; the percentage of savings increases with the number of trucks. If all trucks start at the same point, savings of up to 9% are obtained for only 200 trucks.     

无模型自适应控制算法在ROV定深控制中的仿真

将无模型自适应控制方法应用于ROV(Remote Operated Vehicle)定深控制当中。该控制方案的设计仅利用ROV的垂向推力输入数据和深度输出数据，用动态线性化时变模型替代ROV非线性系统模型，算法中不包含ROV模型及水动力参数信息。因此，解决了ROV因系统复杂，水动力参数难以确定所导致的控制器设计复杂度高，控制效果不理想的问题。为了便于仿真，本文建立含有补偿参数的ROV简化模型，模型仅用于产生系统的I/O数据，不参与控制器的设计。仿真结果表明，在ROV定深控制当中，无模型自适应控制(Model-free adaptive control，MFAC)比PID控制具有更强的抗扰能力。此外，在欠阻尼ROV系统中，基于偏格式动态线性化的无模型自适应控制(partial form dynamic linearization based Model-free adaptive control，PFDL-MFAC)方案相比于基于紧格式动态线性化的无模型自适应控制(compact form dynamic linearization based Model-free adaptive control，CFDL-MFAC)方案具有更好的控制效果。     

Vehicle insurance and the risk of road traffic accidents

Given the upward trend in incidences of road traffic accidents (RTAs) over recent years, in order to mitigate the financial losses arising from such accidents, governments around the world nowadays generally encourage, or even require, drivers to purchase appropriate vehicle insurance. The primary aim of this study is to examine whether RTAs are directly related to the purchase of vehicle insurance, with our examination of data on vehicle damage insurance policyholders revealing that those drivers who purchase more insurance coverage have a higher probability of being involved in accidents, as a result of which, they will tend to submit more claims. This indicates that insurance coverage might contain information which can be used to assess the probability risk levels of RTAs. We also find that drivers with less safety awareness will tend to purchase more coverage, and that those who purchase more coverage will, in turn, tend to have more accidents and submit more claims. Our findings, which provide a number of road traffic policy implications, would appear to justify the use of the bonus–malus system.     

基于货运车辆预警数据的高速公路危险驾驶热点路段识别

本文以货运车辆车联网数据中的车辆碰撞预警、疲劳预警和超速预警数据为研究对象,针对G4高速公路北京和河北境内道路上的三种预警热点路段进行识别。运用全局空间自相关性分析方法得出三种预警数据在道路空间中不是随机分布,而是集中在某一个或几个路段上;进一步采用局部空间相关性分析方法识别出三种不同预警类型下对应的热点路段。交通管理部门可根据识别出的预警热点路段提出针对性的管控措施,有助于缓解交通事故的发生,提高货运安全水平。     

The split-demand one-commodity pickup-and-delivery travelling salesman problem

This paper introduces a new vehicle routing problem transferring one commodity between customers with a capacitated vehicle that can visit a customer more than once, although a maximum number of visits must be respected. It generalizes the capacitated vehicle routing problem with split demands and some other variants recently addressed in the literature. We model the problem with a single commodity flow formulation and design a branch-and-cut approach to solve it. We make use of Benders Decomposition to project out the flow variables from the formulation. Inequalities to strengthen the linear programming relaxation are also presented and separated within the approach. Extensive computational results illustrate the performance of the approach on benchmark instances from the literature.     

The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery

Once limited to the military domain, unmanned aerial vehicles are now poised to gain widespread adoption in the commercial sector. One such application is to deploy these aircraft, also known as drones, for last-mile delivery in logistics operations. While significant research efforts are underway to improve the technology required to enable delivery by drone, less attention has been focused on the operational challenges associated with leveraging this technology. This paper provides two mathematical programming models aimed at optimal routing and scheduling of unmanned aircraft, and delivery trucks, in this new paradigm of parcel delivery. In particular, a unique variant of the classical vehicle routing problem is introduced, motivated by a scenario in which an unmanned aerial vehicle works in collaboration with a traditional delivery truck to distribute parcels. We present mixed integer linear programming formulations for two delivery-by-drone problems, along with two simple, yet effective, heuristic solution approaches to solve problems of practical size. Solutions to these problems will facilitate the adoption of unmanned aircraft for last-mile delivery. Such a delivery system is expected to provide faster receipt of customer orders at less cost to the distributor and with reduced environmental impacts. A numerical analysis demonstrates the effectiveness of the heuristics and investigates the tradeoffs between using drones with faster flight speeds versus longer endurance.