沥青混凝土摊铺机熨平板与热沥青混合料相互作用的动力学模型

在介绍了沥青混凝土摊铺机熨平板与热沥青混合料相互作用的特点后，叙述了热沥青混合料的流变特性，并给出了流变模型，就此得出了熨平板与沥青混合料相互作用的三种动力学模型。     

净化消声器压力损失计算方法

本文综合运用流体力学、热力学及化学有关理论,对柴油机用的净化消声器的压力损失算法进行推导及试验验证,为在净化消声器设计阶段预测净化消声器对发动机性能的影响提供了可用的手段。     

城市公交线网优化的线性模型

为了对现有公交线网进行优化,有效利用现有交通资源,解决城市交通问题,运用系统科学的思想,通过对城市公交线网优化的主要内容、优化原则、优化目标以及约束条件的分析,兼顾考虑乘客出行时间、公交线网密度和公交企业的利益以及公交线网的布局对整个城市的交通系统的影响,提出了优化目标的函数表达式及相应约束条件的数学表达式,建立了公交线网优化的线性模型,并给出了运用逐步筛选法对所提出的数学模型进行求解的方法。     

山区高速公路填石路堤压实质量控制

目前对填石路堤的施工工艺与质量控制标准,世界各国、各地区的方法都不尽相同。本文针对填石路堤的特点,以宜长高速公路填石路堤为例,探讨和研究了山区高速公路填石路堤压实质量控制技术,将压实度、固体体积率、碾压遍数、松铺厚度、沉降率、动态模量等多种质量控制标准进行比较,从而比较合理地提出了填石路堤快速无损检测及质量控制方法。     

Optimization of terminal airspace operation with environmental considerations

The rapid growth in air traffic has resulted in increased emission and noise levels in terminal areas, which brings negative environmental impact to surrounding areas. This study aims to optimize terminal area operations by taking into account environmental constraints pertaining to emission and noise. A multi-objective terminal area resource allocation problem is formulated by employing the arrival fix allocation (AFA) problem, while minimizing aircraft holding time, emission, and noise. The NSGA-II algorithm is employed to find the optimal assignment of terminal fixes with given demand input and environmental considerations, by incorporating the continuous descent approach (CDA). A case study of the Shanghai terminal area yields the following results: (1) Compared with existing arrival fix locations and the first-come-first-serve (FCFS) strategy, the AFA reduces emissions by 19.6%, and the areas impacted by noise by 16.4%. AFA and CDA combined reduce the emissions by 28% and noise by 38.1%; (2) Flight delays caused by the imbalance of demand and supply can be reduced by 72% (AFA) and 81% (AFA and CDA) respectively, compared with the FCFS strategy. The study demonstrates the feasibility of the proposed optimization framework to reduce the environmental impact in terminal areas while improving the operational efficiency, as well as its potential to underpin sustainable air traffic management.     

Who you are is how you travel: A framework for transportation mode detection using individual and environmental characteristics

With the increasing prevalence of geo-enabled mobile phone applications, researchers can collect mobility data at a relatively high spatial and temporal resolution. Such data, however, lack semantic information such as the interaction of individuals with the transportation modes available. On the other hand, traditional mobility surveys provide detailed snapshots of the relation between socio-demographic characteristics and choice of transportation modes. Transportation mode detection is currently approached using features such as speed, acceleration and direction either on their own or in combination with GIS data. Combining such information with socio-demographic characteristics of travellers has the potential of offering a richer modelling framework that could facilitate better transportation mode detection using variables such as age and disability. In this paper, we explore the possibility to include both elements of the environment and individual characteristics of travellers in the task of transportation mode detection. Using dynamic Bayesian Networks, we model the transition matrix to account for such auxiliary data by using an informative Dirichlet prior constructed using data from traditional mobility surveys. Results have shown that it is possible to achieve comparable accuracy with the most widely used classification algorithms while having a rich modelling framework, even in the case of sparse mobility data.     

Tradable network permits: A new scheme for the most efficient use of network capacity

Akamatsu et al. (2006) proposed a new transportation demand management scheme called “tradable bottleneck permits” (TBP), and proved its efficiency properties for a single bottleneck model. This paper explores the properties of a TBP system for general networks. An equilibrium model is first constructed to describe the states under the TBP system with a single OD pair. It is proved that equilibrium resource allocation is efficient in the sense that the total transportation cost in a network is minimized. It is also shown that the “self-financing principle” holds for the TBP system. Furthermore, theoretical relationships between TBP and congestion pricing (CP) are discussed. It is demonstrated that TBP has definite advantages over CP when demand information is not perfect, whereas both TBP and CP are equivalent for the perfect information case. Finally, it is shown that the efficiency result also holds for more general demand conditions.     

Methods to reduce dimensionality and identify candidate solutions in multi-objective signal timing problems

Adjusting traffic signal timings is a practical way for agencies to manage urban traffic without the need for significant infrastructure investments. Signal timings are generally selected to minimize the total control delay vehicles experience at an intersection, particularly when the intersection is isolated or undersaturated. However, in practice, there are many other potential objectives that might be considered in signal timing design, including: total passenger delay, pedestrian delays, delay inequity among competing movements, total number of stopping maneuvers, among others. These objectives do not tend to share the same relationships with signal timing plans and some of these objectives may be in direct conflict. The research proposes the use of a new multi-objective optimization (MOO) visualization technique—the mosaic plot—to easily quantify and identify significant tradeoffs between competing objectives using the set of Pareto optimal solutions that are normally provided by MOO algorithms. Using this tool, methods are also proposed to identify and remove potentially redundant or unnecessary objectives that do not have any significant tradeoffs with others in an effort to reduce problem dimensionality. Since MOO procedures will still be needed if more than one objective remains and MOO algorithms generally provide a set of candidate solutions instead of a single final solution, two methods are proposed to rank the set of Pareto optimal solutions based on how well they balance between the competing objectives to provide a final recommendation. These methods rely on converting the objectives to dimensionless values based on the optimal value for each specific objectives, which allows for direct comparison between and weighting of each. The proposed methods are demonstrated using a simple numerical example of an undersaturated intersection where all objectives can be analytically obtained. However, they can be readily applied to other signal timing problems where objectives can be obtained using simulation outputs to help identify the signal timing plan that provides the most reasonable tradeoff between competing objectives.