汽车防追尾碰撞数学模型研究

为了提高车辆在高速行驶状态下的主动安全性能,研究了处于追尾行驶状态的本车与前车的运动学特征;针对前车的不同运动状态分别推导出了跟车距离的计算模型并分析了模型中3个关键参数的随机性和动态性,对制动迟滞时间提出了基于模糊推理的确定方法,对本车制动减速度和前车的运动加速度提出了比较实用的动态测算公式;另外,研究了防追尾碰撞的控制与执行,建立了动态调整安全制动停车距离的神经网络模型,提出了基于危险裕度判别的安全控制方法。     

Modelling nutrient fluxes from sub-arctic basins: Comparison of pristine vs. dammed rivers

The deterministic Riverstrahler model of river functioning is applied for the first time to sub-arctic catchments. Seasonal nutrient (N, P, Si) deliveries to the coastal zone are simulated, and nutrient annual fluxes are established for the nearly pristine river Kalix (hereafter called Kalixälven) and the heavily dammed river Lule, (hereafter called Luleälven) both located in Northern Sweden and draining into the Bothnian Bay, Baltic Sea.For Kalixälven simulations are performed with a runoff calculated from precipitation, evapo-transpiration and temperature data for the period 1990–1999, using a hydrological model calibrated on observed monthly discharges at the river outlet. The same hydrological parameters are used to calculate specific runoff for the Luleälven basin in absence of dam regulation. Reservoir filling and emptying are simulated using a simplified representation of their management rules. Diffuse sources of nutrient are evaluated according to land cover of the catchment. The simulated seasonal trends are within the range of the observed data, in particular for discharge, dissolved silica, total phosphorus, inorganic nitrogen and total organic carbon. Specific runoff is 50% higher in the Luleälven than in the Kalixälven watershed due to higher altitudes and precipitations. Average silica, nitrate and phosphorus concentrations are much lower in Luleälven than in Kalixälven. Comparison of model results for the Luleälven with and without dams shows a reduction of respectively 25% and 30% in silica and phosphorus fluxes delivered at the outlet, while nitrogen delivery is increased by 10% in the dammed vs. undammed river system. The model allows assessing the respective role of reservoir trapping of nutrient in the reservoir through algal uptake and sedimentation, and of changes in the vegetation induced by flooding the valley formerly covered by forests and wetlands.     

Reliable sensor deployment for network traffic surveillance

New sensor technologies enable synthesis of disaggregated vehicle information from multiple locations. This paper proposes a reliable facility location model to optimize traffic surveillance benefit from synthesized sensor pairs (e.g., for travel time estimation) in addition to individual sensor flow coverage (e.g., for traffic volume statistics), while considering probabilistic sensor failures. Customized greedy and Lagrangian relaxation algorithms are proposed to solve this problem, and their performance is discussed. Numerical results show that the proposed algorithms solve the problem efficiently. We also discuss managerial insights on how optimal sensor deployment and surveillance benefits vary with surveillance objective and system parameters (such as sensor failure probabilities).     

Lagrangian flow in the California Undercurrent, an observation and model comparison

During the period 1992–1998, 38 isobaric RAFOS floats were deployed to sample the subsurface flow of the California Undercurrent. The deployments, released over the California continental slope west of San Francisco, have sampled robust year-round poleward subsurface flow associated with the Undercurrent most seasons and the combined inshore current and Undercurrent in winter. Two other types of flow have been seen: a region of weak flow with little net displacement just west of the California Undercurrent, and an active westward propagating eddy field. This eddy field appears to be the primary mechanism for moving floats from the Undercurrent into the ocean interior. The observations and statistics from the RAFOS floats are compared with Lagrangian estimates of particles tracked in a global high resolution ocean simulation in order to evaluate the fidelity of the model along an eastern boundary. The results show that the model reproduces the general character of the flow reasonably well, but underestimates both the mean and eddy energies by a substantial amount.     

Scheduling of Intelligent and Autonomous Vehicles under pairing/unpairing collaboration strategy in container terminals

A new class of Intelligent and Autonomous Vehicles (IAVs) has been designed in the framework of Intelligent Transportation for Dynamic Environment (InTraDE) project funded by European Union. This type of vehicles is technologically superior to the existing Automated Guided Vehicles (AGVs), in many respects. They offer more flexibility and intelligence in maneuvering within confined spaces where the logistic operations take place. This includes the ability of pairing/unpairing enabling a pair of 1-TEU (20-foot Equivalent Unit) IAVs dynamically to join, transport containers of any size between 1-TEU and 1-FFE (40-foot Equivalent) and disjoin again. Deploying IAVs helps port operators to remain efficient in coping with the ever increasing volume of container traffic at ports and eliminate the need for deploying more 40-ft transporters in the very confined area of ports. In order to accommodate this new feature of IAVs, we review and extend one of the existing mixed integer programming models of AGV scheduling in order to minimize the makespan of operations for transporting a set of containers of different sizes between quay cranes and yard cranes. In particular, we study the case of Dublin Ferryport Terminal. In order to deal with the complexity of the scheduling model, we develop a Lagrangian relaxation-based decomposition approach equipped with a variable fixing procedure and a primal heuristics to obtain high-quality solution of instances of the problem.     

拉格朗日松弛启发式算法求解时空网络下的弧路径问题

