Berth assignment planning for multi‐line bus stops

In this paper, we study an important problem that arises with the fast development of public transportation systems: when a large number of bus lines share the same bus stop, a long queue of buses often forms when they wait to get into the stop in rush hours. This causes a significant increase of bus delay and a notable drop of traffic capacity near the bus stop. Various measures had been proposed to relieve the congestions near bus stops. However, all of them require considerable financial budgets and construction time costs. In this paper, with the concept of berth assignment redesign, a simulation‐based heuristic algorithm is proposed to make full use of exiting bus berths. In this study, a trustable simulation platform is designed, and the major influencing factors for bus stop operations are considered. The concept of risk control is also introduced to better evaluate the performance of different berth arrangement plans and makes an appropriate trade‐off between the system's efficiency and stability. Finally, a heuristic algorithm is proposed to find a sub‐optimal berth assignment plan. Tests on a typical bus stop show that this algorithm is efficient and fast. The sub‐optimal berth assignment plan obtained by this algorithm could make remarkable improvements to an actual bus stop. Copyright © 2013 John Wiley & Sons, Ltd.     

Data mining using regularized adaptive B‐splines regression with penalization for multi‐regime traffic stream models

This paper presents a new data mining method that integrates adaptive B‐spline regression and traffic flow theory to develop multi‐regime traffic stream models (TSMs). Parameter estimation is implemented adaptively and optimally through a constrained bi‐level programming method. The slave programming determines positions of knots and coefficients of the B‐spline by minimizing the error of B‐spline regression. The master programming model determines the number of knots through a regularized function, which balances model accuracy and model complexity. This bi‐level programming method produces the best fitting to speed–density observations under specific order of splines and possesses great flexibility to accommodate the exhibited nonlinearity in speed–density relationships. Jam density can be estimated naturally using spline TSM, which is sometimes hardly obtainable in many other TSM. Derivative continuity up to one order lower than the highest spline degree can be preserved, a desirable property in some application. A five‐regime B‐spline model is found to exist for generalized speed–density relationships to accommodate five traffic operating conditions: free flow, transition, synchronized flow, stop and go traffic, and jam condition. A typical two‐regime B‐spline form is also explicitly given, depending only on free‐flow speed, optimal speed, optimal density, and jam density. Copyright © 2013 John Wiley & Sons, Ltd.     

Traffic signal timing problems with environmental and equity considerations

Traffic signal timings in a road network can not only affect total user travel time and total amount of traffic emissions in the network but also create an inequity problem in terms of the change in travel costs of users traveling between different locations. This paper proposes a multi‐objective bi‐level programming model for design of sustainable and equitable traffic signal timings for a congested signal‐controlled road network. The upper level of the proposed model is a multi‐objective programming problem with an equity constraint that maximizes the reserve capacity of the network and minimizes the total amount of traffic emissions. The lower level is a deterministic network user equilibrium problem that considers the vehicle delays at signalized intersections of the network. To solve the proposed model, an approach for normalizing incommensurable objective functions is presented, and a heuristic solution algorithm that combines a penalty function approach and a simulated annealing method is developed. Two numerical examples are presented to show the effects of reserve capacity improvement and green time proportion on network flow distribution and transportation system performance and the importance of incorporating environmental and equity objectives in the traffic signal timing problems. Copyright © 2013 John Wiley & Sons, Ltd.     

嵌入式以太网控制芯片的低功耗DFT设计

基于一款嵌入式以太网控制芯片,对不同电路采用不同的低功耗DFT测试技术,以获得较低的测试成本和测试功耗：对于数字逻辑电路,采用了基于扫描链的测试技术,实现了减少翻转次数的测试电路结构;对于片内集成的SRAM、ROM存储器,采用了基于MBIST的测试技术,通过实现准单跳变测试向量生成电路,屏蔽掉无用的测试向量;同时,采用门控时钟等方法来降低CUT输入端的活动性,从而降低CUT上的动态测试功耗;通过采用这些测试方法,该芯片的故障覆盖率可达到97%。     

基于模糊SOFM网分类的船舶电力负荷估算模型

提出了一种新的船舶电力负荷分类随机估算模型。将负荷的功率和工作概率作为分类的两项指标，利用模糊自组织特征映射（SOFM）网络对负荷进行分类，并基于分类给出了电力负荷的随机估算模型。由于分类保证了同一类中的负荷，其功率和工作概率均较接近，从而减小了因分类而导致的模型误差。给出了一个实例，其结果表明：模型精度高，计算简单，易于实现。     

世界秩序发展的内在机制与一般规律

世界秩序是一个特殊的以整个人类社会为基础的社会型自组织系统,其运行过程始于外部信息对世界秩序原有结构的作用,终于符合世界社会总体目标要求的新的世界秩序结构的建立。世界秩序的自组织运动是一个充满着种种矛盾的辩证发展过程,并严格遵循着事物发展的普遍规律。世界秩序在外部信息的影响下,内部涨落的推动下,经过同化自组织和顺应自组织活动,由有序稳定发展到无序失衡,再由无序失衡发展到新的有序稳定,如此循环往复,以至无穷,而每一次新的有序稳定都是在更高一级上实现了世界秩序的发展。这就是世界秩序演变的一般规律。     

到球面上的四维非齐次双调和映射连续性

对到球面上的四维非齐次双调和映射,本文根据球面的几何结构和四维Lorentz空间的特殊性,得到了在Lorentz空间的估计式,从而得到其弱解的连续性结果.     

The analysis of motor vehicle crash clusters using the vector quantization technique

In this paper, a powerful tool for analyzing motor vehicle data based on the vector quantization (VQ) technique is demonstrated. The technique uses an approximation of a probability density function for a stochastic vector without assuming an “a priori” distribution. A self‐organizing map (SOM) is used to transform accident data from an N‐dimensional space into a two‐dimensional plane. The SOM retains all the original data yet provides an effective visual tool for describing patterns such as the frequency at which a particular category of events occurs. This enables new relationships to be identified. Accident data from three cities in Italy (Turin, Milan, and Legnano) are used to illustrate the usefulness of the technique. Crashes are aggregated and clustered crashes by type, severity, and along other dimensions. The paper includes discussion as to how this method can be utilized to further improve safety analysis. Copyright © 2010 John Wiley & Sons, Ltd.     

Hybrid simulated annealing and genetic algorithm for optimizing arterial signal timings under oversaturated traffic conditions

The implementation of system‐wide signal optimization models requires efficient solution algorithms that can quickly generate optimal or near‐optimal signal timings. This paper presents a hybrid algorithm based on simulated annealing (SA) and a genetic algorithm (GA) for arterial signal timing optimization. A decoding scheme is proposed that exploits our prior expectations about efficient solutions, namely, that the optimal green time distribution should reflect the proportion of the critical lane volumes of each phase. An SA algorithm, a GA algorithm and a hybrid SA‐GA algorithm are developed here using the proposed decoding scheme. These algorithms can be adapted to a wide range of signal optimization models and are especially suitable for those optimizing phase sequences with oversaturated intersections. To comparatively evaluate the performance of the proposed algorithms, we apply them to a signal optimization model for oversaturated arterial intersections based on an enhanced cell transmission model. The numerical results indicate that the SA‐GA algorithm outperforms both SA and GA in terms of solution quality and convergence rate. Copyright © 2014 John Wiley & Sons, Ltd.