Transient characteristics of emissions during engine start/stop operation employing a conventional gasoline engine for HEV application

In this paper, we investigate the transient characteristics of combustion and emissions during engine start/stop operations in hybrid electric vehicle (HEV) applications. Hydrocarbon (HC) emissions during the initial 2^nd∼9^th cycles are found to be significantly greater when the engine is quickly started under the original engine calibration mode. Lower intake manifold absolute pressure (MAP) was also found to cause larger residual gas dilution and poor combustion, resulting in a higher HC concentration when the cranking speed was increased. The post-catalyst HC concentration was found in the way of initially decrease and then to increase again as the cranking speed was increased. A lowest concentration value was achieved at a cranking speed of 1000 r/min. Engine shut-down by fuel cut-off was shown to produce lower emissions than shut-down by ignition cut-off as one can avoid misfire of the last fuel injection cycle. The fuel deposited during the stop process seems to impact engine restart enrichment mostly during the initial 0.7 s for this engine, whose performance is dominated by the MAP transition characteristic and the time coefficient for fuel vaporization in this time period     

就地冷再生技术在高速公路养护工程中的应用研究

就地冷再生技术具有施工便捷、污染小、旧料回收利用率高、节约成本等优势,在公路养护中得到了利用.以S49新扬高速为例,从适用条件、混合料设计、路用性能验证以及社会经济效益等方面,对就地冷再生技术进行系统研究,结果表明就地冷再生技术在高速公路养护工程中应用效果理想,可进行推广运用.     

柴油机曲轴有限元计算与台架试验数据对比分析

目前，国内柴油机行业普遍使用的曲轴弯曲疲劳强度试验台架，均采用音叉共振板结构。该试验台架对于大多数常规结构曲轴的连杆轴颈圆角疲劳强度的测定是比较准确的，但对于有些特殊结构曲轴的试验，却未能取得理想结果。以某曲轴台架试验、台架仿真模型及有限元计算模型数据为基础，分析对比了不同模型数据的差异及产生原因。     

汽车动力总成三点式悬置系统的设计方法探讨

首先分析汽车动力总成一悬置系统的振动激励、质量矩阵、刚度矩阵各元素的特点及其相互关系,阐释了系统弹性解耦设计的理论基础和重要性。然后根据动力总成一悬置系统刚度矩阵各元素的解析表达式,应用V形悬置组的弹性解耦原理,论述了目前普遍应用的三点式悬置系统在弹性解耦设计方面的问题,提出了悬置布置设计匹配的有效方法。     

An equivalent optimization problem for combined multiclass distribution,assignment and modal split which obviates symmetry restrictions

This paper presents a model for combined multiclass trip distribution, trip assignment and modal split. Although this model is based on an equivalent optimization problem, it avoids the symmetry restrictions heretofore always associated with such approaches to multiclass trip assignment. This is accomplished by expressing Wardrop's first principle as a set of nonlinear constraints in standard mathematical programming form. An algorithm is proposed, each iteration of which requires solving a nonlinear program with linear constraints.     

Modified lateral control of an autonomous vehicle by look-ahead and look-down sensing

This paper presents a modified lateral control method for an autonomous vehicle with both look-ahead and look-down sensing systems. To cope with sensor noise and modeling uncertainty in the lateral control of the vehicle, a modified LMI-based H lateral controller was proposed, which uses the look-ahead information of the lateral offset error measured at the front of vehicle and the look-down information of the vehicle yaw angle error between the reference lane and the centerline of the vehicle. To verify the safety and the performance of the lateral control, a scaled-down vehicle was developed, and the positioning of the vehicle was estimated with USAT. The proposed controller, which uses both look-ahead and look-down information, was tested for lane changing and reference lane tracking with both simulation and experiment. The simulation and experimental results show that the proposed controller has better tracking and handling performance compared with a controller that uses only the look-ahead information of the target heading angle error.     

Competition and disruption in a dynamic urban supply chain

Rapid changes and complexities in business environments have stressed the importance of interactions between partners and competitors, leading supply chains to become the most important element of contemporary business environments. There is a concomitant need for foresight in describing supply chain performance in all operating environments, including those involving punctuated disruptions. Furthermore, the urban metropolis is now widely recognized to be an environment which is especially vulnerable to supply chain disruptions and for which integrated supply chain decisions can produce very substantial net benefits. Accordingly, this paper presents a dynamic supply chain network model formulated as a differential variational inequality; the model is fashioned to allow consideration of supply chain disruption threats to producers, freight carriers, and retail enterprises. The DVI is solved using a fixed-point algorithm, and a simple numerical example, introduced to illustrate how the impacts of supply chain disruptions may be quantified, is presented.     

Approximate network loading and dual-time-scale dynamic user equilibrium

In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.     

A network option portfolio management framework for adaptive transportation planning

A real option portfolio management framework is proposed to make use of an adaptive network design problem developed using stochastic dynamic programming methodologies. The framework is extended from Smit’s and Trigeorgis’ option portfolio framework to incorporate network synergies. The adaptive planning framework is defined and tested on a case study with time series origin-destination demand data. Historically, OD time series data is costly to obtain, and there has not been much need for it because most transportation models use a single time-invariant estimate based on deterministic forecasting of demand. Despite the high cost and institutional barriers of obtaining abundant OD time series data, we illustrate how having higher fidelity data along with an adaptive planning framework can result in a number of improved management strategies. An insertion heuristic is adopted to run the lower bound adaptive network design problem for a coarse Iran network with 834 nodes, 1121 links, and 10 years of time series data for 71,795 OD pairs.