为减少车辆调度成本,优化车辆运输路径,在时空网络中研究路段作业车辆的弧路径问题;考虑道路出行的时变性,利用车辆运行的时间、空间特征,构建时间-空间网络,建立弧路径问题的时空网络流模型;设计了拉格朗日松弛启发式算法,引入拉格朗日乘子松弛耦合约束,构建拉格朗日松弛问题;进一步通过拉格朗日分解,把松弛问题分解为单车最短路问题;用次梯度算法更新乘子,求解拉格朗日对偶问题,并更新原问题最优解的下界;使用启发式算法获得可行解,并更新原问题最优解的上界;用六结点运输网络和Sioux-Falls网络下的算例对算法进行实证分析。计算结果表明：六结点运输网络中6个算例的上下界间隙值等于0或接近0,Sioux-Falls网络中算例2的间隙值为0.02%,其余5个算例的间隙值等于0,均可以得到质量较高的近似最优解;在最复杂的算例(15辆车,70个任务)中,算法在可接受的时间内也得到了间隙值为0的解,找出了最优的车辆路径;随着迭代次数的增加,拉格朗日乘子会逐步收敛到固定值;当车辆容量从50增加到100时,最优解从52下降到42,说明在任务数和车辆数一定时,适当增加车容量可以降低运营成本。可见,与商业求解器相比,拉格朗日松弛启发式算法的间隙值更小,求解质量更高,可以更有效地求解弧路径问题。     

Conflict-free arrival and departure trajectory planning for parallel runway with advanced point-merge system

In this paper, an efficient trajectory planning system is proposed to solve the integration of arrivals and departures on parallel runways with a novel route network system. Our first effort is made in designing an advanced Point Merge (PM) route network named Multi-Level Point Merge (ML-PM) to meet the requirements of parallel runway operations. Then, more efforts are paid on finding a complete and efficient framework capable of dynamically modelling the integration of arrival and departure trajectories on parallel runways, modelling the conflict detection and resolution in presence of curved trajectory and radius-to-fix merging process. After that, a suitable mathematical optimization formulation is built up. Receding Horizon Control (RHC) and Simulated Annealing (SA) algorithms are proposed to search the near-optimal solution for the large scale trajectories in routine dense operations. Taking Beijing Capital International Airport (BCIA) as a study case, the experimental results show that our system shows good performances on the management of arrivals and departures. It can automatically solve all the potential conflicts in presence of dense traffic flows. With its unique ML-PM route network, it can realize a shorter flying time and a near-Continuous Descent Approach (CDA) descent for arrival aircraft, an economical climbing for departure aircraft, an easier runway allocation together with trajectory control solutions. It shows a good and dynamic sequencing efficiency in Terminal Manoeuvring Area (TMA). In mixed ML-PM mode, under tested conditions, our proposed system can increase throughput at BCIA around 26%, compared with baseline. The methodology defined here could be easily applied to airports worldwide.     

Impacts of trade related sustainability strategies on freight transportation: Modelling framework and application for France

The circular and functional economies are being presented in the literature as potential strategies for future sustainable societies. In terms of the consequences for supply chains, they will promote a much more dispersed and diversified, local and network based usage of goods than the current economy, which is comparatively linear, concentrated, long distance oriented and scale economy based. A gap in the literature is the assessment of the effects of these systems on freight transport flows. In our paper, we present a first attempt at estimating this impact using freight transport scenario building and quantitative modelling. In order to translate the main parameters that characterize these systems into factors determining freight transportation volumes, we develop a framework based on a typology of goods categories describing functional and spatial proximity between producers and consumers. In order to simulate changes in the economy, we develop scenarios for the shifting of goods from one category to another and, additionally, include internalization policies that should guide their realization. We calculate the impacts on freight flows using a new interregional transport model for France that includes distribution chains and produces estimates of external costs of transport. Our results show that circular and functional economies could lead to a 2–5% reduction of air pollutant emissions and up to a 14–26% reduction if combined with the internalization of external costs. The scenario with ongoing mass production for differentiated demand is found to lead to a 5% increase of environmental impacts compared to the baseline.     

Port-city exhaust emission model: An application to cruise and ferry operations in Las Palmas Port

Exhaust emissions cause air pollution and climate change. The exhausts of shipboard fuel combustion are equally damaging particularly, so close to the environmentally sensitive mainland and island coasts, as well as at ports due to their urbanized character. This paper estimates, for the first time, exhaust pollutants related to cruise and ferry operations in Las Palmas Port and, in an island context. Emission assessment is based on a full bottom-up model and messages transmitted by the Automatic Identification System during 2011. Results are described as a breakdown of NOx, SOx, PM_2.5, CO and CO₂, according to ship classes, operative type and time, providing valuable information to environmental policy makers in port-city areas and islands under similar conditions. It is generally concluded that vessel traffic and passenger shipping in particular are a source of air pollution in Las Palmas Port. Emission maps confirm location of hot spots in quays assigned for cruise and ferry operations. Policy recommendations encourage regular monitoring of exhaust emissions and market-based incentives supported by details on polluting and operative profiles. On the other hand, feasibility studies are suggested for automated mooring, LNG bunkering facilities and also shore-side energy services, prioritizing berthing of shipping sectors (or sub-sectors) with the highest share of exhaust emissions once their local effects have been confirmed by a dispersion, exposure and impact assessment.     

Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

This study investigates the important problem of determining a reliable path in a stochastic network with correlated link travel times. First, the distribution of path travel time is quantified by using trip records from GPS probe vehicles. Second, the spatial correlation of link travel time is explicitly considered by using a correlation coefficient matrix, which is incorporated into the α-reliable path problem by Cholesky decomposition. Third, the Lagrangian relaxation based framework is used to handle the α-reliable path problem, by which the intractable problem with a non-linear and non-additive structure can be decomposed into several easy-to-solve problems. Finally, the path-finding performance of this approach is tested on a real-world network. The results show that 15 iterations of calculation can yield a small relative gap between upper and lower bounds of the optimal solution and the average running time is about 5 s for most OD settings. The applicability of α-reliable path finding is validated by a case study.